Wide-sense nonblocking multicast Log(2) (N, m, p) networks
| dc.citation.epage | 1735 | en_US |
| dc.citation.issue | 10 | en_US |
| dc.citation.spage | 1730 | en_US |
| dc.citation.volume | 51 | en_US |
| dc.citation.woscount | 16 | |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.author | Lin, BC | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:40:14Z | |
| dc.date.available | 2014-12-08T15:40:14Z | |
| dc.date.issued | 2003-10-01 | en_US |
| dc.description.abstract | Recently, Tscha and Lee proposed a fixed-size window algorithm for the multicast Log(2) (N, 0, p) network and expressed a desire to see its extension to the Log(2) (N, m, p) network. Later, Kabacinski and Danilewiez 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(2) (N, 0, p) network to Log(2) (N, m, p). Note that this extension is difficult since each link in the channel graph of Log(2) (N, 0, p) has the same blocking effect, but not so in Log(2) (N, m, p). We also determine the optimal window size and optimal m. | en_US |
| dc.identifier.doi | 10.1109/TCOMM.2003.818093 | en_US |
| dc.identifier.issn | 0090-6778 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON COMMUNICATIONS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/TCOMM.2003.818093 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/27473 | |
| dc.identifier.wosnumber | WOS:000185984100016 | |
| dc.language.iso | en_US | en_US |
| dc.subject | channel graph | en_US |
| dc.subject | Log(2) (N, m, p) networks | en_US |
| dc.subject | multicast | en_US |
| dc.subject | wide-sense nonblocking (WSNB) network | en_US |
| dc.subject | window algorithm | en_US |
| dc.title | Wide-sense nonblocking multicast Log(2) (N, m, p) networks | en_US |
| dc.type | Article | en_US |