Search

This paper focuses on the concept of dynamic virtual optical networks (VONs) as a key enabling technology to support the requirements of the future Internet. To address the unpredictable nature of services and their characteristics, dynamic and on-demand planning and replanning of VONs is required. This paper proposes the use of novel modeling approaches to specifically consider the uncertain nature of traffic requests. In addition, it studies mechanisms to evaluate and minimize the impact of this uncertainty on the availability and efficiency of the virtual resources, considering at the same time requirements such as service resilience and security. The effect of periodic VON replanning is investigated and the relevant trade-offs are identified. Our modeling results show that taking into consideration the dynamic and uncertain nature of services provides significant benefits regarding the ability of the infrastructure to support these services and the associated resource efficiency. [ABSTRACT FROM PUBLISHER]

Rising energy costs and climate change have led to an increased concern for energy efficiency (EE). As information and communication technology is responsible for about 4% of total energy consumption worldwide, it is essential to devise policies aimed at reducing it. In this paper, we propose a routing and scheduling algorithm for a cloud architecture that targets minimal total energy consumption by enabling switching off unused network and/or information technology (IT) resources, exploiting the cloud-specific anycast principle. A detailed energy model for the entire cloud infrastructure comprising a wide-area optical network and IT resources is provided. This model is used to make a single-step decision on which IT end points to use for a given request, including the routing of the network connection toward these end points. Our simulations quantitatively assess the EE algorithm's potential energy savings but also assess the influence this may have on traditional quality-of-service parameters such as service blocking. Furthermore, we compare the one-step scheduling with traditional scheduling and routing schemes, which calculate the resource provisioning in a two-step approach (selecting first the destination IT end point and subsequently using unicast routing toward it). We show that depending on the offered infrastructure load, our proposed one-step calculation considerably lowers the total energy consumption (reduction up to 50%) compared to the traditional iterative scheduling and routing, especially in low- to medium-load scenarios, without any significant increase in the service blocking. [ABSTRACT FROM PUBLISHER]

This paper presents a detailed study of planning virtual infrastructures (VIs) over a physical infrastructure comprising integrated optical network and data center resources with the aim of enabling sharing of physical resources among several virtual operators and services. Through the planning process, the VI topology and virtual resources are identified and mapped to the physical resources. Our study assumes a practical VI demand model without any in advance global knowledge of the VI requests that are handled sequentially. Through detailed integer linear program modeling, two objective functions — one that minimizes the overall power consumption of the infrastructure and one that minimizes the wavelength utilization — are compared. Both are evaluated for the virtual wavelength path and wavelength path optical network architectures. The first objective results in power consumption savings and the two optical network architectures provide similar performances. However, the trend changes for higher load values, due to the inefficient wavelength utilization that the first objective leads to. Finally, we compare the virtual infrastructures created by the two objectives through online traffic provisioning simulations. The objective minimizing wavelength utilization results in VIs suffering higher request blocking compared to the VIs created by the objective minimizing the overall power consumption. [ABSTRACT FROM PUBLISHER]

This work evaluates the performance of an impairment-aware routing (IAR) scheme in the presence of single- and dual-link failures. Network resilience is provided through a shared backup path protection scheme, enhanced with a reinforced sharing mechanism. The results indicate that the IAR scheme provides significantly lower connection blocking compared with traditional minimum-hop routing because physical impairments have a significant contribution to the overall network blocking probability. Dual-link failures are also considered, and the performance of a network designed to be resilient to single-link failures is evaluated. Simulation results show low connection loss rates due to dual failures that can be further improved using a restoration mechanism activated on the occurrence of dual failures. [ABSTRACT FROM PUBLISHER]