Routing and Wavelength Assignment of Scheduled Lightpath Demands in a WDM Optical Transport Network

Kuri, J.; Puech, Nicolas; Gagnaire, Maurice; Dotaro, Emmanuel

doi:10.1142/9789812776280_0067

Cited by 13 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To circumvent above problems, Kuri et al proposed a novel SLD based traffic model known as STM in SDON. The STM has features borrowed from the static as well as the dynamic traffic models.…”

Section: Related Workmentioning

confidence: 99%

“…[5][6][7][8] This traffic may be of specified starting time and specified duration or unspecified starting time and specified duration. 9 The demands having a known setup and teardown time can be referred as scheduled lightpath demands (SLDs) [10][11][12] while the starting and ending time of the window within, which a demand is to be scheduled is known, can be referred to as sliding SLD. [13][14][15][16] Such demand models are known as scheduled traffic model (STM) 11 and sliding STM, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient resource provisioning using traffic balancing in multidomain optical networks

Batham

Yadav

Prakash

2016

Int J Communication

View full text Add to dashboard Cite

Summary In multidomain optical networks (MDONs) the emerging multimedia, multivendor applications–based scheduled traffic (ST) is periodic and repeated day by day. The traffic is heavy during the working hours and slack during the non‐office hours. This results in the scarcity of network resources during the working hours, leading to the increased blocking of requests, even though there remains relatively large underused capacity during the non‐office hours. To use the network resources uniformly and efficiently, the demands may be slided within or shifted along the time zones/windows. In this paper, we first propose a heuristic algorithm, time‐aware routing and wavelength assignment (TA‐RWA), which allocates resources without traffic balancing (TB) for the ST in MDON. Time‐aware routing and wavelength assignment policy is then used as a benchmark for comparison with the 3 different TB solutions (named as P1‐TB, P2‐TB, and P3‐TB), in which the network load is redistributed by rescheduling the intradomain and interdomain demands. We performed extensive simulation experiments in MATLAB environment and compared the proposed policies with the existing ordering policies. From the results, it can be inferred that the proposed TB policies outperform the TA‐RWA, and the existing strategies of the blocking probability, resource utilization ratio (RUR), and percentage of intradomain and interdomain connections established. The best performance is achieved using P3‐TB strategy, in which requests are slided within, and shifted, along different time windows. The strategy shows about 70% reduction in the percentage blocking probability with respect to the TA‐RWA and the existing strategies.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient resource provisioning using traffic balancing in multidomain optical networks

Batham

Yadav

Prakash

2016

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In [1], the routing and wavelength assignment problem is solved with greedy algorithms, which are specifically applicable to networks of trees. In [7], the lightpath assignment in an optical network is considered in the route, wavelength, and time domains. The property that all lightpaths cannot be needed at the same time is taken into consideration to assign wavelengths using a branch-and-bound and tabu search method, which achieves better performance than the fixed-alternate routing followed by first-fit wavelength assignment strategy.…”

Section: Related Workmentioning

confidence: 99%

A Hybrid Algorithm for Lightpath Assignment

Kaushik¹,

Figueira²,

Chiappari³

2009

JNW

View full text Add to dashboard Cite

This paper focuses on the assignment of multiple-wavelength lightpaths and presents a computationally simple algorithm to increase the number of simultaneous lightpath assignments in optical networks. Several approaches for lightpath assignment have been proposed in the literature, and most of them involve some variation of selecting or rejecting edge-disjoint paths for lightpath allocation, followed by assigning wavelengths in order. We have developed the Hybrid algorithm which either selects or rejects an edgedisjoint path, depending on the length of that path. We show using simulations that the algorithm performs significantly better (up to ~1,300%) than the consistent selection or rejection of edge-disjoint paths, and it performs comparably with (and in some cases even better than) an algorithm that makes lightpath selections dynamically based on the current network state.

show abstract

Grooming of Scheduled Demands in Multi-Layer Optical Networks

Gagnaire¹,

Kuri²,

Doumith³

Optical Networks

View full text Add to dashboard Cite

Routing and Wavelength Assignment of Scheduled Lightpath Demands in a WDM Optical Transport Network

Cited by 13 publications

References 3 publications

Efficient resource provisioning using traffic balancing in multidomain optical networks

Efficient resource provisioning using traffic balancing in multidomain optical networks

A Hybrid Algorithm for Lightpath Assignment

Grooming of Scheduled Demands in Multi-Layer Optical Networks

Contact Info

Product

Resources

About