Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 1610–1617Cite as

Integer Linear Programs for Routing and Protection Problems in Optical Networks

  • Reference work entry

  • 160 Accesses

Article Outline

Keywords and Phrases

Introduction

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

References

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bhandari R (1999) Survivable Networks: Algorithms for Diverse Routing, Klumer, Norwell

    Google Scholar 

  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 Symposium

    Google Scholar 

  3. Cha M, Choudhury G, Yates J, Shaikh A, Moon S (2006) Case Study: Resilient Backbone Network Design for IPTV Services: WWW IPTV Workshop

    Google Scholar 

  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, I3S

    Google Scholar 

  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–106

    Google Scholar 

  6. Fei A, Cui J, Gerla M, Cavendish D (2001) A “Dual-Tree” Scheme for Fault-tolerant Multicast. IEEE ICC, June 2001

    Google Scholar 

  7. Grover, Wayne D (2003) Mesh-Based Survivable Networks. Prentice Hall, Upper Saddle River

    Google Scholar 

  8. Hu JQ (2003) Diverse Routing in Optical Mesh Networks. IEEE/ACM ToN 51(3):489–494

    Google Scholar 

  9. Iraschko R, Grover W (2002) A Highly Efficient Path-Restoration Protocol for Management of Optical Network Transport Integrity. IEEE JSAC 18(5):779–793

    Google Scholar 

  10. Li C, McCormick ST, Simchi-Levi D (1992) Finding Disjoint Paths with Different Path Costs: Complexity and Algorithms. Network 22:653–667

    Article  MathSciNet  MATH  Google Scholar 

  11. Li G, Kalmanek C, Doverspike R (2002) Fiber Span Failure Protection in Mesh Optical Networks. Opt Netw Mag 3(3):21–31

    Google Scholar 

  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–652

    Article  Google Scholar 

  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–809

    Google Scholar 

  14. Murthy C, Siva R, Gurusamy M (2001) WDM Optical Networks. Prentice Hall, Englewood Cliffs

    Google Scholar 

  15. Ramamurthy S, Sahasrabuddhe L, Mukherjee B (2003) Survivable WDM Mesh Networks. J Lightwave Tech 21(11):870–883

    Article  Google Scholar 

  16. Ramaswami R, Sivarajan K (1998) Optical Networks: A practical Perspective. Morgan Kaufmann, Los Altos

    Google Scholar 

  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–33

    Google Scholar 

  18. Stern TE, Bala K (1999) Multiwavelength Optical Networks: A Layered Approach. Addison-Wesley, Boston

    Google Scholar 

  19. Suurballe J, Tarjan R (1984) A Quick Method for Finding Shortest Pairs of Disjoint Paths. Network 14:325–336

    Article  MathSciNet  MATH  Google Scholar 

  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–158

    Google Scholar 

  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–258

    Google Scholar 

  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–258

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, Korean Advanced Institute of Science and Technology, Daejeon, Korea

    Meeyoung Cha

  2. Department of Industrial and Systems Engineering, Rutgers University, Piscataway, USA

    W. Art Chaovalitwongse & Zhe Liang

  3. AT&T Labs – Research, Florham Park, USA

    Jennifer Yates & Aman Shaikh

  4. Division of Computer Science, Korean Advanced Institute of Science and Technology, Daejeon, Korea

    Sue B. Moon

Authors
  1. Meeyoung Cha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Art Chaovalitwongse
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhe Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jennifer Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Aman Shaikh
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Sue B. Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Cha, M., Chaovalitwongse, W.A., Liang, Z., Yates, J., Shaikh, A., Moon, S.B. (2008). Integer Linear Programs for Routing and Protection Problems in Optical Networks . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_283

Download citation

Publish with us

Policies and ethics

Search

Navigation