Distributed dynamic QoS-aware routing in WDM optical networks
TL;DR: This paper proposes distributed dynamic routing algorithms for QoS constrained routing and survivable routing, based on preferred link routing approach, and proposes a distributed routing algorithm for fault-tolerant connections and describes how dedicated and shared protection can be provided in the case of single link failures.
About: This article is published in Computer Networks.The article was published on 2005-07-15. It has received 7 citations till now. The article focuses on the topics: Static routing & Dynamic Source Routing.
Citations
More filters
TL;DR: The proposed SADQ is the first scheme in optical networks to employ exhaustive differentiation at the levels of routing, spectrum allocation, and survivability in a single algorithm and is compared with two existing benchmark routing and spectrum allocation schemes designed under EONs.
27 citations
TL;DR: A hybrid routing and wavelength assignment algorithm that achieves lower energy consumption than a pure load-balancing algorithm while keeping the network load fairly distributed on the available resources.
13 citations
Cites background from "Distributed dynamic QoS-aware routi..."
...Analogously, the distributed dynamic routing approach proposed in [5] provides a common RWA framework considering traffic demands at the wavelength level and using additive and multiplicative metrics to achieve protection in case of single link failure....
[...]
TL;DR: This proposal exploits and refines the minimum interference routing idea according to an improved and re-optimized resource and traffic-aware approach, where critical links are detected and weighted according to a low complexity all-pairs minimum cut strategy that substantially reduce the overall number of calculations and hence the computational cost.
Abstract: Advances in optical technologies have enabled the deployment of wavelength division-multiplexed (WDM) transmission systems capable of providing huge amounts of bandwidth across long distances. In this scenario, dynamic routing for direct provisioning of optical paths at the WDM layer becomes a challenging problem. Any distributed algorithm for routing dynamic traffic demands on optical transport infrastructures should be simple, flexible, efficient and scalable. The contribution of this paper is a novel integrated routing and grooming scheme for setting-up bandwidth guaranteed paths on hybrid wavelength and label switched networks. Our proposal exploits and refines the minimum interference routing idea according to an improved and re-optimized resource and traffic-aware approach, where critical links are detected and weighted according to a low complexity all-pairs minimum cut strategy that substantially reduce the overall number of calculations and hence the computational cost. The valuable results achieved in the comparison against other well-known reference techniques clearly demonstrate that our algorithm is very time-efficient while performing better in terms of blocking probability.
6 citations
01 Dec 2011
TL;DR: An Advanced Centralized RWA Protocol in which the cost of a lightpath is computed based on its number of available free wavelengths and number of wavelength conversions, which shows that the proposed protocol has minimal request rejection and set-up time.
Abstract: In this paper we present the design of an Advanced Centralized RWA Protocol (ACRP) in which the cost of a lightpath is computed based on its number of available free wavelengths and number of wavelength conversions. Centralized Management System (CMS I) assigns optimal primary and backup lightpaths. CMS II updates the optimal primary and backup lightpaths as and when the number of free wavelengths of primary lightpath reaches the threshold value ‘N≤ 4’. In case of failure the data will be rerouted through the backup lightpath and very next lightpath with best cost is assigned as backup lightpath. The advantage of this protocol is that the tasks are shared using two CMS which improves the computation bottleneck and also if one fails the other will take over the entire process. By simulation results, we showed that our proposed protocol has minimal request rejection and set-up time.
6 citations
Additional excerpts
...[10], proposed distributed dynamic routing algorithms for QoS constrained routing and survivable routing based on preferred link routing approach....
[...]
TL;DR: A new traffic engineering-capable routing and wavelength assignment scheme is proposed to efficiently handle LSP and lightpath setup requests with different QoS requirements on modern multi-layer (fully optical core and time-division multiplexed edge) transport networks.
Abstract: In this paper, a new traffic engineering-capable routing and wavelength assignment scheme is proposed to efficiently handle LSP and lightpath setup requests with different QoS requirements on modern multi-layer (fully optical core and time-division multiplexed edge) transport networks. The objectives of the proposed algorithm are to minimize the rejection probability by maximizing the network load balancing and efficiently handling the grooming of several LSPs on the same lightpath while respecting the constraints of the optical node architecture and considering both traffic engineering and QoS requirements. The proposed solution consists of a two-stage RWA algorithm: each time a new request arrives, an on-line dynamic grooming scheme finds a set of feasible lightpaths which fulfill the QoS and traffic engineering requirements; then, the best feasible lightpath is selected, aiming to keep the network unbalancing and blocking probability as low as possible in the medium and long term, according to a novel global path affinity minimization concept. Extensive simulation experiments have been performed in which our on-line dynamic RWA algorithm demonstrated significant performances. Thanks to its optimal network resource usage and to its reasonable computational space and time complexity, the algorithm can be very attractive for the next-generation optical wavelength-switched networks.
3 citations
References
More filters
Book•
01 Jan 1998TL;DR: The second edition of Optical Networks: A Practical Perspective succeeds the first as the authoritative source for information on optical networking technologies and techniques as discussed by the authors, covering componentry and transmission in detail but also emphasizing the practical networking issues that affect organizations as they evaluate, deploy, or develop optical solutions.
Abstract: This fully updated and expanded second edition of Optical Networks: A Practical Perspective succeeds the first as the authoritative source for information on optical networking technologies and techniques. Written by two of the field's most respected individuals, it covers componentry and transmission in detail but also emphasizes the practical networking issues that affect organizations as they evaluate, deploy, or develop optical solutions.
2,282 citations
TL;DR: It is shown that although the problem of optimally establishing lightpaths is NP-complete, simple heuristics provide near optimal substitutes for several of the basic problems motivated by a lightpath-based architecture.
Abstract: An architectural approach that meets high bandwidth requirements by introducing a communication architecture based on lightpaths, optical transmission paths in the network, is introduced. Since lightpaths form the building block of the proposed architecture, its performance hinges on their efficient establishment and management. It is shown that although the problem of optimally establishing lightpaths is NP-complete, simple heuristics provide near optimal substitutes for several of the basic problems motivated by a lightpath-based architecture. >
1,308 citations
TL;DR: The authors derive an upper bound on the carried traffic of connections for any routing and wavelength assignment (RWA) algorithm in a reconfigurable optical network and quantifies the amount of wavelength reuse achievable in large networks as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as de Bruijn networks.
Abstract: Considers routing connections in a reconfigurable optical network using WDM. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned different wavelengths. The authors derive an upper bound on the carried traffic of connections (or equivalently, a lower bound on the blocking probability) for any routing and wavelength assignment (RWA) algorithm in such a network. The bound scales with the number of wavelengths and is achieved asymptotically (when a large number of wavelengths is available) by a fixed RWA algorithm. The bound can be used as a metric against which the performance of different RWA algorithms can be compared for networks of moderate size. The authors illustrate this by comparing the performance of a simple shortest-path RWA (SP-RWA) algorithm via simulation relative to the bound. They also derive a similar bound for optical networks using dynamic wavelength converters, which are equivalent to circuit-switched telephone networks, and compare the two cases. Finally, they quantify the amount of wavelength reuse achievable in large networks using the SP-RWA via simulation as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as de Bruijn networks. They also quantify the difference in wavelength reuse between two different optical node architectures. >
1,046 citations
21 Mar 1999
TL;DR: This study examines different approaches to protect mesh based WDM optical networks from single-link failures, and formulated integer linear programs to determine the capacity requirements for the above protection schemes for a static traffic demand.
Abstract: This investigation considers optical networks which employ wavelength cross-connects that enable the establishment of wavelength-division-multiplexed (WDM) channels, between node-pairs. In such and other networks, the failure of a network element (e.g., fiber link, cross-connect, etc.) may cause the failure of several optical channels, thereby leading to large data losses. This study examines different approaches to protect mesh based WDM optical networks from single-link failures. These approaches are based on two basic survivability paradigms: (a) path protection/restoration, and (b) link protection/restoration. In path- and link-protection schemes, backup paths and wavelengths are reserved in advance at the time of call setup. Path- and link-restoration schemes are dynamic schemes in which backup paths are discovered (from the spare capacity in the network) upon the occurrence of a failure. In part 1 of this study presented in this paper, we formulated integer linear programs to determine the capacity requirements for the above protection schemes for a static traffic demand.
727 citations
TL;DR: A multicommodity flow formulation combined with randomized rounding is employed to calculate the routes for lightpaths in large optical networks in which nodes employ wavelength-routing switches which enable the establishment of wavelength-division-multiplexed channels between node pairs.
Abstract: 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.
553 citations