Name
Abstract | ||
|---|---|---|
Survivable network design has become increasingly im- portant due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capac- ity reservation at certain survivability level. In this paper, we introduce two pre-planned path restoration algorithms for spare capacity design in mesh-like networks. First one is a spanning tree based algorithm, which needs less spare capacity than the well known hierarchical tree algorithm while keeping the same level of restorability. The second al- gorithm is a cycle based tree algorithm with backup parents and extra cycle edges, which forms cycles with the original spanning tree edges. Simulation results show that this algo- rithm works much better than the other two algorithms on restorability. Both algorithms have time complexity O (n3) and space complexity O (n2), where n is the total number of nodes in the network. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/PDCAT.2007.89 | Adelaide, SA |
Keywords | Field | DocType |
time complexity,space complexity,cost efficiency,spanning tree,computational complexity | Reservation,Survivability,Spare part,Network planning and design,Computer science,Computer network,Algorithm,Spanning tree,Time complexity,Backup,Distributed computing,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
0-7695-3049-4 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hovhannes A. Harutyunyan | 1 | 206 | 28.18 |
| Calin D. Morosan | 2 | 15 | 3.60 |
| Yunzan Zhang | 3 | 0 | 0.34 |