Abstract
This paper presents a new hierarchical multicast address allocation scheme for use in interdomain multicast. Our scheme makes use of masks that are contiguous but not prefix-based to provide significant improvements in performance. Our Cyclic Block Allocation (CBA) scheme shares some similarities with both Reverse Bit Expansion and kampai, but overcomes many shortcomings associated with these earlier techniques by exploiting techniques from the area of subcube allocation for hypercubes. Through static analysis and dynamic simulations, we show that CBA has the following characteristics that make it an excellent candidate for practical use in interdomain multicast protocols: better address utilization under dynamic requests and releases than other schemes; low blocking time; efficient routing tables; addresses reflect domain hierarchy; and compatibility with MASC architecture.
Supported by NSF NCR-9714680.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Dhelaan, A., Bose, B.: A new strategy for processor allocation in an nCUBE multiprocessor. In: Proceedings of the International Phoenix Conference on Computers and Communication, March 1989, pp. 114–118 (1989)
Chen, M.-S., Shin, K.G.: Processor allocation in an n-cube multiprocessor using gray codes. IEEE Transactions on Computers, 1396–1407 (1987)
Dutt, S., Hayes, J.P.: Subcube allocation in hypercube computers. IEEE Transactions on Computers 40(3), 341–352 (1991)
Estrin, D., Govindan, R., Handley, M., Kumar, S., Radoslavov, P., Thaler, D.: The multicast address-set claim (MASC) protocol. Internet Draft of the IETF MALLOC Working Group draft-ietf-malloc-masc-01.txt (February 1999)
Estrin, D., Govindan, R., Handley, M., Thaler, D., Radoslavov, P.: MASC prefix allocation algorithm. Presentation given at MALLOC Working Group Meeting of IETF-41, Los Angeles (1998), http://netweb.usc.edu/masc/ietf-41-masc-sims.ps
Graham, N., Harary, F., Livingston, M., Stout, Q.F.: Subcube fault-tolerance in hypercubes. Information and Computation 102, 280–314 (1993)
Handley, M., Thaler, D., Estrin, D.: The internet multicast address allocation architecture. Internet Draft of the IETF MALLOC Working Group draft-ietfmalloc- arch-01 (April 1999)
Krueger, P., Lai, T.-H., Radiya, V.A.: Processor allocation vs. job scheduling on hypercube computers. In: The 11th International Conference on Distributed Computing Systems, pp. 394–401 (1991)
Kumar, S., Radoslavov, P., Thaler, D., Alaettinoglu, C., Estrin, D., Handley, M.: The MASC/BGMP Architecture for Inter-domain Multicast Routing. In: ACM SIGCOMM (October 1998)
Livingston, M., Lo, V.: A linear-time algorithm for k-cyclic subcube recognition (in preparation)
Livingston, M., Stout, Q.F.: Parallel allocation algorithms for hypercubes and meshes. In: Proceedings of the 4th Conference on Hypercube Concurrent Computers and Applications (1989)
Livingston, M., Stout, Q.: Distributing resources in hypercube computers. In: Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications (1988)
Livingston, M.L., Stout, Q.F.: Fault tolerance of the cyclic buddy subcube location scheme in hypercubes. In: The Sixth Distributed Memory Computing Conf. Proceedings (DMCC6), pp. 34–41 (1991)
Lo, V., Windisch, K.J., Liu, W., Nitzberg, B.: Noncontiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Transactions on Parallel and Distributed Systems, 712–726 (1997)
Radoslavov, P.: MascSim simulator (1999), http://catarina.usc.edu/masc
Tsuchiya, P.F.: Efficient and flexible hierarchical address allocation. In: INET 1992, June 1992, pp. 441–450 (1992)
Tzeng, N.F., Feng, G.L.: Resource allocation in cube network systems based on the covering radius. IEEE Transactions Parallel and Distributed Systems 7(4), 328–342 (1996)
Windisch, K., Lo, V., Bose, B.: Contiguous and non-contiguous processor allocation algorithms for k-ary n-cubes. In: Proceedings of the 1995 International Conference on Parallel Processing, pp. II–164–II–168 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Livingston, M., Lo, V., Windisch, K., Zappala, D. (1999). Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation. In: Rizzo, L., Fdida, S. (eds) Networked Group Communication. NGC 1999. Lecture Notes in Computer Science, vol 1736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46703-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-46703-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66782-7
Online ISBN: 978-3-540-46703-8
eBook Packages: Springer Book Archive