DocumentCode :
3322570
Title :
A theoretical framework for the multicast address allocation problem
Author :
Lo, Virginia ; Zappala, Daniel ; GauthierDickey, Chris ; Singer, Timothy
Author_Institution :
Dept. of Comput. Sci., Oregon Univ., Eugene, OR, USA
Volume :
3
fYear :
2002
fDate :
17-21 Nov. 2002
Firstpage :
2108
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.
Keywords :
Internet; multicast communication; telecommunication network routing; Internet; allocation algorithms; complexity results; globally shared space; hypercube model; multicast address allocation problem; subcube allocation; Computer science; Delay; Hypercubes; Memory management; Multicast algorithms; Multicast protocols; Polynomials; Resource management; Telephony; Web and internet services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE
Print_ISBN :
0-7803-7632-3
Type :
conf
DOI :
10.1109/GLOCOM.2002.1189004
Filename :
1189004
Link To Document :
بازگشت