The multicast address allocation problem: theory and practice

Authors:
Daniel Zappala;Virginia Lo;Chris GauthierDickey
Affiliations:
Department of Computer and Information Science, University of Oregon, Eugene, OR;Department of Computer and Information Science, University of Oregon, Eugene, OR;Department of Computer and Information Science, University of Oregon, Eugene, OR
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on The global Internet
Year:
2004

Citing 10
Cited 0

Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Subcube Allocation in Hypercube Computers

IEEE Transactions on Computers
Multicast routing in a datagram internetwork

Multicast routing in a datagram internetwork
An architecture for wide-area multicast routing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers

IEEE Transactions on Parallel and Distributed Systems
The MASC/BGMP architecture for inter-domain multicast routing

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Session directories and scalable Internet multicast address allocation

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A case for end system multicast (keynote address)

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation

NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
ALMI: an application level multicast infrastructure

USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resource allocation problem and with respect to its practical use for multicast address assignment. We define a framework for the problem, introduce complexity results, and formulate several new allocation algorithms. Despite the theoretical superiority of these algorithms, our performance evaluation demonstrates that a common, prefix-based algorithm is better under a range of workloads. We conclude by illustrating the conditions under which dynamic address allocation should be used and provide insight into how to further improve the performance of prefix-based allocation.