multicast, address allocation
To support IP multicast, domains must assign a unique multicast address to each application from a limited, globally-shared address space. We examine the performance of several classes of address allocation algorithms withln the context of the MASC architecture. This study is the first of its kind to model the generalized multicast address allocation problem and consider non-contiguous allocation algorithms. We find that prefix-based allocation outperforms our non-contiguous algorithm, despite the apparent advantages of non-contiguous allocation. We also verify the benefits of using worst-fit for new allocations.
Original Publication Citation
Daniel Zappala, Chris GauthierDickey, and Virginia Lo, "Modeling the Multicast Address Allocation Problem", IEEE Globecom, Seventh Global Internet Symposium, November 22.
BYU ScholarsArchive Citation
Zappala, Daniel; GauthierDickey, Chris; and Lo, Virginia, "Modeling the Multicast Address Allocation Problem" (2002). All Faculty Publications. 526.
Physical and Mathematical Sciences
© 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