A Dynamic Partitioning Protection Routing Technique in WDM Networks

Todimala, A.; Ramamurthy, Byrav

doi:10.1023/b:clus.0000028004.03413.6b

Cited by 9 publications

(11 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In another work [7], the authors present a dynamic partitioning sub-path protection routing technique for routing a Fault Tolerant Path Set (FTPS) in a network. Their algorithm partitions the primary path into sub-paths and then dynamically computes their backup paths.…”

Section: Related Workmentioning

confidence: 99%

“…Segment protection is also called sub-path protection in the literature. Various forms of segment protection have been proposed and studied [3], [4], [5], [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

“…A classification of the various protection schemes has been proposed in [7]. According to that classification, the protection problem that we consider here would fit into the uniform, fixed partitioning scheme with sub-path replacement.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks

Tewari

Ramamurthy

2009

2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)

Self Cite

View full text Add to dashboard Cite

Abstract-Protecting a network against link failures is a major challenge faced by network operators. The protection scheme has to address two important objectives -fast recovery and minimizing the amount of backup resources needed. Every protection algorithm is a tradeoff between these two objectives.In this paper, we study the problem of segment protection. In particular, we investigate what is the optimal segment size that obtains the best tradeoff between the time taken for recovery and minimizing the bandwidth used by the backup segments. We focus on the uniform fixed-length segment protection method, where each primary path is divided into fixed-length segments, with the exception of the last segment in the path. We observe that the optimal segment size for a given network depends on several factors such as the topology and the ratio of the costs involved.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Segment protection is also called sub-path protection in the literature. Various forms of segment protection have been proposed and studied [3], [4], [5], [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks

Tewari

Ramamurthy

2009

2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The corresponding optimization problems have been proved to be NP-complete. Some recent work [11,[16][17][18][19] considered dynamic routing of and wavelength assignment to lightpaths with or without protection requirements. The work in [18] studied dynamic sub-path based protection routing.…”

Section: Related Workmentioning

confidence: 99%

“…A resource efficient and fast online algorithm is therefore necessary. Several heuristic algorithms [11,[16][17][18][19] have been proposed to reduce the computational complexity of the RWA optimization problem with protection consideration under the dynamic traffic model with varying successes.…”

Section: Introductionmentioning

confidence: 99%

Efficient Online Algorithms for Dynamic Shared Path Protection in WDM Optical Networks

Wang

2005

Photon Netw Commun

View full text Add to dashboard Cite

In this work, we have proposed and studied efficient online algorithms for shared path protection under dynamic traffic conditions in survivable WDM optical mesh networks. Given a connection request, routing and wavelength assignment of a working path and a protection path for the request is formulated as two integer linear programs based on shared and dedicated path protection, respectively. The objective is to minimize the total cost of additional resources used by the working path as well as the protection path to accommodate a new connection request. We then devise two resource efficient online algorithms using pre-computed candidate routes. The first algorithm uses one candidate working path and one candidate protection path for each newly arrived connection request while the second algorithm may use multiple candidate working paths and/or multiple candidate protection paths. The selection of a pair of paths from candidate routes as well as the assignment of appropriate wavelengths to accommodate a connection request is then jointly considered to minimize the total cost of additional resources. The solutions to the ILP formulations serve as the baseline for evaluating the performance of the proposed algorithms.We have evaluated the effectiveness of the proposed online algorithms via extensive simulations in terms of the connection blocking probability and the revenue earnings improved over the dedicated path protection approach. Our simulations indicate that our proposed computationally efficient online algorithms are able to provide 100% restorability against single failures with a resource efficiency comparable to that of the optimal shared path protection. The results also show that a small increase in the number of candidate working paths or protection paths (from 1 to 3) provides better performance, but a further increase does not improve the performance significantly. Therefore, a proper balance can be struck to achieve both satisfactory performance and efficient computation.

show abstract

Protection, Restoration, and Improvement

Basak¹,

Sarkar²

2022

Optical Switching

View full text Add to dashboard Cite

A Dynamic Partitioning Protection Routing Technique in WDM Networks

Cited by 9 publications

References 13 publications

Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks

Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks

Efficient Online Algorithms for Dynamic Shared Path Protection in WDM Optical Networks

Protection, Restoration, and Improvement

Contact Info

Product

Resources

About