Lightpath (wavelength) routing in large WDM networks

Chlamtac, I.; Faragó, András; Zhang, Tao

doi:10.1109/49.510914

Cited by 283 publications

(162 citation statements)

References 6 publications

Supporting

Mentioning

158

Contrasting

Unclassified

Order By: Relevance

“…The proposed algorithm is based on the idea of wavelength graph [12]. First we construct wavelength graph WG for the tree T i (X i , F i ).…”

Section: The Algorithm For Wavelength Assignmentmentioning

confidence: 99%

“…Our proposed algorithm generates the cost suboptimal multicast tree based on MPGSAA, and then assigns wavelengths to the tree. The wavelength assignment algorithm is based on the basic idea of the wavelength graph proposed by Chlamtac [12]. The objective of wavelength assignment is to minimize the delay of the multicast tree, which is an important QoS parameter and decides the user QoS satisfaction degree.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Cheng

Wang

Yang

et al. 2009

Applied Soft Computing

View full text Add to dashboard Cite

In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoS multicast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation-parallel-genetic-simulated-annealing algorithm, and then assigns wavelengths to the tree based on the wavelength graph. In the algorithm, routing and wavelength assignment are integrated into a single process. For routing, the objective is to find a cost suboptimal multicast tree. For wavelength assignment, the objective is to minimize the delay of the multicast tree, which is achieved by minimizing the number of wavelength conversion. Thus both the cost of multicast tree and the user QoS satisfaction degree can approach the optimal. Our algorithm also considers load balance. Simulation results show that the proposed algorithm is feasible and effective. We also discuss the practical realization mechanisms of the algorithm.

show abstract

“…The proposed algorithm is based on the idea of wavelength graph [12]. First we construct wavelength graph WG for the tree T i (X i , F i ).…”

Section: The Algorithm For Wavelength Assignmentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Cheng

Wang

Yang

et al. 2009

Applied Soft Computing

View full text Add to dashboard Cite

show abstract

“…For a network with N nodes and W wavelengths, computing shortest paths on each of the wavelength planes individually is a O(N 2 W ) operation. In comparison, the modified graph in the conventional approach for routing in wavelength-convertible networks has NW nodes and a complexity of O(N 2 W 2 ) [10].…”

Section: B Conversion Free Primary Routing (Cfpr) Techniquementioning

confidence: 99%

“…For a wavelength convertible network, typically the multiple layers representing individual wavelength planes are interconnected using edges between corresponding nodes of the different wavelength layers [10]. The CFPR algorithm models the network using a multi-layered graph although the network has wavelength conversion capability.…”

Section: B Conversion Free Primary Routing (Cfpr) Techniquementioning

confidence: 99%

“…In this paper, we use a dynamic route computation technique, based on perwavelength status information as explained later. Routes are computed individually on each wavelength plane, based on an augmented graph method presented in [10]. Wavelength router architectures: In a network without wavelength conversion, connections are often blocked since the same wavelength is not available on all links of the path.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Protection mechanisms for optical WDM networks based on wavelength converter multiplexing and backup path relocation techniques

Gowda¹,

Sivalingam²

IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37

View full text Add to dashboard Cite

Abstract-This paper studies the problem of designing survivable optical wavelength division multiplexed (WDM) networks. A wavelength-routed wide area backbone network supporting circuit-switched traffic is considered. This paper also considers the use of optical wavelength conversion technology which has been shown to help improve network performance. However, wavelength conversion is still an expensive technology and using optical conversion could potentially result in signal quality degradation.In survivable networks, protection against failures is provided using backup paths that are determined when a session is established. In this paper, we present three primary and backup route computation mechanisms that attempt to improve overall network performance compared to existing solutions. One of the key design goals is to reduce the number of required converters per node. First, we present a routing algorithm, termed conversion free primary routing (CFPR) that computes primary paths without wavelength conversion, as far as possible. Next, we present a converter multiplexing technique that is used to share wavelength converters among multiple backup paths. This significantly reduces the number of connections blocked due to wavelength converter unavailability and reduces the number of wavelength converters required at each node, thus reducing system cost. Finally, we propose a backup path relocation scheme that migrates existing backup paths, whenever needed, to accommodate more primary paths and also to obtain primary routes with fewer hops. This is done to improve network utilization and reduce blocking probability. The proposed techniques are analyzed in detail using a discrete-event simulation model. The results show that significant reduction in blocking probability is possible with the proposed mechanisms. The number of converters required at each node to achieve a given blocking probability is also seen to be four times lower, compared to existing architectures based on static shortest path routing.

show abstract

IP‐ and Wavelength‐Routing Networks

Gangopadhyay

Dixit

2003

IP Over WDM

View full text Add to dashboard Cite

Lightpath (wavelength) routing in large WDM networks

Cited by 283 publications

References 6 publications

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Protection mechanisms for optical WDM networks based on wavelength converter multiplexing and backup path relocation techniques

IP‐ and Wavelength‐Routing Networks

Contact Info

Product

Resources

About