Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Computing

IWDC 2003: Distributed Computing - IWDC 2003 pp 361–371Cite as

Algorithms for Provisioning Survivable Multicast Sessions against Link Failures in Mesh Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2918))

Abstract

We investigate new algorithms for efficiently establishing a multicast session in a mesh network while protecting the session from a link failure, e.g., a fiber cut in an optical network.

One of the new algorithms, IMPROVED_SEGMENT, protects each segment in the primary tree. The other new algorithm, IMPROVED_PATH, discovers backup resources for protecting each path, from source to destination, in the tree. We find that IMPROVED_SEGMENT performs significantly better (around 14% less resource utilization for a typical wide-area mesh network) than a simple-minded segment-protection algorithm called SEGMENT. For dynamic connection provisioning, IMPROVED_PATH is found to perform significantly better than PATH, and IMPROVED_SEGMENT is found to perform significantly better than SEGMENT. Among all these algorithms, IMPROVED_PATH is found to perform the best.

Although we study these algorithms in an optical WDM context, the approaches are applicable to other contexts as well, such as SONET or Gigabit Ethernet (GBE).

This work has been supported by the US National Science Foundation (NSF) under Grant Nos. NCR-95-08239, ANI-98-05285, and ANI-02-07864.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mukherjee, B.: Optical Communication Networks, July 1997. McGraw-Hill, New York (1997)

    Google Scholar 

  2. Miller, C.K.: Multicast Networking and Applications. Addison-Wesley, Reading (1999)

    Google Scholar 

  3. Sun, Y., Gu, J., Tsang, D.H.K.: Multicast routing in all-optical wavelength routed networks. Optical Networks Magazine, 101–109 (July/August 2001)

    Google Scholar 

  4. Singhal, N., Mukherjee, B.: Protecting Multicast Sessions in WDM Optical Mesh Networks. IEEE/OSA Journal of Lightwave Technology 21(4), 884–892 (2003)

    Article  Google Scholar 

  5. Sahasrabuddhe, L.H., Mukherjee, B.: Light-Trees: Optical Multicasting for Improved Performance in Wavelength-Routed Networks. IEEE Communications Magazine 37(2), 67–73 (1999)

    Article  Google Scholar 

  6. Singhal, N., Sahasrabuddhe, L.H., Mukherjee, B.: Dynamic Provisioning of Survivable Multicast Sessions in Optical WDM Mesh Networks. Technical Digest, OFC, Atlanta, GA, paper TuI5 (March 2003)

    Google Scholar 

  7. Ramamurthy, S., Sahasrabuddhe, L.H., Mukherjee, B.: Survivable WDM Mesh Networks. IEEE/OSA Journal of Lightwave Technology 21(4), 870–883 (2003)

    Article  Google Scholar 

  8. Singhal, N., Sahasrabuddhe, L.H., Mukherjee, B.: Protecting a Multicast Session Against Single Link Failures in a Mesh Network. In: Proc., IEEE International Conference on Communications, Anchorage, Alaska (May 2003)

    Google Scholar 

  9. Medard, M., Finn, S., Barry, R., Gallager, R.: Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge-Redundant Graphs. IEEE/ACM Transaction on Networking 7(5), 641–652 (1999)

    Article  Google Scholar 

  10. Zhang, X., Wei, J., Qiao, C.: Constrained Multicast Routing in WDM networks with Sparse Light Splitting. In: Proc., IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, vol. 3, pp. 1781–1790 (2000)

    Google Scholar 

  11. Hakimi, S.L.: Steiner’s problem in graphs and its implications. Networks 1(2), 113–133 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  12. Singhal, N., Mukherjee, B.: Architectures and Algorithm for Multicasting in WDM Optical Mesh Networks using Opaque and Transparent Optical Cross-Connects. Technical Digest, OFC, Anaheim, CA, paper TuG8 (March 2001)

    Google Scholar 

  13. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica, 573–577 (1980)

    Google Scholar 

  14. Suurballe, J.W.: Disjoint Paths in a Network. Networks 4, 125–145 (1974)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Davis, CA, 95616, USA

    Narendra K. Singhal & Biswanath Mukherjee

Authors
  1. Narendra K. Singhal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Biswanath Mukherjee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department SUNY at Stony Brook, NY 11794-4400, Stony Brook, USA

    Samir R. Das

  2. Department of Computer Science and Engineering, University of Texas at Arlington, P.O. Box 19015, TX 76019, Arlington, USA

    Sajal K. Das

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Singhal, N.K., Mukherjee, B. (2003). Algorithms for Provisioning Survivable Multicast Sessions against Link Failures in Mesh Networks. In: Das, S.R., Das, S.K. (eds) Distributed Computing - IWDC 2003. IWDC 2003. Lecture Notes in Computer Science, vol 2918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24604-6_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24604-6_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20745-0

  • Online ISBN: 978-3-540-24604-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation