A distributed tree algorithms for WDM network protection/restoration

5th IEEE International Conference on High Speed Networks and Multimedia Communications, HSNMC 2002

Volumn , Issue , 2002, Pages 289-294

  Zhang, Yuna ^a   Yang, O W W ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Distributed Tree Algorithm; Network Protection Restoration; Node ID List; Pick up Parent Message; Restoration Schemes

Indexed keywords

ALGORITHMS; HIGH SPEED NETWORKS; MULTIMEDIA SYSTEMS; PICKUPS; RESTORATION;

EFFICIENT PROTECTIONS; HIGH SPEED OPTICAL NETWORKS; NETWORK PROTECTION; NODE ID LIST; PERFORMANCE ANALYSIS; RESTORATION STRATEGIES; SHORTEST PATH; TREE ALGORITHMS;

TREES (MATHEMATICS);

EID: 84964252983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HSNMC.2002.1032593     Document Type: Conference Paper

References (11)

1. Tsong-Ho Wu, "Fiber Network Service Survivability", Artech House, Boston, London, 1992
2. GR-1400-Core, SONET Dual-Fed Unidirectional Path Switching Ring(UPSR) Equipment Generic Criteria, Bellcore, Issue 2, November 1995
3. Demetrios Stamatelakis and Wayne D. Grover, "Network Restorability Design Using Pre-configured Trees, Cycles and Mixtures of Pattern Types", TRLabs Technical Report, TR-1999-05
4. D.Stamatelakis, W.D. Grover, Theoretical Underpinnings for the efficiency of Restorable Networks Using Pre-configured Cycles ("p-cycles"), Theory for efficiency for Restorable Networks using p-cycles, Dec. 1999(TComm 00-013).
5. R. Gallager, P. Humblet, and P. Spira. "A distributed algorithm for minimum-weight spanning trees," ACM Transactions on Programming Languages and Systems, vol. 5, no. 1, pp. 66-77, Jan. 1983
6. Michalis Faloutsos and Mart Molle, Creating Optimal Distributed Algorithms for Minimum Spanning Trees, Thesis, University of Toronto May 9, 1995
7. Muriel Medard, Steven G. Fiin and et. al., Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge-redundant Graphs, IEEE/ACM Transactions on Networking,Vol. 7, No. 5, October 1999, PP.641-652.
8. Lech Szymanski and Oliver W. W. Yang, "Spanning tree algorithm for spare network capacity", CCECE, Toronto, Canada, PP447-543, May 2001.
9. Shaharam Shah-Heydari and Oliver Yang,, "A Tree-based Algorithm for Protection/Restoration in Optical Mesh Networks", CCECE, PP1169-1174, May 2001, Toronto, Canada.
10. D.Stamatelakis, W.D. Grover, Network Restorability Design Using Pre-Configured Trees, Cycles, and Mixtures of Pattern Types, TRLabs Technical Report, TR-1999-05.
11. D. Anthorny, Wayne D. Grover, "Comparison of k-Shortest Paths and Maximum Flow Routing for Network Facility Restoration", IEEE Journal on Selected Areas in Communications, Vol. 12, No. 1, January 1994. PP 823-834.