Wide-sense nonblocking multicast Log/sub 2/(N,m,p) networks

Recently, Tscha and Lee proposed a fixed-size window algorithm for the multicast Log/sub 2/(N,0,p) network and expressed a desire to see its extension to the Log/sub 2/(N,m,p) network. Later, Kabacinski and Danilewicz generalized the fixed-size window to variable size to improve the results. In this...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 51; no. 10; pp. 1730 - 1735
Main Authors Hwang, F.K., Bey-Chi Lin
Format Journal Article
LanguageEnglish
Published IEEE 01.10.2003
Subjects
Algorithm design and analysis
Binary sequences
Communications Society
Mathematics
Mirrors
Multicast algorithms
Routing
Stacking
Switching systems
Online AccessGet full text

Cover

More Information
Summary:Recently, Tscha and Lee proposed a fixed-size window algorithm for the multicast Log/sub 2/(N,0,p) network and expressed a desire to see its extension to the Log/sub 2/(N,m,p) network. Later, Kabacinski and Danilewicz generalized the fixed-size window to variable size to improve the results. In this paper, we further extend the variable-size results from the Log/sub 2/(N,0,p) network to Log/sub 2/(N,m,p). Note that this extension is difficult since each link in the channel graph of Log/sub 2/(N,0,p) has the same blocking effect, but not so in Log/sub 2/(N,m,p). We also determine the optimal window size and optimal m.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2003.818093