Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/spie/capacity-design-studies-of-span-restorable-mesh-transport-networks-SQato8DpHb
References (12)
-
J. Doucette, W. Grover (2001)
Comparison of Mesh Protection and Restoration Schemes and the Dependency of Graph Connectivity -
Matthieu Clouqueur, W. Grover (2002)
Availability analysis of span-restorable mesh networksIEEE J. Sel. Areas Commun., 20
-
S. Sengupta, R. Ramamurthy (2001)
Capacity efficient distributed routing of mesh-restored lightpaths in optical networksGLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 4
-
W. Grover, D. Li (1999)
The Forcer Concept and Applications to Express Route Planning in Mesh Survivable NetworksJournal of Network and Systems Management
-
M. Herzberg, S. Bye, Anthony Utano (1995)
The hop-limit approach for spare-capacity assignment in survivable networksIEEE/ACM Trans. Netw., 3
-
W. Grover, J. Doucette (2002)
Design of a meta-mesh of chain subnetworks: enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphsIEEE J. Sel. Areas Commun., 20
-
M. Médard, R. Barry, S. Finn, Wenbo He, S. Lumetta (2002)
Generalized loop-back recovery in optical mesh networksIEEE/ACM Trans. Netw., 10
-
P. Sebos, J. Yates, G. Hjálmtýsson, A. Greenberg (2001)
Auto-discovery of shared risk link groupsOFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171), 3
-
W. Grover (1997)
Self-organizing broad-band transport networksProc. IEEE, 85
-
C. Villamizar, Sriganesh Kini, M. Kodialam, T. Lakshman (2001)
Shared backup Label Switched Path restoration -
R. Iraschko, M. MacGregor, W. Grover (1998)
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networksIEEE/ACM Trans. Netw., 6
-
Matthieu Clouqueur, W. Grover (2000)
Computational and Design Studies on the Unavailability of Mesh-restorable Networks
- Publisher
- SPIE
- Copyright
- Copyright © 2003 COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
- ISSN
- 0277-786X
- eISSN
- 1996-756X
- DOI
- 10.1117/12.475308
- Publisher site
- See Article on Publisher Site
Abstract
We study the total capacity requirements of span-restorable mesh network designs as the percentage of all possible dual failure combinations incident on a common node is increased. Our interest is in questions such as: Are there any guidelines or insights as to how many such SRLGs can be sustained before the capacity penalty becomes severe? Can we diagnose which SRLGs are the most limiting to overall network efficiency? When would it be worthwhile to take physical measures to eliminate a certain SRLG? In addressing these questions we provide a design formulation and procedure for planning any span-restorable network for a known set of SRLGs. One finding of interest is that if all dual failure combinations incident to a common node are allowed for in the design, then nearly all other dual span failure combinations (any two spans in the network) will also be restorable. We also produce experimental results showing how total capacity depends on the relative number or frequency of co-incident SRLGs and quantify how the type of SRLG will impact design costs.
Journal
Proceedings of SPIE – SPIE
Published: Jul 5, 2002