 
Summary: Competitive Multicast Routing
Baruch Awerbuch \Lambda Yossi Azar y
Abstract
In this paper, we introduce and solve the multicast routing problem for virtual cir
cuit environment without 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 in
terleaving of subscription patterns for different multicast groups, i.e. the destinations
for each group arrive at an arbitrary order and may 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 an O(log n log d) competitive factor where n is the size of the network and d(Ÿ n)
is the maximum size of a multicast group.
\Lambda Lab. for Computer Science, MIT. Supported by Air Force Contract TNDGAFOSR860078, ARO con
tract DAAL0386K0171, NSF contract 9114440CCR, DARPA contract N00014J921799, and a special
grant from IBM.
y Department of Computer Science TelAviv University. Email: azar@math.tau.ac.il
0
