Minimum-color path problems for reliability in mesh networks

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2005, Pages 2658-2669

  Yuan, Shengli ^a   Varma, Saket ^b   Jue, Jason P ^b  

^a UNIVERSITY OF HOUSTON   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

Graph theory; Integer linear program (ILP); Link disjoint; Mathematical programming optimization; Minimum Color path; Node disjoint; Path protection; Risk; Risk disjoint; Shared risk link group; Simulations; System design

Indexed keywords

INTEGER LINEAR PROGRAM (ILP); LINK DISJOINT; MINIMUM-COLOR PATH; NODE DISJOINT; PATH PROTECTION; RISK; RISK DISJOINT; SHARED RISK LINK GROUP;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; RELIABILITY; SYSTEMS ANALYSIS;

TELECOMMUNICATION NETWORKS;

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

References (27)

1. E. Rosen, A. Viswanathan, R. Callon, "RFC 3031 Multiprotocol Label Switching Architecture", www.ietf.org
2. B. Davie, P. Doolan, Y. Rekhter, Switching in IP Networks. Morgan Kaufmann, 1998.
3. B. Mukherjee, Optical Communication Networks. New York: McGraw Hill, 1997.
4. R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective. San Francisco, Morgan Kaufmann, 1998.
5. O. Gerstel, "Opportunities for optical protection and restoration," Proceedings, IEEE OFC '98.
6. T. Wu, Fiber Network Survivability, MA: Artech House, 1992.
7. S. Ramamurthy, B. Mukherjee, "Survivable WDM mesh networks, part I - protection," Proceedings, IEEE INFOCOM'99.
8. J. Strand, "Issues for routing in the optical layers," IEEE Communication Magazine, Feb. 2001
9. P. Sebos, et al. "Auto-discovery of shared risk link groups," Proceedings, IEEE OFC 2001.
10. S. Yuan, J. P. Jue, "Shared protection routing algorithm for optical network," Optical Network Magazine, May-June, 2002.
11. S. Yuan, J. P. Jue, "Dynamic path protection in WDM mesh networks under risk disjoint constraint," IEEE Globecom 2004
12. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, McGraw Hill, 1997.
13. J. W. Suurballe, R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
14. Remesh Bhandari, Survivable Networks - Algorithms for Diverse Routing, Kluwer Academic Publishers.
15. R. Carr, S. Doddi, G. Konjevod, M. Marathe, "On the red-blue set cover problem," Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 345 - 353, 2000
16. R. Chang, S. Leu, "The minimum labeling spanning trees," Information Processing Letters, Vol. 63, pp. 277-282, 1997.
17. S. Krumke, H. Wirth, "On the minimum label spanning tree problem," Information Processing Letters, Vol. 66, pp. 81-85, 1998.
18. Y. Wan, G. Chen, Y. Xu, "A note on the minimum label spanning tree," Information Processing Letters, Vol. 84, pp. 99-101, 2002.
19. "ITU-T G.803: Architecture of Transport Networks Based on the Synchronous Digital Hierarchy (SDH)," http://www.itu.int
20. "ITU-T I.122: Framework for frame mode bearer services," http://www.itu.int
21. "ITU X.25: Interface between DTE and DCE for terminals operating in packet mode and connected to public data networks by dedicated circuit," http://www.itu.int
22. M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness, pp.222. New York: W. H. Freeman Company, 1979.
23. G. Ellinas, E. Bouillet, R. Ramamurthy, J. Labourdette, S. Chaudhuri and K. Bala, "Routing and restoration architectures in mesh optical networks," SPIE Optical. Networks Magazine, vol. 4, Jan/Feb. 2003.
24. http://www.ilog.com/products/cplex
25. G. Z. Li, B. Doverspike, and C. Kalmanek, "Fiber span failure protection in mesh optical networks," Proc. SPIE OptiComm 2001: Optical Networking and Communications, vol. SPIE 4599.
26. http://www.ilog.com/products/cplex/
27. http://www.algorithmic-solutions.com/enleda.htm