Competitive multicast routing

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.

[1]  I. Cidon,et al.  Bandwidth management and congestion control in plaNET , 1991, IEEE Communications Magazine.

[2]  Jean-Yves Le Boudec,et al.  The Asynchronous Transfer Mode: A Tutorial , 1992, Comput. Networks ISDN Syst..

[3]  Bala Rajagopalan.  Reliability and scaling issues in multicast communication , 1992, SIGCOMM '92.

[4]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM '93.

[5]  Roch Guérin,et al.  The plaNET/ORBIT High Speed Network , 1993, J. High Speed Networks.

[6]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[7]  Dinesh C. Verma,et al.  Routing reserved bandwith multi-point connections , 1993, SIGCOMM 1993.

[8]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[9]  Baruch Awerbuch,et al.  Distributed control for PARIS , 1990, PODC '90.

[10]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[11]  Yossi Azar,et al.  The competitiveness of on-line assignments , 1992, SODA '92.

[12]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[13]  K. G. Ramakrishnan,et al.  On-line Routing for Virtual Private Networks , 1994 .

[14]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.

[15]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.

[16]  Yossi Azar,et al.  Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.

[17]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[18]  Kimberly C. Claffy,et al.  NSF Implementation Plan for Interagency Interim NREN , 1993, J. High Speed Networks.

[19]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[20]  Deborah Estrin,et al.  A study of priority pricing in multiple service class networks , 1991, SIGCOMM '91.

[21]  Yossi Azar,et al.  On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[22]  Moti Yung,et al.  Efficient on-line call control algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.