article

Online multicast routing with bandwidth guarantees: a new approach using multicast network flow

Authors:

Murali Kodialam,

T. V. Lakshman,

Sudipta SenguptaAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 11, Issue 4

Pages 676 - 686

https://doi.org/10.1109/TNET.2003.815302

Published: 01 August 2003 Publication History

Abstract

This paper presents a new algorithm for online routing of bandwidth-guaranteed multicasts where routing requests arrive one by one without there being any a priori knowledge of future requests. A multicast routing request consists of a source s, a set of receivers R, and a bandwidth requirement b. This multicast routing problem arises in many contexts. Two applications of interest are routing of point-to-multipoint label-switched paths in multiprotocol label switched (MPLS) networks, and the provision of bandwidth-guaranteed virtual private network (VPN) services under the "hose" service model [18]. Offline multicast routing algorithms cannot be used since they require a priori knowledge of all multicast requests that are to be routed. Instead, online algorithms that handle requests arriving one by one and that satisfy as many potential future demands as possible are needed. The newly developed algorithm is an online algorithm and is based on the idea that a newly routed multicast must follow a route that does not interfere too much with network paths that may be critical to satisfy future demands. We develop a multicast tree selection heuristic that is based on the idea of deferred loading of certain critical links. These critical links are identified by the algorithm as links that, if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs. The presented algorithm uses link-state information and some auxiliary capacity information for multicast tree selection and is amenable to distributed implementation. Unlike previous algorithms, the proposed algorithm exploits any available knowledge of the network ingress-egress points of potential future demands, even though the demands themselves are unknown, and performs very well.

References

[1]

{1} R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.

[2]

{2} L. Kleinrock, Queueing Systems: Theory. New York: Wiley, Jan. 1975, vol. 1.

[3]

{3} M. J. Alexander and G. Robins, "New performance-driven FPGA routing algorithms," IEEE Trans. Computer-Aided Design, vol. 15, pp. 1505-1517, Dec. 1996.

[4]

{4} D. O. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow, "Extensions to RSVP for LSP Tunnels," IETF, RFC 3209, Dec. 2001.

[5]

{5} D. O. Awduche, J. Malcom, J. Agogbua, M. ODell, and J. McManus, "Requirements for traffic engineering over MPLS," IETF, RFC 2702, Sept. 1999.

[6]

{6} P. Berman and V. Ramaiyer, "Improved approximation algorithms for the Steiner tree problem," J. Algorithms, vol. 17, pp. 381-408, 1994.

[7]

{7} M. Bern and P. Plassman, "The Steiner problems with edge lengths 1 and 2," Inform. Processing Lett., vol. 32, pp. 171-176, 1989.

[8]

{8} E. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol label switching architecture," IETF, RFC 3031, Jan. 2001.

[9]

{9} M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed Steiner problems," in Proc. 9th ACM/SIAM Symp. Discrete Algorithms, 1998, pp. 192-200.

[10]

{10} T. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms . Cambridge, MA: MIT Press, 1990.

[11]

{11} M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP -Completeness. New York: Freeman, 1979.

[12]

{12} G. Apostolopoulos, S. Kamat, D. Williams, R. Guerin, A. Orda, and T. Przygienda, "QoS routing mechanisms and OSPF extensions," IETF, RFC 2676, Aug. 1999.

[13]

{13} D. Katz, D. Yeung, and K. Kompella, "Traffic engineering extensions to OSPF Version 2," IETF, Internet Draft, draft-katz-yeung-ospf-traffic-10.txt, June 2003.

[14]

{14} K. Kompella et al., "OSPF extensions in support of generalized MPLS," IETF, Internet Draft, draft-ietf-ccamp-ospf-gmpls-extensions-09.txt, Dec. 2002.

[15]

{15} R. Guerin, D. Williams, and A. Orda, "QoS routing mechanisms and OSPF extensions," in Proc. IEEE Globecom, 1997, pp. 1903-1908.

[16]

{16} M. Karpinsky and A. Zelikovsky, "New approximation algorithms for the Steiner tree problem," Electronic Colloquium on Computational Complexity (ECCC), Tech. Rep. TR95-030, 1995.

[17]

{17} M. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proc. IEEE INFOCOM, 2000, pp. 376-385.

[18]

{18} N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, and K. K. Ramakrishnan, "A flexible model for resource management in virtual private networks," in Proc. ACM SIGCOMM, Sept. 1999, pp. 95-104.

[19]

{19} D. Ooms, B. Sales, W. Livens, A. Acharya, F. Griffoul, and F. Ansari, "Overview of IP multicast in a Multi-Protocol Label Switching (MPLS) environment," IETF, RFC 3353, Aug. 2002.

[20]

{20} S. Ramanathan, "Multicast tree generation in networks with asymmetric links," IEEE Trans. Networking, vol. 4, pp. 558-568, Aug. 1996.

[21]

{21} E. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol label switching architecture," IETF, RFC 3031, Jan. 2001.

[22]

{22} B. M. Waxman, "Performance evaluation of multipoint routing algorithms," in Proc. IEEE INFOCOM, 1993, pp. 980-986.

[23]

{23} B. Awerbuch, Y. Azar, and Y. Bartal, "On-line generalized Steiner problem," in Proc. 7th Annu. ACM/SIAM Symp. Discrete Algorithms, Jan. 1996, pp. 68-74.

Cited By

Fourour SLebbah Y(2020)Equitable Optimization for Multicast CommunicationInternational Journal of Decision Support System Technology10.4018/IJDSST.202007010112:3(1-25)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.4018/IJDSST.2020070101
Chen ZTao XJiang CLeung V(2019)Joint Minimization of Wired and Wireless Traffic for Content Delivery by Multicast PushingIEEE Transactions on Wireless Communications10.1109/TWC.2019.290839818:5(2828-2841)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1109/TWC.2019.2908398
Noormohammadpour MSrivastava ARaghavendra C(2019)Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2019.8919717(25-31)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1109/ALLERTON.2019.8919717
Show More Cited By

Index Terms

Online multicast routing with bandwidth guarantees: a new approach using multicast network flow

Recommendations

Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
SIGMETRICS '00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

This paper presents a new algorithm for on-line routing of bandwidth-guaranteed multicasts where routing requests arrive one-by-one without there being any a priori knowledge of future requests. A multicast routing request consists of a source s, a set ...
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
Special issue on proceedings of ACM SIGMETRICS 2000

This paper presents a new algorithm for on-line routing of bandwidth-guaranteed multicasts where routing requests arrive one-by-one without there being any a priori knowledge of future requests. A multicast routing request consists of a source s, a set ...
Supporting Quality of Service in IP multicast networks

Developers and providers of data, voice and video applications have to satisfy numerous Quality of Service (QoS) requirements and cope with different architectures emerging to provide these QoS in the Internet. IntServ, DiffServ or MPLS are technologies ...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 11, Issue 4

August 2003

174 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 August 2003

Published in TON Volume 11, Issue 4

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
1,222
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fourour SLebbah Y(2020)Equitable Optimization for Multicast CommunicationInternational Journal of Decision Support System Technology10.4018/IJDSST.202007010112:3(1-25)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.4018/IJDSST.2020070101
Chen ZTao XJiang CLeung V(2019)Joint Minimization of Wired and Wireless Traffic for Content Delivery by Multicast PushingIEEE Transactions on Wireless Communications10.1109/TWC.2019.290839818:5(2828-2841)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1109/TWC.2019.2908398
Noormohammadpour MSrivastava ARaghavendra C(2019)Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2019.8919717(25-31)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1109/ALLERTON.2019.8919717
Rosenthal EChaudhry SChoi IJang J(2012)On a class of branching problems in broadcasting and distributionComputers and Operations Research10.1016/j.cor.2011.06.00139:8(1793-1799)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1016/j.cor.2011.06.001
Even GMedina MSchaffrath GSchmid S(2012)Competitive and deterministic embeddings of virtual networksProceedings of the 13th international conference on Distributed Computing and Networking10.1007/978-3-642-25959-3_8(106-121)Online publication date: 3-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-25959-3_8
Athanasiou GTsagkaris KVlacheas PDemestichas PChemouil PMehaoua AFestor OLupu E(2011)Introducing energy-awareness in traffic engineering for future networksProceedings of the 7th International Conference on Network and Services Management10.5555/2147671.2147736(367-370)Online publication date: 24-Oct-2011
https://dl.acm.org/doi/10.5555/2147671.2147736
Xuan YLea C(2011)Network-coding multicast networks with QoS guaranteesIEEE/ACM Transactions on Networking10.1109/TNET.2010.206253319:1(265-274)Online publication date: 1-Feb-2011
https://dl.acm.org/doi/10.1109/TNET.2010.2062533
Kandavanam GBotvich DBalasubramaniam SJennings B(2009)A hybrid genetic algorithm/variable neighborhood search approach to maximizing residual bandwidth of links for route planningProceedings of the 9th international conference on Artificial evolution10.5555/1883723.1883731(49-60)Online publication date: 26-Oct-2009
https://dl.acm.org/doi/10.5555/1883723.1883731
Farooq FAslam SSarwar SMadani S(2009)QoS-based MPLS multicast tree selection algorithmsProceedings of the 7th International Conference on Frontiers of Information Technology10.1145/1838002.1838013(1-8)Online publication date: 16-Dec-2009
https://dl.acm.org/doi/10.1145/1838002.1838013
Chu JLea C(2008)New architecture and algorithms for fast construction of hose-model VPNsIEEE/ACM Transactions on Networking10.1109/TNET.2007.90071116:3(670-679)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1109/TNET.2007.900711
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents