JOURNAL ARTICLE

Strictly Nonblocking $f$-Cast Log$_{d}(N,m,p)$ Networks

Frank K. HwangYang WangJinzhi Tan

Year: 2007 Journal:   IEEE Transactions on Communications Vol: 55 (5)Pages: 981-986   Publisher: IEEE Communications Society

Abstract

Necessary 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 Log 2 (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

Keywords:
Point (geometry) Combinatorics Discrete mathematics Binary logarithm Computer science Mathematics Geometry

Metrics

14
Cited By
2.89
FWCI (Field Weighted Citation Impact)
8
Refs
0.90
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Log/sub 2/ (N, m, p) strictly nonblocking networks

D.J. ShyyChin‐Tau Lea

Journal:   IEEE Transactions on Communications Year: 1991 Vol: 39 (10)Pages: 1502-1510
JOURNAL ARTICLE

Strictly Nonblocking $f$-Cast Photonic Networks

Xiaohong JiangAchille PattavinaSusumu Horiguchi

Journal:   IEEE/ACM Transactions on Networking Year: 2008 Vol: 16 (3)Pages: 732-745
JOURNAL ARTICLE

Choosing the best log/sub k/(N, m, P) strictly nonblocking networks

F. K. Hwang

Journal:   IEEE Transactions on Communications Year: 1998 Vol: 46 (4)Pages: 454-455
JOURNAL ARTICLE

Rearrangeable nonblocking Log/sub 2d/ (N, m, p) networks

D.J. ShyyChin‐Tau Lea

Journal:   IEEE Transactions on Communications Year: 1994 Vol: 42 (5)Pages: 2084-2086
© 2026 ScienceGate Book Chapters — All rights reserved.