Encyclopedia of Optimization

2009 Edition
| Editors: Christodoulos A. Floudas, Panos M. Pardalos

Integer Linear Programs for Routing and Protection Problems in Optical Networks

  • Meeyoung Cha
  • W. Art Chaovalitwongse
  • Zhe Liang
  • Jennifer Yates
  • Aman Shaikh
  • Sue B. Moon
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-74759-0_283

Article Outline

Keywords and Phrases


Motivations and Challenges in Optimization Models

Path-Protection (Diverse) Routing Problem

  Minimum Color Problem

  Finding the Dual Link Problem

  SRRG-Diverse Routing Problem

  Shared Path-Protection Problem

Path-Restoration Problem

  Optical Path Restoration Problem

  IP Path–Restoration Problem

Concluding Remarks


Keywords and Phrases

Integer linear programming Routing Optical networks Diverse path 
This is a preview of subscription content, log in to check access.


  1. 1.
    Bhandari R (1999) Survivable Networks: Algorithms for Diverse Routing, Klumer, NorwellGoogle Scholar
  2. 2.
    Cha M, Chaovalitwongse W, Art, Ge Z, Yates J, Moon S (2006) Path Protection Routing with Constraints SRLG to Support IPTV in Mesh WDM Networks. IEEE Global Internet SymposiumGoogle Scholar
  3. 3.
    Cha M, Choudhury G, Yates J, Shaikh A, Moon S (2006) Case Study: Resilient Backbone Network Design for IPTV Services: WWW IPTV WorkshopGoogle Scholar
  4. 4.
    Coudert D, Datta P, Rivano H, Voge M-E (2005) Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks, Research Report RR-2005–37-FR, I3SGoogle Scholar
  5. 5.
    Ellinas G, Bouillet E, Ramamurthy R, Labourdette J-F, Chaudhuri S, Bala K (2003) Routing and Restoration Architectures in Mesh Optical Networks. Opt Netw Mag 4(1):91–106Google Scholar
  6. 6.
    Fei A, Cui J, Gerla M, Cavendish D (2001) A “Dual-Tree” Scheme for Fault-tolerant Multicast. IEEE ICC, June 2001Google Scholar
  7. 7.
    Grover, Wayne D (2003) Mesh-Based Survivable Networks. Prentice Hall, Upper Saddle RiverGoogle Scholar
  8. 8.
    Hu JQ (2003) Diverse Routing in Optical Mesh Networks. IEEE/ACM ToN 51(3):489–494Google Scholar
  9. 9.
    Iraschko R, Grover W (2002) A Highly Efficient Path-Restoration Protocol for Management of Optical Network Transport Integrity. IEEE JSAC 18(5):779–793Google Scholar
  10. 10.
    Li C, McCormick ST, Simchi-Levi D (1992) Finding Disjoint Paths with Different Path Costs: Complexity and Algorithms. Network 22:653–667MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Li G, Kalmanek C, Doverspike R (2002) Fiber Span Failure Protection in Mesh Optical Networks. Opt Netw Mag 3(3):21–31Google Scholar
  12. 12.
    Medard M, Finn SG, Barry RA (1999) Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge-Redundant Graphs. IEEE/ACM ToN 7(5):641–652CrossRefGoogle Scholar
  13. 13.
    Modiano E, Narula-Tam A (2002) Survivable Lightpath Routing: A New Approach to the Design of WDM-Based Networks. IEEE JSAC 20(4):800–809Google Scholar
  14. 14.
    Murthy C, Siva R, Gurusamy M (2001) WDM Optical Networks. Prentice Hall, Englewood CliffsGoogle Scholar
  15. 15.
    Ramamurthy S, Sahasrabuddhe L, Mukherjee B (2003) Survivable WDM Mesh Networks. J Lightwave Tech 21(11):870–883CrossRefGoogle Scholar
  16. 16.
    Ramaswami R, Sivarajan K (1998) Optical Networks: A practical Perspective. Morgan Kaufmann, Los AltosGoogle Scholar
  17. 17.
    Sahasrabuddhe L, Ramamurthy S, Mukherjee B (2002) Fault Management in IP-Over-WDM Networks: WDM Protection Versus IP Restoration. IEEE JSAC 20(1):21–33Google Scholar
  18. 18.
    Stern TE, Bala K (1999) Multiwavelength Optical Networks: A Layered Approach. Addison-Wesley, BostonGoogle Scholar
  19. 19.
    Suurballe J, Tarjan R (1984) A Quick Method for Finding Shortest Pairs of Disjoint Paths. Network 14:325–336MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Xu D, Chen Y, Xiong Y, Qiao C, He X (2006) On the Complexity of and Algorithms for Finding the Shortest Path with a Disjoint Counterpart. IEEE/ACM ToN 14(1):147–158Google Scholar
  21. 21.
    Xu D, Xiong Y, Qiao C (2003) Protection with Multi-Segments (PROMISE) in Networks with Shared Risk Link Group (SRLG). IEEE/ACM ToN 11(2):248–258Google Scholar
  22. 22.
    Zang H, Ou C, Mukherjee B (2003) Path-Protection Routing and Wavelength Assignment (RWA) in WDM Mesh Networks Under Duct-Layer Constraints. IEEE/ACM ToN 11(2):248–258CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Meeyoung Cha
    • 1
  • W. Art Chaovalitwongse
    • 2
  • Zhe Liang
    • 2
  • Jennifer Yates
    • 3
  • Aman Shaikh
    • 3
  • Sue B. Moon
    • 4
  1. 1.Division of Computer ScienceKorean Advanced Institute of Science and TechnologyDaejeonKorea
  2. 2.Department of Industrial and Systems EngineeringRutgers UniversityPiscatawayUSA
  3. 3.AT&T Labs – ResearchFlorham ParkUSA
  4. 4.Division of Computer ScienceKorean Advanced Institute of Science and TechnologyDaejeonKorea