The multicast address allocation problem: theory and practice

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.

[1]  Daniel Zappala,et al.  Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation , 1999, Networked Group Communication.

[2]  Satish Kumar,et al.  The Multicast Address-Set Claim (MASC) Protocol , 2000, RFC.

[3]  D. Estrin,et al.  The MASC/BGMP architecture for inter-domain multicast routing , 1998, SIGCOMM '98.

[4]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM 1994.

[5]  John P. Hayes,et al.  Subcube Allocation in Hypercube Computers , 1991, IEEE Trans. Computers.

[6]  Dinesh C. Verma,et al.  ALMI: An Application Level Multicast Infrastructure , 2001, USITS.

[7]  David Meyer,et al.  GLOP Addressing in 233/8 , 2000, RFC.

[8]  Brad Cain,et al.  Source-Specific Multicast for IP , 2006, RFC.

[9]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[10]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[11]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[12]  Stephen Deering,et al.  Multicast routing in a datagram internetwork , 1992 .

[13]  Quentin F. Stout,et al.  Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in Hypercubes , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.

[14]  Daniel Zappala,et al.  Modeling the multicast address allocation problem , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[15]  Jörg Liebeherr,et al.  Application-layer multicast with Delaunay triangulations , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[16]  Stephen E. Deering,et al.  IP Version 6 Addressing Architecture , 1995, RFC.

[17]  Michel Dagenais,et al.  McBOOLE: A New Procedure for Exact Logic Minimization , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  Mark Handley,et al.  Session directories and scalable Internet multicast address allocation , 1998, SIGCOMM '98.

[19]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[20]  Steven McCanne,et al.  RMX: reliable multicast for heterogeneous networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  Daniel Zappala,et al.  A theoretical framework for the multicast address allocation problem , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[22]  B. Bose,et al.  A new strategy for processors allocation in an N-cube multiprocessor , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[23]  Bill Nitzberg,et al.  Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers , 1997, IEEE Trans. Parallel Distributed Syst..

[24]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..