Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2005, Pages 2702-2710

  Zhang, Weiyi ^a   Xue, Guoliang ^a   Tang, Jian ^a   Thulasiraman, Krishnaiyan ^b  

^a Arizona State University   (United States)

^b University of Oklahoma   (United States)

Author keywords

Blue red trees; Linear time algorithms; Protection and restoration; Quality of protection; Quality of service; Redundant trees

Indexed keywords

BLUE/RED TREES; LINEAR TIME ALGORITHMS; PROTECTION AND RESTORATION; QUALITY OF PROTECTION (QOP); REDUNDANT TREES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; SECURITY OF DATA; TREES (MATHEMATICS);

QUALITY OF SERVICE;

EID: 25644442522     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498553     Document Type: Conference Paper

References (25)

1. V. Anand and C. Qiao, Dynamic establishment of protection paths in WDM networks, Part I, IEEE International Conference on Communications and Computer Networks'2000, pp. 198-204.
2. Hongsik Choi, S. Subramaniam, and Hyeong-Ah Choi, On doublelink failure recovery in WDM optical networks, IEEE INFOCOM2002, pp. 808-816.
3. G.Ellinas, A.G.Hailemariam, T.E. Stern, Protection cycles in mesh WDM networks, IEEE Journal on Selected Areas in Communications, Vol. 18(2000), pp. 1924-1937.
4. W.D. Grover and D. Stamatelakis, Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration, IEEE International Conference on Communications'1998, pp. 537-543.
5. A. Itai and M.Rodeh, The multi-tree approach to reliablity in distributed networks, Information and Computation, Vol.79(1988), pp. 43-59;
6. A. Jukan and A. Monitzer, Restoration methods for multi-service optical networks, G. de Marchis and R. Sabella (ed.), Optical Networks: Design and Modelling, Kluwer Academic Publishers, 1999, pp. 3-12.
7. Algorithmic Solutions Software GmbH, The LEDA User Manual, Version 4.2.1, www.mpi-sb.mpg.de/LEDA/MANUAL.
8. M. Médard, S.G. Finn and R.A. Barry, A novel approach to automatic protection switching using trees, IEEE International Conference on Communications'1997, pp. 272-276.
9. M. Médard, S. G. Finn, R.A. Barry and R.G. Gallager, Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs, IEEE/ACM Transactions on Networking, Vol. 7(1999), pp. 641-652;
10. M. Medard, R.A. Barry, S.G. Finn, W. He, and S.S. Lumetta, Generalized loop-back recovery in optical mesh networks, IEEE/ACM Transactions on Networking, Vol. 10(2002), pp. 153-164.
11. G. Mohan, C. S. Ram Murthy, A. K, Somani, Efficient Algorithms for Routing Dependable Connections in WDM Optical Networks, IEEE/ACM Transactions on Networking, Vol. 9(2001), pp. 553-566.
12. B. Mukherjee, Optical Communication Networks, McGraw Hill, 1997.
13. B. Mukherjee, WDM optical networks: progress and challenges, IEEE Journal on Selected Areas in Communications, Vol. 18(2000), pp. 1810-1824.
14. I. Ouveysi, A. Wirth, On Design of a Survivable Network Architecture for Dynamic Routing: Optimal Solution Strategy and an Efficient Heuristic, European Journal of Operational Research, Vol. 117(1999), pp. 30-44.
15. I. Ouveysi, A. Wirth, Minimal Complexity Heuristics for Robust Network Architecture for Dynamic Routing, Journal of the Operational Research Society, Vol. 50(1999), pp. 262-267.
16. C. Qiao and D. Xu, Distributed partial information management (DPIM) schemes for survivable networks - Part I, IEEE INFOCOM2002, pp. 302-311.
17. S. Ramamurthy and B. Mukherjee, Survivable WDM mesh networks. Part I-Protection IEEE INFOCOM1999, pp. 744-751.
18. S. Ramamurthy and B. Mukherjee, Survivable WDM mesh networks. II. Restoration IEEE International Conference on Communications'1999, pp. 2023-2030.
19. L. Sahasrabuddhe, S. Ramamurthy and B. Mukherjee, Fault management in IP-over-WDM networks: WDM protection versus IP restoration, IEEE Journal on Selected Areas in Communications, Vol. 20(2002), pp. 21-33.
20. R.E. Tarjan, Depth first search and linear graph algorithms, SIAM Journal on Computing. Vol. 1(1972), pp. 146-160.
21. D.B. West, Introduction to Graph Theory, Prentice Hall, 1996, 2001.
22. T.H. Wu and W.I. Way, A novel passive protected SONET bidirectional self-healing ring architecture, IEEE Journal of Lightwave Technology, Vol. 10(1992), pp. 1314-1322
23. G. Xue, L. Chen and K. Thulasiraman, QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs, IEEE International Conference on Communications'2002, pp. 2766-2770.
24. G. Xue, L. Chen and K. Thulasiraman, Quality of service and quality protection issues in preplanned recovery schemes using redundant trees, IEEE JSAC series in Optical Communications and Networking, Vol. 21(2003), pp. 1332-1345.
25. G. Xue, R. Gottpu, and W. Zhang, Survivable Network Design using Path- based Spanners, submitted to Computer Communications.