Proceedings ArticleDOI
Restoration strategies and spare capacity requirements in self-healing ATM networks
Yijun Xiong,L.G. Mason +1 more
- Vol. 1, pp 353-360
TLDR
Numerical results illustrate that the heuristic algorithm is efficient and can give near-optimal solutions for spare capacity allocation and flow assignment in the design of self-healing ATM networks using path based restoration.Abstract:
This paper studies the capacity and flow assignment problem arising in the design of self-healing ATM networks using the virtual path (VP) concept The problem is formulated as a linear programming problem which is solved using standard methods The objective is to minimize the spare capacity cost for the given restoration requirement The spare cost depends on the restoration strategies used in the network We compare several restoration strategies, notably, global versus failure-oriented reconfiguration, path versus link based restoration and state-dependent versus state-independent restoration, quantitatively in terms of spare cost The advantages and disadvanages of various restoration strategies are also highlighted Such comparisons provide useful guidance for real network design Further, a new heuristic algorithm is developed for the design of large self-healing ATM networks using path based restoration Numerical results illustrate that the heuristic algorithm is efficient and can give near-optimal solutions for spare capacity allocation and flow assignmentread more
Citations
More filters
Journal ArticleDOI
Restoration strategies and spare capacity requirements in self-healing ATM networks
Yijun Xiong,L.G. Mason +1 more
TL;DR: A new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration, and results illustrate that the heuristicgorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment.
Proceedings ArticleDOI
Approximating optimal spare capacity allocation by successive survivable routing
TL;DR: Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.
Proceedings ArticleDOI
Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design
TL;DR: An algorithmic approach for providing p-cycle survivable transport network designs is developed and test, which entirely avoids the step of enumerating all cycles, which is a preliminary step in both ILP and heuristic solution methods based on preselection.
Proceedings ArticleDOI
Distributed partial information management (DPIM) schemes for survivable networks .1
Chunming Qiao,Dahai Xu +1 more
TL;DR: An elegant method to support dynamic requests for protected, unprotected, and pre-emptable connections in the unified DPIM framework is presented, and an ultrafast and efficient heuristic scheme is described.
Proceedings ArticleDOI
A "dual-tree" scheme for fault-tolerant multicast
TL;DR: A scheme based on a "dual-tree" structure in which a secondary tree for fault-tolerance purpose is built as a complement to a primary multicast tree, which has shorter restoration time and cause less multicasts tree cost increase after restoration than some schemes proposed previously.
References
More filters
Journal ArticleDOI
Restoration strategies and spare capacity requirements in self-healing ATM networks
Yijun Xiong,L.G. Mason +1 more
TL;DR: A new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration, and results illustrate that the heuristicgorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment.
Journal ArticleDOI
Broad-band ATM network architecture based on virtual paths
TL;DR: The virtual path concept, which exploits the ATM's capabilities, is proposed to construct an efficient and economic network to provide efficiently for networks with dynamic reconfiguration capability which will enhance network performance.
Journal ArticleDOI
Comparison of k-shortest paths and maximum flow routing for network facility restoration
TL;DR: A comparative study of the effectiveness of KSP versus Max Flow as an alternative rerouting criteria in the context of transport network span restoration, and the hypothesis is made that a generalized "trap" topology is responsible for all KSP-Max Flow capacity differences.
Proceedings ArticleDOI
A self-healing network with an economical spare-channel assignment
TL;DR: In order to achieve fast restoration, a distributed control mechanism that is applicable to both line and path restoration is proposed, and the shared use of spare channels for various failure scenarios, including multiple failure cases, are allowed.
Journal ArticleDOI
Fast restoration of ATM networks
TL;DR: It is suggested that fast network span failure detection and bandwidth-efficient rerouting capabilities can be combined to develop restoration strategies for ATM networks with significantly greater performance-cost ratios when compared to existing STM network restoration strategies.