Routing and wavelength assignment of scheduled lightpath demands

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

doi:10.1109/jsac.2003.816622

Cited by 190 publications

(142 citation statements)

References 9 publications

Supporting

Mentioning

140

Contrasting

Unclassified

Order By: Relevance

“…The periodic nature of traffic has been confirmed with real traffic traces, such as the Abilene backbone network [7], making the expected traffic load in the network fairly predictable [8]. The first model to incorporate this phenomenon in transparent optical networks planning was the Scheduled Lightpath Demands (SLD) model from [8].…”

Section: State-of-the-artmentioning

confidence: 99%

“…The first model to incorporate this phenomenon in transparent optical networks planning was the Scheduled Lightpath Demands (SLD) model from [8]. Here, the set-up and tear-down times of lightpaths are known a priori, as opposed to previous work which considered either static demands based on a single traffic matrix, or completely dynamic demands, arriving unexpectedly with random holding times.…”

Section: State-of-the-artmentioning

confidence: 99%

“…The SLD model enables more efficient utilization of resources by exploiting the temporal relationship between lightpaths. In [8], a branch and bound algorithm and tabu search heuristic were proposed for the Routing and Wavelength Assignment of a set of SLDs. An enhanced tabu search algorithm and efficient greedy algorithms for the same problem were proposed in [9].…”

Section: State-of-the-artmentioning

confidence: 99%

“…However, the original model of SLDs proposed in [8] was motivated by the periodic nature observed in real-life traffic traces. Thus, we consider the problem of creating the set of SLDs from the periodic traffic itself, i.e.…”

Section: State-of-the-artmentioning

confidence: 99%

See 3 more Smart Citations

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Skorin-Kapov¹,

Pavón‐Mariño²,

Garcia-Manrubia³

et al. 2009

Proceedings of the 6th International ICST Conference on Broadband Communications, Networks, and Systems

View full text Add to dashboard Cite

Abstract-This paper investigates offline planning and scheduling in transparent optical networks for a given periodic traffic demand. The main objective is to minimize the number of transceivers needed which make up for the main network cost. We call this problem "Scheduled Virtual Topology Design" and consider two variants: non-reconfigurable and reconfigurable equipment. We formulate both problems as exact MILPs (Mixed Integer Linear Programs). Due to their high complexity, we propose a more scalable tabu search heuristic approach, in conjunction with smaller MILP formulations for the associated subproblems. The main motivation of our research efforts is to assess the benefits of using reconfigurable equipment, realized as a reduction in the number of required transceivers. Our results show that the achieved reductions are not very significant, except for cases with large network loads and high traffic variability.Index Terrms-All-optical networks, virtual topology design, multilayer optimization, scheduling, tabu search.

show abstract

Section: State-of-the-artmentioning

confidence: 99%

Section: State-of-the-artmentioning

confidence: 99%

Section: State-of-the-artmentioning

confidence: 99%

Section: State-of-the-artmentioning

confidence: 99%

See 2 more Smart Citations

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Skorin-Kapov¹,

Pavón‐Mariño²,

Garcia-Manrubia³

et al. 2009

Proceedings of the 6th International ICST Conference on Broadband Communications, Networks, and Systems

View full text Add to dashboard Cite

show abstract

“…In [4],a tabu search(TS) algorithm is designed to solve the RWA problem of scheduled light path requests, which is analogous to the MWU problem described here. Both algorithms are effective when applied to a small network.…”

Section: Iintroductionmentioning

confidence: 99%

Modified T Search Algorithm for Wavelength Assignment and Routing

2018

IJRTER

View full text Add to dashboard Cite

Abstrat-To minimize the wavelength assignment usage optimally we can go for the Staticd Routing and wavelength assignment.The solution for this Minimizing Wavelength Usage problem is based on two method approach, considering routing and wavelentgth assignment individually which can reduce computational cost. The existing Tabu Search algorithm considers routing and wavelength assignment jointly. The performance of this existing tabu search algorithm reduces the computational complexity. To solve the problem of Minimizing wavelength usage ,Tabu Search algorithm is compared with the Integer Linear Programming method. We propose a novel where routing and wavelength are done concurrently which gives optimal results for minimizing of wavelength.Index Terms-Usage of minimum wavelength, modified tabu search, static routing and wavelength assignment, optical network. I.INTRO DUCTIO NThe optimal networks, lightpath is an all optical channel trail which ends at a pair of access nodes. We can go for light path uses the same wavelength when no converter of wavelength. Light path can finds the route for assigning wavelength to the route. The problem of assignment and routing is use minimum wavelength.The condition of this problem not to use two lightpaths for single wavelength in the same link. The objective is to use minimum wavelength .The optimization problem is there in usage of minimum wavelength. The ILP provides a global solution for minimum wavelength usage [2,3] Secondly, wavelength assignment is carried out by a graph coloring algorithm. In the ILP approach, this method significantly reduces the number of integer variables in the formulation, and can significantly improve the computation efficiency at the expense of optimality. However, we notice that when TS is applied, the complexity of the algorithm is mainly governed by the neighborhood selection of the search process instead of the whole search space, which is proportionate to the number of variables. In view of this ,we propose a tabu search algorithm, which considers route and wavelength assignment jointly. Our simulation study for a relatively large network of 50nodes shows that the results are almost as good as that yielded by the ILP solution. The proposed TS algorithm can solve the MWU problem with in half an hour while the ILP solution takes more than a day to find the solution.II.EXISTING TA B U SEARCHALGORITH M

show abstract

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

Routing and wavelength assignment of scheduled lightpath demands

Cited by 190 publications

References 9 publications

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Modified T Search Algorithm for Wavelength Assignment and Routing

Efficient resource provisioning using traffic balancing in multidomain optical networks

Contact Info

Product

Resources

About