Keywords
multicast, address allocation
Abstract
The multicast address allocation problem requires Internet domains to allocate unique addresses to multicast applications from a globally-shared space. We develop a theoretical framework for multicast allocation algorithms that is influenced by subcube allocation in hypercube computer systems. Based on this framework we derive complexity results for the address allocation problem and describe several new allocation algorithms that use a hypercube model for address representation.
Original Publication Citation
Virginia Lo, Daniel Zappala, Chris GauthierDickey, and Tim Singer, "A Theoretical Framework for the Multicast Address Allocation Problem", IEEE Globecom, Seventh Global Internet Symposium, November 22.
BYU ScholarsArchive Citation
Zappala, Daniel; GauthierDickey, Chris; Lo, Virginia; and Singer, Timothy, "A Theoretical Framework for the Multicast Address Allocation Problem" (2002). Faculty Publications. 527.
https://scholarsarchive.byu.edu/facpub/527
Document Type
Peer-Reviewed Article
Publication Date
2002-11-01
Permanent URL
http://hdl.lib.byu.edu/1877/2567
Publisher
IEEE
Language
English
College
Physical and Mathematical Sciences
Department
Computer Science
Copyright Status
© 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information
http://lib.byu.edu/about/copyright/