Static and dynamic routing and wavelength assignment algorithms for future transport networks

Randhawa, Rajneesh; Sohal, J. S.

doi:10.1016/j.ijleo.2008.11.004

Cited by 22 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the request arrived it is routed to the nodes having less weight if wavelength is available if not then request is routed through next higher weight nodes and the process is repeated. In DRW3 algorithm less weight is assigned to the nodes which are less used and are nearest and then routing of request is done through routes having minimum weight if wavelength is available else next higher weight is tried and the process is repeated [9] Another algorithm is proposed in literature which first selects K edge disjoint least weighted paths according to the current network state and then one such path is considered to route the request taking into account not only the load ,length of the path but also number of transceivers in the nodes along the path.after this an auxiliary graph is generated and request is routed on least weight route on the graph and wavelength is assigned for the same.…”

Section: Icaet 2016 -mentioning

confidence: 99%

Dynamic RWA in WDM optical network

Kaur

Rattan²

2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Abstract. As optical wdm networks are becoming the backbone building blocks of twenty first century's networks due to their capacity of carrying huge bandwidth. So evaluating the performance of optical wdm networks and optimizing it, is need of the day. For this the problem of routing and wavelength assignment is of significance importance. Researchers have done extensive simulations for both static and dynamic routing and wavelength problem. In this paper we have presented various algorithms for solving the dynamic RWA problem in literature.Also we have prepared a optical wdm network using which RWA problem is analysed.

show abstract

Section: Icaet 2016 -mentioning

confidence: 99%

Dynamic RWA in WDM optical network

Kaur

Rattan²

2016

MATEC Web of Conferences

View full text Add to dashboard Cite

show abstract

“…Unlike the constraint in (11), the constraint in (12) involves lightpaths from multiple s-d pairs and cannot be replaced easily by the constraint based on the argument of the Erlang B formula, as is done in [8]. In addition, the systematic framework of convex optimization cannot be applied since the required number of wavelength channels as a function of the traffic load for a given link blocking probability is not convex.…”

Section: Ilp Problem Reformulation To Incorporate the Multiplexing Gainmentioning

confidence: 99%

“…Several heuristics have been proposed in the literature, including first-fit, random-fit, most-used, and least-used algorithms [5,[9][10][11][12]. These proposed heuristics consider the wavelength continuity constraint and can be combined with any routing scheme previously discussed.…”

Section: Introductionmentioning

confidence: 99%

Design based routing and wavelength assignment in WDM networks using link-based multiplexing gain

Khan¹,

Saengudomlert²

2015

Optical Switching and Networking

View full text Add to dashboard Cite

“…2) MaxWWF Algorithm: We investigate the maximum waveband-wavelength first (MaxWWF) assignment heuristic, which is based on the most-used wavelength assignment reported in [14], [23]. In [14], it has been shown through simulation results that the most-used wavelength assignment slightly outperforms the first-fit wavelength assignment.…”

Section: Online Heuristics For Waveband and Wavelength Assignmentmentioning

confidence: 99%

“…3) MinWWF Algorithm: We also investigate the minimum waveband-wavelength first (MinWWF) assignment heuristic, which is based on the least-used wavelength assignment reported in [14], [23]. In the MinWWF assignment heuristic, the least-used waveband along the path is assigned to a ligthpath request.…”

Section: Online Heuristics For Waveband and Wavelength Assignmentmentioning

confidence: 99%

Design Based Routing with Waveband and Wavelength Assignment in Wavelength Division Multiplexing Networks using Multi-Granular Optical Cross-Connects

Khan¹,

Saengudomlert

2012

JCM

View full text Add to dashboard Cite

In this paper, we extend design based routing (DBR), which is originally proposed for opaque wavelength division multiplexing (WDM) networks without waveband switching (WBS), to transparent WDM networks with WBS. We formulate and solve the corresponding integer linear programming (ILP) problems to facilitate the use of DBR for transparent WDM networks with WBS, referred to as DBR with Waveband and Wavelength Assignment (DBRWWA). The goal of DBRWWA is to minimize the total link cost subject to the constraints on traffic demands and on network resources. DBRWWA guides online routing of dynamic lightpath requests in WDM networks with WBS, where traffic engineered routes are computed offline based on the prior information on traffic demand statistics. We investigate two novel heuristics, called the maximum waveband-wavelength first (MaxWWF) algorithm and the minimum waveband-wavelength first (MinWWF) algorithm, as well as existing first-fit and random-fit algorithms. The proposed heuristics consider all properties of WBS, including waveband and wavelength continuity constraints. We consider end-to-end WBS (ETE-WBS) for lightpath grouping. The online heuristics are combined with shortest path first (SPF) routing, DBR, and DBRWWA to support dynamic traffic. Simulation results show that DBRWWA has on average lower blocking probability compared to DBR, while both DBRWWA and DBR greatly outperform SPF routing in terms of the blocking probability.

show abstract

Static and dynamic routing and wavelength assignment algorithms for future transport networks

Cited by 22 publications

References 7 publications

Dynamic RWA in WDM optical network

Dynamic RWA in WDM optical network

Design based routing and wavelength assignment in WDM networks using link-based multiplexing gain

Design Based Routing with Waveband and Wavelength Assignment in Wavelength Division Multiplexing Networks using Multi-Granular Optical Cross-Connects

Contact Info

Product

Resources

About