Skip to main content
SpringerLink
Log in

Competitive multicast routing

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In this paper, we introduce and solve the multicast routing problem for virtual circuit environmentwithout making any assumptions about the communication patterns, or about the network topology. By multicast we refer to the case were one source transmits to several destination the same information. Also, we allow arbitrary interleaving of subscription patterns for different multicast groups, i.e. the destinations for each group arrive at an arbitrary order and may be interleaved with destinations of other groups. Our goal is to make route selection so as to minimize congestion of the bottleneck link. This is the first analytical treatment for this problem in its full generality. The main contribution of this paper is an online competitive routing strategy that has anO(logn logd) competitive factor wheren is the size of the network andd(≤n) is the maximum size of a multicast group.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, in:Proc. 25th ACM Symp. on Theory of Computing, 1993, pp. 623–631.

  2. B. Awerbuch, Y. Azar and R. Gawlick, Dense trees and competitive selective multicast, unpublished manuscript (1994).

  3. B. Awerbuch, Y. Azar and S. Plotkin, Throughput competitive online routing, in:Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, pp. 32–40.

  4. B. Awerbuch, Y. Azar, S. Plotkin and O. Waarts, Competitive routing of virtual circuits with unknown duration, in:Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994.

  5. Y. Azar, A. Broder and A. Karlin, On-line load balancing, in:Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 218–225.

  6. B. Awerbuch, I. Cidon, I. Gopal, M. Kaplan and S. Kutten, Distributed control for PARIS, in:Proc. 9th ACM Symp. on Principles of Distributed Computing, 1990, pp. 145–160.

  7. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs and O. Waarts, On-line load balancing of temporary tasks, in:Proc. Workshop on Algorithms and Data Structures, 1993, pp. 119–130.

  8. Y. Azar, J. Naor and R. Rom, The competitiveness of on-line assignment, in:Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 203–210.

  9. T. Ballardi, P. Francis and J. Crowcroft, Core based trees (cbt), in:Proc. Annual ACM SIGCOMM Symposium on Communication Architectures and Protocols, San Francisco, CA, 1993, pp. 85–95.

  10. J.Y. Le Boudec, The asynchronous transfer mode: a tutorial, Comp. Networks and ISDN Syst. 24 (1992) 279–309.

  11. R. Cocchi, D. Estrin, S. Shenker and L. Zhang, A study of priority pricing in multiple service class networks, in:Proc. Annual ACM SIGCOMM Symp. on Communication Architectures and Protocols, Zurich, Switzerland, 1991.

  12. I. Cidon and I.S. Gopal, PARIS: An approach to integrated high-speed private networks, Int. J. Digital & Analog Cabled Syst. 1 (2) (1988) 77–86.

    Google Scholar 

  13. I. Cidon, I. Gopal and R. Guérin, Bandwidth management and congestion control in plaNET, IEEE Commun. Mag. 29(10) (1991) 54–63.

    Google Scholar 

  14. I. Cidon, I. Gopal, P.M. Gopal, R. Guérin, J. Janniello and M. Kaplan, The plaNET/ORBIT high speed network, J. High Speed Networks 2(3) (1993) 1–38.

    Google Scholar 

  15. J.A. Garay and I.S. Gopal, Call preemption in communication networks, in:Proc. INFOCOM '92, Vol. 44, Florence, Italy, 1992, pp. 1043–1050.

  16. J. Garay, I. Gopal, S. Kutten, Y. Mansour and M. Yung, Efficient on-line call control algorithms, in:Proc. 2nd Annual Israel Conf. on Theory of Computing and Systems, 1993.

  17. R. Gawlick, C. Kamanek and K.G. Ramakrishnan, On-line routing for virtual private networks, unpublished manuscript (1994).

  18. F.P. Kelly, Blocking probabilities in large circuit-switched networks, Adv. Appl. Prob. 18 (1986) 473–505.

    Google Scholar 

  19. B. Rajagopalan, Reliability and scaling issues in multicast communication, in:Proc. Annual ACM SIGCOMM Symp. on Communication Architectures and Protocols, Baltimore, MD, 1992, pp. 188–197.

  20. D.C. Verma and P.M. Gopal, Routing reserved bandwidth multi-point connections, in:Proc. Annual ACM SIGCOMM Symp. on Communication Architectures and Protocols, San Fransisco, CA, 1993, 96–105.

  21. CCITT SG XVIII, Special issue on asynchronous transfer mode, Int. J. Digital & Analog Cabled Syst. 1(4) (1988).

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, MIT, USA

    Baruch Awerbuch

  2. Department of Computer Science, Tel-Aviv University, Israel

    Yossi Azar

Authors
  1. Baruch Awerbuch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yossi Azar
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by Air Force Contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171, NSF contract 9114440-CCR, DARPA contract N00014-J-92-1799, and a special grant from IBM.

Supported in part by the Israel Science Foundation administered by the Israel Academy of Sciences.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Awerbuch, B., Azar, Y. Competitive multicast routing. Wireless Netw 1, 107–114 (1995). https://doi.org/10.1007/BF01196262

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01196262

Keywords

Search

Navigation