Comparative study on restoration schemes of survivable ATM networks

The state-independent (SI) and state-dependent (SD) path restoration schemes for self-healing networks are studied in this paper. The integer programming (IP) formulations for the spare capacity allocation and restoration flow assignment are first presented. Based on the optimal IP solutions, the SI and SD restoration schemes are then compared quantitatively in terms of spare capacity requirement (SCR), restoration time, VPI (virtual path identifier) redundancy (in ATM) and nodal storage capacity requirement. The comparison is based on spare optimization, single link failure scenario and 100% restoration. The SCR is also compared under single node failure scenario. It is observed that using group VP (virtual path) restoration (for either SI or SD) can substantially reduce the restoration time with only a small increase in spare capacity cost. Further, the SI restoration seems better than the SD restoration for the cases we have studied, at least in spare optimization, as its implementation is relatively easier and the difference in SCR between SI and SD is not significant. The economies of scale in transmission facility cost is also investigated in the paper. Ó

show abstract

“…The SD restoration was studied as a LP in Refs. [5,11]. The spare cost comparison of the SI and SD restoration was also given in Ref.…”

Section: Introductionmentioning

confidence: 99%

Comparison of two path restoration schemes in self-healing networks

Xiong

Mason

2002

Computer Networks

View full text Add to dashboard Cite

show abstract

“…This leads us to believe that the reason for large divergence from lower bounds is due to the lower bounds and not due to the heuristic solutions. In Figure. 7(a) (low density graphs), it can be observed that both heuristics give the optimal solution for all cases (n = 5, 6,7,8). It was also observed that the heuristic solutions, especially those of heuristic 2, are close to the corresponding optimal solutions even for high density graphs as illustrated in Figure.…”

Section: B Heuristic Solutions Vs Ilp Solutionmentioning

confidence: 67%

“…In Link Restoration [2], [5], [10], [12], traffic on the failed link is rerouted over a replacement path connecting the end-points of the failed link. In Path Restoration [4], [6], [8], each path disrupted by the link failure is considered separately and rerouted over an alternate path between the source and destination of that path. Link Restoration is easy to implement since only the two end nodes of the failed link are affected and the rerouting is localized but expensive in spare capacity [9].…”

Section: Introductionmentioning

confidence: 99%

Highly efficient spare capacity planning for generalized link restoration

Krishnamurthy¹,

Chandrasekaran²,

Venkatesan³

et al.

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

View full text Add to dashboard Cite

Abstract-We consider the problem of spare capacity allocation in mesh networks for link restoration. Only single link failures are considered and restored traffic is not split across multiple paths. In our model, links that are not part of the original transport network can also be used for restoration. This model, which is a generalized version, is different from the traditional model studied in literature. We present two heuristics to solve this problem and compare their performance with known lower bounds and the optimal solution. In numerous simulation experiments on randomly generated graphs containing up to 100 nodes, the heuristics often produced solutions within 3% of the lower bound for sparse graphs. The Integer Linear Programming solutions suggest that the heuristic solutions are closer to optimal than indicated by the deviation from the lower bounds. The results are optimal or near optimal (within 0.5% of the optimum values) for small graphs containing up to 8 nodes and 18 edges.

show abstract

“…A comparison of LR and PR based on the spare capacity cost can be found in [3], [9], [10]. The impact of network topology on the spare capacity requirement for LR and PR has been studied quantitatively in [22].…”

Section: Related Workmentioning

confidence: 99%

“…Networks 1, 2 and 3 are artificial networks and networks 4, 5 and 6 are real networks. Networks 3, 4, 5 and 6 have been studied in the literature [3], [22]. The characteristic of each network is detailed in Table I.…”

Section: System Modelmentioning

confidence: 99%

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

Comparative study on restoration schemes of survivable ATM networks

Cited by 59 publications

References 10 publications

Comparison of two path restoration schemes in self-healing networks

Comparison of two path restoration schemes in self-healing networks

Highly efficient spare capacity planning for generalized link restoration

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

Contact Info

Product

Resources

About