Hitless network engineering of SONET rings

Acharya, Swarup; Gupta, Bhawna; Risbood, P.; Srivastava, Anurag

doi:10.1109/glocom.2003.1258733

Cited by 9 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A master ring can then serve as a simple backup topology. Providing a master ring (whenever possible) to a network management system simplifies its operation and is therefore valuable [1,2,9]. We are not aware of any earlier analysis on MRP.…”

Section: Problem Statement and Motivationmentioning

confidence: 99%

Exact algorithms for the master ring problem

Shachnai

Zhang²,

Matsui

2008

Networks

View full text Add to dashboard Cite

We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings R 1 , . . . , R K , with n 1 , . . . , n K distinct nodes, respectively, we need to find an ordering of the nodes in the network that respects the ordering of every individual ring, if one exists. We show that MRP is NP-complete, and therefore, it is unlikely to be solvable by a polynomial time algorithm. Our main result is an algorithm which solves MRP in Q · K k =1 (n k / √ 2) steps, for some polynomial Q, as the n k values become large. For the ring clearance problem, a special case of practical interest, our algorithm achieves this running time for rings of any size n k ≥ 2. This yields the first nontrivial improvement, by factor of (2 √ 2) K ≈ (2.82) K , over the running time of the naive algorithm, which exhaustively enumerates all K k =1 (2n k ) possible solutions.

show abstract

Section: Problem Statement and Motivationmentioning

confidence: 99%

Exact algorithms for the master ring problem

Shachnai

Zhang²,

Matsui

2008

Networks

View full text Add to dashboard Cite

show abstract

“…The master ring problem is to find such a ring, whenever it exists. Master rings are used in network design to replace a complicated topology resulting from ad-hoc expansions of the network; a master ring serves also as a simple backup topology for routine maintenance (see, e.g., in [1,2,11]). Fig.…”

Section: Introductionmentioning

confidence: 99%

A note on generalized rank aggregation

Shachnai

Zhang²,

Matsui

2009

Information Processing Letters

View full text Add to dashboard Cite

“…For example, the closest SONET hierarchy to Gigabit Ethernet (1Gb) is STS-48 (2.5Gb), a 60% wastage of bandwidth. Moreover, the contiguous requirement also causes bandwidth fragmentation [5], [6] further lowering network utilizationeven though n slots may be available on a link, it may not be adjacent causing demands to be rejected.…”

Section: Routing Impact Of Vc and Lcasmentioning

confidence: 99%

“…As we briefly introduced earlier, transporting various data services via contiguous concatenation creates inefficient mapping of their frame rates to the closest SONET equivalent. Moreover, it leads to bandwidth fragmentation requiring expensive defragmentation operation to recover capacity [5], [6].…”

Section: Virtual Concatenation Protocolmentioning

confidence: 99%

PESO: Low overhead protection for ethernet over SONET transport

et al.

Self Cite

View full text Add to dashboard Cite

Abstract-This paper addresses the issue of reliable transport of emerging data services in Ethernet over SONET (EoS) networks that require protection guarantees beyond standard best effort delivery. We argue that the current consensus of using Ethernet spanning tree and a SONET 1+1 protection, while providing reliability, is an inefficient use of resources. Instead, we claim that EoS opens novel opportunities for protection heretofore unavailable in other environments. In particular, the deployment of Virtual Concatenation and LCAS protocols enables "route splitting", creating a fundamentally new routing paradigm for circuit-switched environments. We propose a scheme called PESO, appropriate for EoS, with innovative routing, failure notification and switching components. More importantly, it is competitive with SONET protection without its 100% bandwidth overhead. We also suggest a enhancement in LCAS that can further improve PESO's switching time. PESO leverages the underlying protocols, making it extremely attractive to implement and use in practice.

show abstract

Hitless network engineering of SONET rings

Cited by 9 publications

References 5 publications

Exact algorithms for the master ring problem

Exact algorithms for the master ring problem

A note on generalized rank aggregation

PESO: Low overhead protection for ethernet over SONET transport

Contact Info

Product

Resources

About