Efficient Bandwidth Guaranteed Restoration Algorithms for Multicast Connections

  • William Lau
  • Sanjay Jha
  • Suman Banerjee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3462)

Abstract

This paper defines a new restoration strategy for provisioning bandwidth guaranteed recovery for multicast connections in presence of link failures. The new restoration strategy is formulated into a new Integer Linear Programming (ILP) algorithm and is compared with other existing restoration strategies. We also present a new heuristic algorithm based on this new restoration strategy. Results show that our heuristic algorithm performs competitively close to the ILP-based algorithm, and is more bandwidth efficient than other existing heuristic algorithms that are based on different restoration strategies.

Keywords

Integer Linear Program Service Tree Multicast Tree Link Capacity Restoration Strategy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    FastWeb: TV Over FastWeb (2004), http://www.fastweb.it/
  2. 2.
    now.com.hk: Pay TV Over Broadband (2004), http://www.now.com.hk/
  3. 3.
    TV, S.P.: Terrestial Broadcast (2004), http://www.skyperfectv.co.jp/skycom/e/
  4. 4.
    Moy, J.: Multicast Extensions to OSPF. IETF RFC 1584 (1994)Google Scholar
  5. 5.
    Ballardie, A.: Core Based Trees (CBT). IETF RFC 2201 (1997)Google Scholar
  6. 6.
    Chu, Y., Rao, S., Seshan, S., Zhang, H.: Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture. In: Proceedings of ACM SIGCOMM, San Diego, USA (2001)Google Scholar
  7. 7.
    Banerjee, S., Kommareddy, C., Kar, K., Bhattacharjee, B., Khuller, S.: Construction of an Efficient Overlay Multicast Infrastructure for Real-Time Applications. In: Proceedings of IEEE INFOCOM, San Francisco, USA (2003)Google Scholar
  8. 8.
    Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. IETF RFC 3031 (2001)Google Scholar
  9. 9.
    Berger, L.: Generalized Multi-Protocol Label Switching (GMPLS) Signaling Functional Description. IETF RFC 3471 (2003)Google Scholar
  10. 10.
    Yasukawa, S.: Requirements for Point to Multipoint extension to RSVP-TE. IETF Internet Draft draft-ietf-mpls-p2mp-requirement-01.txt (2004)Google Scholar
  11. 11.
    Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C., Diot, C.: Characterization of Failures in an IP Backbone. In: Proceedings of IEEE INFOCOM, Hong Kong, China (2004)Google Scholar
  12. 12.
    Kodialam, M., Lakshman, T.: Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup. In: Proceedings of IEEE ICNP, Paris, France (2002)Google Scholar
  13. 13.
    Medard, M., Finn, S., Barry, R., Gallenger, R.: Redundant Trees for Preplanned Recovery in Arbitary Vertex-Redundant or Edge-Redundant Graphs. IEEE/ACM Transactions on Networking 7(5) (1999)Google Scholar
  14. 14.
    Singhal, N., Sahasrabuddhe, L., Mukherjee, B.: Provisioning of Survivable Multicast Sessions Against Single Link Failures in Optical WDM Mesh Networks. IEEE Journal of Lightwave Technology 21(11) (2003)Google Scholar
  15. 15.
    Lau, W., Jha, S.: Multicast Resilient Connections with Quality of Service Guarantees. UNSW Technical Report 0408 (2004)Google Scholar
  16. 16.
    Lau, W., Jha, S.: Failure-Oriented Path Restoration Algorithm for Survivable Networks. eTransactions on Network Service and Management (IEEE Communications Society) 1(1) (2004)Google Scholar
  17. 17.
    Xiong, Y., Mason, L.: Restoration Strategies and Spare Capacity Requirements in Self-Healing ATM Networks. IEEE/ACM Transactions on Networking 7(1) (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • William Lau
    • 1
  • Sanjay Jha
    • 1
  • Suman Banerjee
    • 2
  1. 1.University of New South WalesSydneyAustralia
  2. 2.University of Wisconsin-MadisonMadisonUSA

Personalised recommendations