Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Médard, S. Finn, R. Barry (1999)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphsIEEE/ACM Trans. Netw., 7
W. D. Grover, D. Stamatelakis (1998)
Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restorationProc. of IEEE ICC'98, 1
R. Doverspike, S. Phillips, J. Westbrook (2000)
Transport network architectures in an IP worldProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 1
Yuna Zhang, O. Yang (2002)
Different implementations of token tree algorithm for DWDM network protection/restorationProceedings. Eleventh International Conference on Computer Communications and Networks
Shahrarn Shah-Heydari, O. Yang (2001)
A tree-based algorithm for protection/restoration in optical mesh networksCanadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555), 2
W. Grover, D. Stamatelakis (1998)
Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restorationICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220), 1
L. Gardner, M. Heydari, J. Shah, I. Sudborough, I. Tollis, C. Xia (1994)
Techniques for finding ring covers in survivable networks1994 IEEE GLOBECOM. Communications: The Global Bridge, 3
D. Zappala, Aaron Fabbri, V. Lo (2001)
An Evaluation of Shared Multicast Trees with Multiple Cores
S. Lumetta, M. Médard (2001)
Towards a deeper understanding of link restoration algorithms for mesh networksProceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 1
Tsong-Ho Wu (1995)
Emerging technologies for fiber network survivabilityIEEE Commun. Mag., 33
G. Ellinas, A. Hailemariam, T. Stern (2000)
Protection cycles in mesh WDM networksIEEE Journal on Selected Areas in Communications, 18
S. Ramamurthy, B. Mukherjee (1999)
Survivable WDM mesh networks. Part I-ProtectionIEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), 2
Yuna Zhang, O. Yang (2002)
A distributed tree algorithms for WDM network protection/restoration5th IEEE International Conference on High Speed Networks and Multimedia Communication (Cat. No.02EX612)
T. Ballardie (1993)
Core based trees
H. Zhang (2002)
DWDM Network Protection/Restoration with Ring/Cycle Topologies
H. Liu, O. Yang, S. Shah-Heydari (2003)
A tree-based link protection algorithmCCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436), 2
Tsong-Ho Wu (1992)
Fiber Network Service Survivability
K. Ishida, Ozuka-Higashi Asa-Minami-Ku (1997)
Multiple node-disjoint path protocol for virtual paths in ATM networksProceedings of 5th International Workshop on Parallel and Distributed Real-Time Systems and 3rd Workshop on Object-Oriented Real-Time Systems
S. Finn, M. Médard, R. Barry (1997)
A novel approach to automatic protection switching using treesProceedings of ICC'97 - International Conference on Communications, 1
S. Ramamurthy, B. Mukherjee (1999)
Survivable WDM mesh networks, Part I: ProtectionProc. of IEEE ICC'99, 2
Lee Lipes (2002)
Understanding the trade-offs associated with sharing protectionOptical Fiber Communication Conference and Exhibit
F. Ellefson (1990)
Migration of fault tolerant networks[Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition
R. Kawamura (1998)
Architectures for ATM network survivabilityIEEE Communications Surveys & Tutorials, 1
This paper presents a novel technique for link protection in mesh networks based on the use of hierarchical trees. The hierarchical protection tree (or p-tree) provides hierarchical layering of the network. The straddling links that are not located in the tree are protected through tree branches to higher-layer Parent nodes. The links in the tree are protected by links to backup parent nodes. This scheme offers several advantages such as scalability, failure impact restriction, and distributed processing. We provide a mathematical analysis to compute performance measures for our link protection scheme, and perform restorability analysis for several real and arbitrary long haul networks to compare our scheme to other link protection proposals. Our results demonstrate the applicability of hierarchical p-tree link protection schemes in real long-haul networks.
Photonic Network Communications – Springer Journals
Published: Oct 20, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.