Restoration performance study of k-shortest disjoint paths in WDM optical networks

Tak, Sungwoo; Park, E. K.

doi:10.1007/s11235-006-9026-9

Cited by 5 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most important methods include: Shortest Pair of Link Disjoint Paths (SPLP) [14], k-Disjoint Paths method (KDPM) [4,25], and k-Penalty algorithm [22] as follows.…”

Section: Heuristic Approachesmentioning

confidence: 99%

Methods for physical impairment constrained routing with selected protection in all-optical networks

2013

View full text Add to dashboard Cite

In this paper, we investigate the problem of survivable all-optical routing in WDM networks with physical impairments. One of the recent key issues in survivable optical network design refers to maximization of the ratio of routeable demands while keeping the overall network cost low. In WDM networks, this goal can be achieved by routing as many demands in all-optical way as possible. Based on the latest technical trends driven by deployment costs, technical constraints, and backward compatibility, this will not mean that all demands will be routed in all-optical way in the near future.Nowadays, operators are mostly willing to dedicate only a given ratio of their power budget to all-optical routing. This in turn implies a new problem to be solved: operators have to find a way to select demands that should be routed in all-optical way and which should not. The problem gets even more complicated, if we add demand protection issues.In this paper, we introduce and evaluate methods able to maximize the number of demands routed with protection in all-optical way in capacity-constrained networks with limitations on path lengths according to physical impairments.

show abstract

“…The most important methods include: Shortest Pair of Link Disjoint Paths (SPLP) [14], k-Disjoint Paths method (KDPM) [4,25], and k-Penalty algorithm [22] as follows.…”

Section: Heuristic Approachesmentioning

confidence: 99%

Methods for physical impairment constrained routing with selected protection in all-optical networks

2013

View full text Add to dashboard Cite

show abstract

“…They make use of a hybrid algorithm based on the combination of mobile agents technique and genetic algorithms. Finally, Tak et al (2007) have proposed restoration techniques incorporating the concept of k-shortest disjoint paths in survivable WDM optical networks, considering network performance and network costs simultaneously, making use of several soft computing algorithms to do so.…”

Section: Introductionmentioning

confidence: 99%

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Cortés

Muñuzuri

Onieva

et al. 2011

Applied Soft Computing

View full text Add to dashboard Cite

This paper deals with the dynamic routing problem in ATM cell-switching networks. We present a mathematical programming model based on cell loss and a Tabu Search algorithm with short-term memory that is reinforced with a long-term memory procedure. The estimation of the quality of the solutions is fast, due to the specific encoding of the feasible solutions. The Tabu Search algorithm reaches good quality solutions, outperforming other approaches such as Genetic Algorithms and the Minimum Switching Path heuristic, regarding both cell loss and the CPU time consumption. The best results were found for the more complex networks with a high number of switches and links.

show abstract

“…For the unprotected and dedicated protection solutions, we follow an R+WA scheme: we first calculate the route and then assign an available wavelength for that route using first fit wavelength assignment. Due to the size of our dataset, requiring thousands of dimensionings, advanced algorithms (for instance based on k-shortest paths [7]) are unfeasible. Therefore, the paths are calculated using Dijkstra's algorithm in the unprotected case, the algorithm by Suurballe and Tarjan [8] is used for link-disjoint and node-disjoint cases.…”

mentioning

confidence: 99%

Analysis of resource sharing in transparent networks

et al. 2015

View full text Add to dashboard Cite

Transparent optical networking promises a cost-efficient solution for future core and metro networks because of the efficacy of switching high-granularity trunk traffic without opto-electronic conversion. Network availability is an important performance parameter for network operators, who are incorporating protection and restoration mechanisms in the network to achieve competitive advantages. This paper focuses on the reduction in Capital Expenditures (CapEx) expected from implementing sharing of backup resources in pathprotected transparent networks. We dimension a nationwide network topology for different protection mechanisms using transparent and opaque architectures. We investigate the CapEx reductions obtained through protection sharing on a population of 1000 randomly generated biconnected planar topologies with 14 nodes. We show that the gain for transparent networks is heavily dependent on the offered load, with almost no relative gain for low load (no required parallel line systems). We also show that for opaque networks the CapEx reduction through protection sharing is independent of the traffic load and shows only a small dependency on the number of links in the network. The node CapEx reduction for high load (relative to the number of channels in a line system) is comparable to the CapEx reduction in opaque OTN systems. This is rather surprising as in OTN systems the number of transceivers and linecards and the size of the OTN switching matrix all decrease, while in transparent networks only the degree of the ROADM (number and size of WSSs in the node) deGhent University -iMinds Department of Information Technology Gaston Crommenlaan 8 bus 201, 9050 Ghent Belgium E-mail: firstname.lastname@intec.ugent.be creases while the number of transponders remains the same.

show abstract

Restoration performance study of k-shortest disjoint paths in WDM optical networks

Cited by 5 publications

References 15 publications

Methods for physical impairment constrained routing with selected protection in all-optical networks

Methods for physical impairment constrained routing with selected protection in all-optical networks

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Analysis of resource sharing in transparent networks

Contact Info

Product

Resources

About