Restoration strategies and spare capacity requirements in self-healing ATM networks

Xiong, Yijun; Mason, L.

doi:10.1109/infcom.1997.635157

Cited by 83 publications

(129 citation statements)

References 20 publications

Supporting

Mentioning

128

Contrasting

Order By: Relevance

“…LR [3], [6]- [9] reroutes all of the disrupted traffic (going through the failed link) over a single alternate path (or a set of alternate paths) between two end nodes of a failed link, using the spare capacity of the network. In Fig.1, the disrupted traffic (due to the failure of link 5↔7) is rerouted between the end nodes 5 and 7.…”

Section: A Link Restorationmentioning

confidence: 99%

“…PR [3], [6], [8]- [10] reroutes each disrupted path over a single alternate path (or a set of alternate paths) between the source and the destination of the primary path, using the spare capacity of the network. In Fig.1, the (disrupted) primary path 1-3-5-7-9 has a restoration path 1-3-8-9.…”

Section: B Path Restorationmentioning

confidence: 99%

“…The (offline) spare capacity assignment problem has been formulated as an integer linear program using multicommodity flow model in [3], [6], [8]- [10], [14]- [18]. These models use pre-defined eligible path sets for all the demand pairs to formulate the search space.…”

Section: Related Workmentioning

confidence: 99%

“…The hop limit approach to restrict the path length has been proposed in [14]. The K successively shortest paths approach to restrict the size of the eligible path set is used in [3], [6], [9], [10]. Lagrangian relaxations with sub gradient optimization are used in [1], [19] to simplify the original hard problem.…”

Section: Related Workmentioning

confidence: 99%

“…The selection of an appropriate restoration scheme depends on many factors in addition to the spare capacity assignment cost. Some of the important performance criteria are: computational efficiency, restoration speed, complexity, and scalability [1]- [3]. The computational efficiency refers to the processing power and the memory required for the computation.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A comparative study of restoration schemes and spare capacity assignments in mesh networks

Patel

Chandrasekaran

Venkatesan

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)

View full text Add to dashboard Cite

Abstract-This paper presents the results of a comparative study of spare capacity assignment for original quasi-path restoration (OQPR), improved quasi-path restoration (IQPR), link restoration (LR), path restoration (PR) and link-disjoint path restoration (LDPR) schemes. Numerical results indicate that the restoration schemes studied can be sorted from most expensive to least expensive (spare capacity assignment cost) in the following order: LR, OQPR, IQPR, LDPR and PR. Since IQPR is computationally very efficient, simpler than PR, scalable, and economical in spare capacity assignment, it provides a good alternative to PR when quick restoration is desired. However, due to the potential difficulty in rapid failure isolation coupled with the increasing importance of restoration speed and simplicity, LDPR is an attractive scheme. A number of networks with different topologies and projected traffic demand patterns are used in the experiments to study the effect of various network parameters on spare capacity assignment cost. The experimental analysis shows that network topology, demand patterns and the average number of hops per primary route have a significant impact on the spare capacity assignment cost savings offered by one scheme over the other.

show abstract

Section: A Link Restorationmentioning

confidence: 99%

Section: B Path Restorationmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A comparative study of restoration schemes and spare capacity assignments in mesh networks

Patel

Chandrasekaran

Venkatesan

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)

View full text Add to dashboard Cite

show abstract

Capacity and flow assignment issues in MPLS networks

Liu

2003

Int J Network Mgmt

View full text Add to dashboard Cite

A directed cycle‐based column‐and‐cut generation method for capacitated survivable network design

Rajan

Atamtürk

2004

Networks

View full text Add to dashboard Cite

A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here, we present a polyhedral approach for designing survivable networks. We describe a mixed-integer programming model, in which sufficient slack is explicitly introduced on the directed cycles of the network while flow routing decisions are made. In case of a failure, flow is rerouted along the slacks reserved on directed cycles. We give strong valid inequalities that use the survivability requirements. We present a computational study with a column-and-cut generation algorithm for designing capacitated survivable networks.

show abstract

Restoration strategies and spare capacity requirements in self-healing ATM networks

Cited by 83 publications

References 20 publications

A comparative study of restoration schemes and spare capacity assignments in mesh networks

A comparative study of restoration schemes and spare capacity assignments in mesh networks

Capacity and flow assignment issues in MPLS networks

A directed cycle‐based column‐and‐cut generation method for capacitated survivable network design

Contact Info

Product

Resources

About