<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

Strictly nonblocking f-cast Log(d)(N, m, p) networks

dc.citation.epage986en_US
dc.citation.issue5en_US
dc.citation.spage981en_US
dc.citation.volume55en_US
dc.citation.woscount8
dc.contributor.authorHwang, Frank K.en_US
dc.contributor.authorWang, Yangen_US
dc.contributor.authorTan, Jinzhien_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2014-12-08T15:14:07Z
dc.date.available2014-12-08T15:14:07Z
dc.date.issued2007-05-01en_US
dc.description.abstractNecessary and sufficient conditions for Log(d) (N, m, p) network to be point-to-point strictly nonblocking are known. Recently, Kabacinski and Danilewicz obtained necessary and sufficient conditions for the Loge (N, 0, p) network to be broadcast strictly nonblocking. In this paper, we give necessary and sufficient conditions for Log(d)(N, m, p) to be f-cast strictly nonblocking for every f, thus covering the point-to-point case (f = 1) and the broadcast case (f = N) as special cases.en_US
dc.identifier.doi10.1109/TCOMM.2007.896055en_US
dc.identifier.issn0090-6778en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMMUNICATIONSen_US
dc.identifier.urihttp://dx.doi.org/10.1109/TCOMM.2007.896055en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/10826
dc.identifier.wosnumberWOS:000246634000019
dc.language.isoen_USen_US
dc.subjectf-casten_US
dc.subjectbroadcasten_US
dc.subjectstrictly nonblockingen_US
dc.titleStrictly nonblocking f-cast Log(d)(N, m, p) networksen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
000246634000019.pdf
Size:
770.74 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: