Capacity performance of dynamic provisioning in optical networks

This paper describes an architecture and analyzes the performance of dynamic provisioning of lightpaths in an optical network. In dynamic provisioning, a lightpath is set up in real-time without rearranging the working and protection routes of existing lightpaths, and without the knowledge of future lightpath provisioning events. This paper develops a general model of the physical topology of the optical network, and outlines routing approaches for dynamic provisioning of lightpaths. It analyzes via simulations the performance of dynamically provisioned unprotected, 1+1 protected and mesh-restored lightpaths. The analysis of the efficiency of network utilization of dynamic provisioning focuses on the spare capacity needed for protection, and in particular focuses on the impact of sharing of wavelength channels for mesh-restored lightpaths. The main conclusion from the performance studies is that significant capacity gains are achieved with sharing of wavelength-channels for mesh-restored lightpaths with dynamic provisioning even for sparse topologies, and even at moderate loads     

Lightpath arrangement in survivable rings to minimize the switchingcost

This paper studies the design of low-cost survivable wavelength-division-multiplexing (WDM) networks. To achieve survivability, lightpaths are arranged as a set of rings. Arrangement in rings is also necessary to support SONET/SDH protection schemes such as 4FBLSR above the optical layer. This is expected to be the most common architecture in regional (metro) networks. We assume that we are given a set of lightpaths in an arbitrary network topology and aim at finding a partition of the lightpaths to rings adding a minimum number of lightpaths to the original set. The cost measure that we consider (number of lightpaths) reflects the switching cost of the entire network. In the case of a SONET/SDH higher layer, the number of lightpaths is equal to the number of add-drop multiplexers (ADMs) (since two subsequent lightpaths in a ring can share an ADM at the common node). We prove some negative results on the tractability and approximability of the problem and provide an approximation algorithm with a worst case approximation ratio of 8/5. We study some special cases in which the performance of the algorithm is improved. A similar problem was introduced, motivated, and studied by Liu, Li, Wan and Frieder (see Proc. INFOCOM 2000, p.1020-1025, 2000) Gerstel, Lin and Sasaki, (see Proc. IEEE INFOCOM '98, p. 94-101, 1998)(where it was termed minimum ADM problem). However, these two works focused on a ring topology while we generalize the problem to an arbitrary network topology     

Web services architecture for user control and management of optical Internet networks

One of the primary goals of the CA*net 4 network is to provide end users with the ability, on a peer-to-peer basis, to provision, manage, and control the routing of their own lightpaths across the network without the need to signal or request services from any central network management authority or server. A novel approach to such end-user management and control of lightpaths is described, which uses Web services architecture and grid technology.     

From network design to dynamic provisioning and restoration inoptical cross-connect mesh networks: an architectural and algorithmicoverview

This article presents a broad overview of the architectural and algorithmic aspects involved in deploying an optical cross-connect mesh network, starting from the network design and capacity planning phase to the real-time network operation phase involving dynamic provisioning and restoration of lightpaths and online algorithms for route computation. Frameworks for offline design and capacity planning of optical networks based on projected future lightpath demands are discussed. The essential components of an IP-centric control architecture for dynamic provisioning and restoration of lightpaths in optical networks are outlined. These include neighbor discovery, topology discovery, route computation, lightpath establishment, and lightpath restoration. Online algorithms for route computation of unprotected, 1+1 protected and mesh-restored lightpaths are discussed in both the centralized and distributed scenarios     

Constrained and Unconstrained overspill routing in optical networks: a detailed performance evaluation

In this article, we present a detailed performance evaluation of a hybrid optical switching (HOS) architecture called Overspill Routing in Optical Networks (ORION). The ORION architecture combines (optical) wavelength and (electronic) packet switching, so as to obtain the individual advantages of both switching paradigms. In particular, ORION exploits the possible idle periods of established lightpaths to transmit packets destined to the next common node, or even directly to their common end-destination. Depending on whether all lightpaths are allowed to simultaneously carry and terminate overspill traffic or overspill is restricted to a sub-set of wavelengths, the architecture limits itself to constrained or un-constrained ORION. To evaluate both cases, we developed an extensive network simulator where the basic features of the ORION architecture were modeled, including suitable edge/core node switches and load-varying sources to simulate overloading traffic conditions. Further, we have assessed various aspects of the ORION architecture including two basic routing/forwarding policies and various buffering schemes. The complete network study shows that ORION can absorb temporal traffic overloads, as intended, provided sufficient buffering is present. We also demonstrate that the restriction of simultaneous packet insertions/extractions, to reduce the necessary interfaces, do not deteriorate performance and thus the use of traffic concentrators assure ORION’s economic viability.     

ASON光网格中基于GridFTP的资源并行调度机制

为解决面向应用驱动的网格资源动态分配,提出基于ASON的光网格模型,在此基础上提出面向GridFTP服务的并行网络资源调度机制.并行资源调度借助于光资源控制系统提供网格应用中并行通道数据传输,在网格应用驱动下实现网络资源的动态按需分配,提高了光资源利用效率及海量数据传输能力.通过构建基于ASON的光网格平台体系,执行DridFTP文件传输应用服务以验证所提模型和资源调度机制.     

Quality-of-Service Based Protection in MPLS Control WDM Mesh Networks

Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization.     

Optical dynamic intelligent network services (ODIN): an experimental control-plane architecture for high-performance distributed environments based on dynamic lightpath provisioning

Currently, many large-scale, resource-intensive applications and services are being developed that can be supported only with high-performance, highly distributed, heterogeneous infrastructures, including grids. This type of infrastructure is particularly effective for supporting applications and services that must quickly adjust to continuously changing conditions. Such processes require the flexibility of highly adaptive, dynamic, and deterministic resource provisioning. One such architecture is described here. To enhance the performance and flexibility of distributed environments, an experimental architecture for optical dynamic intelligent network (ODIN) services has been designed to enable core optical network capabilities to extend to edge processes, including applications. This architecture allows those processes to directly address arid control core network resources, for example, individual lightpaths on demand. This approach supports flexible and deterministic communications by integrating signaled requirements with adjustable network resources. An experimental prototype of ODIN has been designed, developed, and implemented on several optical network testbeds.     

Worst-case analysis of dynamic wavelength allocation in opticalnetworks

This paper proposes algorithms for allocating wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. A worst-case model is considered, where no blocking of lightpaths is allowed, and there are no assumptions made on the traffic arrival and holding times. The traffic is characterized only by its load L, which is the maximum number of lightpaths that can be present on any link, assuming no blocking. A dynamic traffic model is considered where requests to set up lightpaths arrive over time and, must be accommodated without rerouting existing lightpaths, and lightpaths may be terminated over time as well. For networks without wavelength conversion, we show that at least 0.5Llog ₂N wavelengths are required by any dynamic algorithm for rings of N nodes and present an algorithm that uses at most Llog₂ N+L wavelengths for rings and 2(L-1)log₂N for trees. We also study the worst-case behavior of the well-known first-fit algorithm, and show that it requires at most 2.52Llog₂N+5L wavelengths (small variants of these constants are proven as well). When limited wavelength conversion is allowed, we first show how to use expanders to insure no blocking in arbitrary topologies. Then, we present conversion patterns for rings with conversion degree d=2, which require Llog₂L+4L or 2Llog₂log₂L+4L wavelengths, thereby eliminating the dependence (that exists without wavelength conversion) between the number of wavelengths and N. We also consider different traffic models where lightpath setup requests arrive over time, but once set up, lightpaths are never taken down. For this model, the number of wavelengths needed is shown to be only max{0,L-d}+L for a conversion degree of d     

Optimal virtual topologies for one-to-many communication in WDM paths and rings

In this paper we examine the problem of constructing optimal virtual topologies for one-to-many communication in optical networks employing wavelength-division multiplexing. A virtual topology is a collection of optical lightpaths embedded in a physical topology. A packet sent from the source node travels over one or more lightpaths en route to its destination. Within a lightpath, transmission is entirely optical. At the terminus of a lightpath the data is converted into the electronic domain where it may be retransmitted on another lightpath toward its destination. Since the conversion of the packet from the optical to the electronic domain introduces delays and uses limited physical resources, one important objective is to find virtual topologies which minimize either the maximum or average number of lightpaths used from the source to all destination nodes. Although this problem is NP-complete in general, we show that minimizing the maximum or average number of lightpaths in path and ring topologies can be solved optimally by efficient algorithms.     

Edge-Reconfigurable Optical Networks (ERONs): Rationale, Network Design, and Evaluation

To bridge the gap between the current practice of setting up expensive, dedicated, lightpath connections (i.e., static topologies), and the distant future vision of inexpensive access to dynamically switched end-to-end lightpaths, we propose a medium term solution in the form of edge-reconfigurable optical networks (ERONs). An ERON is an overlay-control network created by installing readily available MEMS optical switches, and implementing a GMPLS control plane at sites interconnected by static lightpaths. The switches and control software are deployed at the edge of the network and operated by the organization-user (i.e., outside the network provider's control), hence the term ldquoedge-reconfigurablerdquo. By providing dynamic, automated control of end-to-end lightpaths, ERONs enable the sharing of expensive network resources among multiple users and applications that require sporadic access to these resources. We develop an algorithm for creating an ERON from an existing topology of static lightpaths. We also present simulation results that quantify the benefits of ERONs, in terms of the number of lightpaths that are needed when compared to a static configuration of independent and dedicated circuits.     

Reconfiguration of Logical Topologies with Minimum Traffic Disruptions in Reliable WDM-Based Mesh Networks

A wavelength division multiplexing (WDM) network offers a flexible networking infrastructure by assigning the route and wavelength of lightpaths. We can construct an optimal logical topology, by properly setting up the lightpaths. Furthermore, setting up a backup lightpath for each lightpath improves network reliability. When traffic demand changes, a new optimal (or sub-optimal) topology should be obtained by again applying the formulation. Then, we can reconfigure the running topology to the logical topology obtained. However, during this reconfiguration, traffic loss may occur due to the deletion of older lightpaths. In this paper, we consider reconfiguring the logical topology in reliable WDM-based mesh networks, and we propose five procedures that can be used to reconfigure a running lightpath to a new one. Applying the procedures one by one produces a new logical topology. The procedures mainly focus on utilizing free wavelength resources and the resources of backup lightpaths, which are not used usually for transporting traffic. The results of computer simulations indicate that the traffic loss is remarkably reduced in the 14-node network we used as an example.     

A time optimal wavelength rerouting algorithm for dynamic trafficin WDM networks

In this paper, we consider wavelength rerouting in wavelength routed wavelength division multiplexed (WDM) networks with circuit switching, wherein lightpaths between source-destination pairs are dynamically established and released in response to a random pattern of arriving connection requests and connection holding times. The wavelength continuity constraint imposed by WDM networks leads to poor blocking performance. Wavelength rerouting is a viable and cost effective mechanism that ran improve the blocking performance by rearranging certain existing lightpaths to accommodate a new request. Recently, a rerouting scheme called “parallel move-to-vacant wavelength retuning (MTV-WR)” with many attractive features such as shorter disruption period and simple switching control, and a polynomial time rerouting algorithm, for this scheme, to minimize the weighted number of rerouted lightpaths have been proposed. This paper presents a time optimal rerouting algorithm for wavelength-routed WDM networks with parallel MTV-WR rerouting scheme. The algorithm requires only O(N²W) time units to minimize the weighted number of existing lightpaths to be rerouted, where N is the number of nodes in the network and W is the number of wavelength channels available on a fiber link. Our algorithm is an improvement over the earlier algorithm proposed in that it requires O(N³W+N²W²) time units, which is not time optimal. The simulation results show that our algorithm improves the blocking performance considerably and only very few lightpaths are required to be rerouted per rerouting. It is also established through simulation that our algorithm is faster than the earlier rerouting algorithm by measuring the time required for processing connection requests for different networks     

Multiwavelength optical networks with limited wavelength conversion

This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can efficiently support lightpaths (connections) between nodes. Each lightpath follows a route in a network and must be assigned a channel on each link along the route. The load λ_max of a set of lightpaths is the maximum over all links of the number of lightpaths that use the link. At least λ_max wavelengths will be needed to assign channels to the lightpaths. If the network has full wavelength conversion capabilities, then λ_max wavelengths are sufficient to perform the channel assignment. Ring networks with fixed wavelength conversion capability within the nodes are proposed that can support all lightpath sets with load λ_max at most W-1, where W is the number of wavelengths in each link. Ring networks with a small additional amount of wavelength conversion capability within the nodes are also proposed that allow the support of any set of lightpaths with load λ_max at most W. A star network is also proposed with fixed wavelength conversion capability at its hub node that can support all lightpath sets with load λ_max at most W. These results are extended to tree networks and networks with arbitrary topologies. This provides evidence that significant improvements in traffic-carrying capacity can be obtained in WDM networks by providing very limited wavelength conversion capability within the network     

A practical approach for routing and wavelength assignment in largewavelength-routed optical networks

We consider large optical networks in which nodes employ wavelength-routing switches which enable the establishment of wavelength-division-multiplexed (WDM) channels, called lightpaths, between node pairs. We propose a practical approach to solve routing and wavelength assignment (RWA) of lightpaths in such networks. A large RWA problem is partitioned into several smaller subproblems, each of which may be solved independently and efficiently using well-known approximation techniques. A multicommodity flow formulation combined with randomized rounding is employed to calculate the routes for lightpaths. Wavelength assignments for lightpaths are performed based on graph-coloring techniques. Representative numerical examples indicate the accuracy of our algorithms     

Comprehensive design methodology for control and data planes in wavelength-routed optical networks

We propose a comprehensive design methodology for control and data planes of wavelength-routed optical networks (WRONs) employing mixed-line-rate (MLR) transmission for cost-effective resource provisioning. The proposed approach attempts to minimize the maximum lightpath capacity demand in Gbps (representing the measure of lightpath congestion) in network for a given traffic matrix by using a mix of a heuristic scheme and linear programming (LP). In the first step of the proposed three-step design, some lightpaths are set up on a set of judiciously selected fiber links (with point-to-point lightpaths between neighboring nodes), on a specific wavelength throughout the network, and an appropriate fraction of the same set of lightpaths is utilized for carrying control information, forming therefore the control plane (CP) of the WRON. The remaining bandwidth of these lightpaths is utilized to carry the data traffic along with all other designed lightpaths of the WRON using appropriate algorithm, forming the overall data plane (DP) of the WRON. In the second step, traffic routing is carried out through LP to minimize lightpath congestion in the network. In the third step, we utilize the results of LP to assign rates to lightpaths, such that the cost (considering only the transceiver cost) of the network is minimized. This design leads to congestion-aware MLR network with due consideration to cost-effectiveness without compromising the network restoration response against link failures. We carry out simulation studies employing possible CPs using both symmetric (CP topology being same as the physical topology) as well as asymmetric (using fewer fiber links than the symmetric case) topology. The results of our simulations indicate that the proposed design of CP with symmetric/asymmetric topology and in-band transmission with sub-lightpath capacity can bring down network congestion and cost with respect to symmetric out-of-band transmission (using fully reserved lightpaths for CP), without any perceptible sacrifice in respect of the network restoration time. Failure can occur either in CP or DP, or in both the planes. We investigate the effect of design of CP with symmetric/asymmetric topology on network restoration time for single- and double-link failures. We further present DP design methodology with hybrid restoration scheme, i.e., combination of dedicated (1:1) path protection and path restoration. We analyze the effect of symmetric CP topology and degree of protection on the congestion of the network. Some lightpaths, that support more traffic, are protected against failures, while the others are left for path restoration in the event of failures. As more lightpaths are protected, the congestion and power consumption of network increase. We provide an analysis of the factors that come into play while altering the degree of protection and observe how the choice for the degree of protection in DP can be arrived at using an appropriate design methodology.     

Lightpath (wavelength) routing in large WDM networks

We address the problem of efficient circuit switching in wide area optical networks. The solution provided is based on finding optimal routes for lightpaths and the new concept of semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining together several lightpaths, using wavelength conversion at their junctions. A fast and practical algorithm is presented to optimally route lightpaths and semilightpaths taking into account both the cost of using the wavelengths on links and the cost of wavelength conversion. We prove that the running time of the algorithm is the best possible in the wide class of algorithms allowing linear algebraic operations on weights. This class encompasses all known related practical methods. Additionally, our method works for any physical realization of wavelength conversion, independently whether it is done via optoelectronic conversion or in a fully optical way     

Policy-driven automated reconfiguration for performance management in WDM optical networks

A key feature of optical networks based on WDM technology is the ability to optimize the configuration of optimal resources (i.e., wavelengths) with respect to a particular traffic demand. In the broadcast architecture, this involves the assignment of wavelengths to logical links, while in the optically switched architecture it additionally involves the routing of all-optical data paths known as lightpaths. This survey article is concerned with the problem of automatically updating the configuration of an optical network to accommodate changes in traffic demand, which entails making a reconfiguration policy decision, selecting a new configuration and migrating from the current to the new configuration. Existing solutions are classified according to their algorithmic properties, and compared on the basis performance, computational cost, and flexibility. Finally, open problems and research directions are discussed.     

Energy‐aware traffic allocation to optical lightpaths in multilayer core networks

The amount of traffic that is generated by users and high‐demanding services is expected to rise dramatically in the forthcoming years. This will unavoidably deteriorate the performance and increase the consumed energy of core networks, thus constraining the growth of Internet. To this effect, multilayer traffic engineering schemes in IP/multiprotocol label switching over dense wavelength division multiplexing networks have been proposed for achieving improved performance and increased energy savings by flexibly allocating traffic to optical lightpaths. In particular, the consumed energy in a router can be minimized if the lightpaths are established so as to traverse a router without electronic processing and conversion of their signal between optical and electrical layer. Accordingly, this paper aims at providing an energy‐aware solution to the problem of traffic allocation to optical lightpaths in multilayer core networks. The problem is first formulated and then a solution based on a heuristic algorithm, called energy‐aware traffic allocation to optical lightpaths (ETAL) is proposed. The efficiency and worthiness of ETAL is validated through numerous scenarios and simulations. The derived results indicate that the proposed algorithm is an efficient traffic engineering solution that exhibits better performance in terms of consumed energy (up to 44%), when compared to other similar traffic allocation schemes. Copyright © 2015 John Wiley & Sons, Ltd.     

Design methodology for WDM backbone networks using FWM-aware heuristic algorithm

The problem of lightpath topology design (LTD) and traffic routing over the lightpaths for wavelength-routed optical backbone networks has been investigated extensively in the past using heuristic as well as linear-programming based approaches. Sensitivity of such long-haul backbones to physical-layer impairments is required to be adequately addressed during LTD phase to improve overall performance. For optical communication using wavelength-division multiplexing (WDM) over a long-haul fiber backbone, four-wave mixing (FWM) may become one of the significant transmission impairments. Intrinsically, for a WDM-based wavelength-routed network with wavelengths assigned using equally-spaced channels, the generated FWM components are found to remain more crowded at the center of the fiber transmission window. Using this observation, we propose an LTD scheme employing a unique wavelength assignment (WA) technique, wherein long lightpaths (traversing through a larger number of fiber links) are allocated wavelengths at the either edges of the fiber transmission window whereas short lightpaths (consisting of fewer fiber links) are placed in the middle of the transmission window, thereby reducing the FWM crosstalk for long lightpaths. Since long lightpaths comprise of large numbers of fiber links and intermediate nodes, they experience large amplified spontaneous emission (ASE) noise and switch crosstalk. Therefore, by using the proposed WA technique, long lightpaths while suffering from more ASE noise and switch crosstalk get subjected to lesser FWM crosstalk leading to a more uniform distribution of overall optical signal-to-noise ratio for all the lightpaths across the network. Analysis of our results indicates that the proposed FWM-aware LTD scheme with the novel WA technique can achieve similar congestion levels (of lightpaths) and bandwidth utilization efficiency without any need of additional network resources as compared with the existing FWM-unaware LTD schemes.