PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A study of priority pricing in multiple service class networks
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
The Asynchronous Transfer Mode: a tutorial
Computer Networks and ISDN Systems - Special issue on the ATM—asynchronous transfer mode
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Reliability and scaling issues in multicast communication
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Routing reserved bandwith multi-point connections
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Distributed admission control, scheduling, and routing with stale information
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we introduce and solve the multicast routing problem for virtual circuit 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 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 an O(\log n \log ) d competitive factor where n is the size of the network and d \leq n is the maximum size of a multicast group.