Segment Shared Protection in Mesh Communications Networks With Bandwidth Guaranteed Tunnels

Ho, Pin–Han; Tapolcai, János; Cinkler, Tibor

doi:10.1109/tnet.2004.838592

Cited by 88 publications

(46 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When shared protection is considered the BPs are not established (together with APs) but are pre-calculated, thus allowing them to share protection bandwidth. This implies a longer restoration time, but results in significant reduction of network redundancy [14].…”

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

“…The problem of calculating an AP and a BP considering shared bandwidth is tackled in [14]. An Integer Linear Programming (ILP) approach is proposed there, but because the calculation of the AP and BP are entwined, solving exactly the least-cost AP and BP path-pair (in terms of the sum of the cost) is not scalable in the network size.…”

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

“…An Integer Linear Programming (ILP) approach is proposed there, but because the calculation of the AP and BP are entwined, solving exactly the least-cost AP and BP path-pair (in terms of the sum of the cost) is not scalable in the network size. Hence in [14] two heuristic algorithms, designated ITSA and Maximum Likelihood Relaxation (MLR), are proposed. The authors conclude that ITSA, although giving the best results, can be computationally expensive and that MLR is a good compromise between performance and computational efficiency.…”

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

See 2 more Smart Citations

Resilient arcs and node disjointness in diverse routing

Gomes

Żotkiewicz

2014

Optical Switching and Networking

View full text Add to dashboard Cite

In multi-layer networks protection can be provided at multiple layers. Hence some links at an upper layer may be resilient because they are protected at a lower layer. We will designate as resilient arc at a given layer, an arc which has some form of protection at an underlaying layer. When path diversity is used at an upper layer, and resilient arcs are taken into account, it may not be necessary for the considered paths to be fully disjoint.We solve a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Moreover, we assume that the resulting paths cannot contain loops, and costs of shared resilient arcs are counted only once towards the objective function.In the paper we present two novel algorithms solving the above problem, and two supporting algorithms that are utilized as subroutines. We implement the proposed algorithms and compare them to an MIP approach.

show abstract

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

Section: Literature Review Of Resilient Routing Issuesmentioning

confidence: 99%

See 1 more Smart Citation

Resilient arcs and node disjointness in diverse routing

Gomes

Żotkiewicz

2014

Optical Switching and Networking

View full text Add to dashboard Cite

show abstract

“…Protection schemes can be classified according to the type of resources protected (link-based versus pathbased) [17][18] and according to the type of resources used for protection (dedicated versus shared) [19][20]. In link-based protection, for each link of a primary lightpath a backup light-path is identified.…”

Section: Survivability In Wdm Optical Networkmentioning

confidence: 99%

A survey of survivability in multi-domain optical networks

Drid

Cousin

Molnar

et al. 2010

Computer Communications

View full text Add to dashboard Cite

Network survivability is becoming an important issue and a topical subject in WDM optical mesh networks. Many works have studied network survivability. However, few works have focused on survivability in multi-domain optical networks. This paper reviews the literature on survivability against failures in multi-domain optical networks. The main objective of this study is to evaluate and analyze existing solutions and to compare their performance in terms of different criteria: resource utilization, ratio of rejected connections and recovery time.

show abstract

“…To date, various protection mechanisms have been studied for DWDM networks, including link-based [3] and path-based [4]. Namely, link-based protection provides a backup for each link of a primary light-path.…”

Section: Introductionmentioning

confidence: 99%

Application-aware protection in DWDM optical networks

2011

View full text Add to dashboard Cite

Abstract-Fast recovery time and reduced resource utilization are the two main criteria for determining the quality of survivability mechanism. Now it is well-known that link-based protection and path-based protection provide respectively a short recovery time and reduced use of resources. To benefit from the both of these saliencies, we propose in this paper to use these mechanisms simultaneously. Indeed, demands mandating shorter recovery time will be protected using link-based protection. Meanwhile other demands will be protected using pathbased protection. Simulation results show that the proposed solution achieves a good trade-off between resource utilization and recovery time.

show abstract

Segment Shared Protection in Mesh Communications Networks With Bandwidth Guaranteed Tunnels

Cited by 88 publications

References 14 publications

Resilient arcs and node disjointness in diverse routing

Resilient arcs and node disjointness in diverse routing

A survey of survivability in multi-domain optical networks

Application-aware protection in DWDM optical networks

Contact Info

Product

Resources

About