Multirate Nonblocking Multicast Log2(N, m, p) Networks

被引：2
|
作者：
Lin, Bey-Chi [1 ]
Lea, Chin-Tau [1 ]
机构：
[1] Natl Cent Univ, Dept Math, Chungli 32054, Taiwan
来源：
NETWORKS | 2008年 / 52卷 / 04期
关键词：
Log(2) (N; m; p); networks; multirate; multicast; wide-sense nonblocking (WSNB) network; window algorithm;
D O I：
10.1002/net.20246
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study necessary and sufficient conditions for multirate, multicast, and wide-sense nonblocking (WSNB) log(2)(N, m, p) networks. We show necessary and sufficient conditions for different values of m. The results allow us to find a speedup requirement in the network for a given traffic load. We also present a sufficient condition for making the network nonblocking when a limit is imposed on the multicast group size. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 52(4),277-286 2008
引用
收藏
页码：277 / 286
页数：10
相关论文
共 50 条
  • [21] On Nonblocking Multirate Multicast Fat-tree Data Center Networks with Server Redundancy
    Guo, Zhiyang
    Yang, Yuanyuan
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2012, : 1034 - 1044
  • [22] ON THE REARRANGEABILITY OF 2(LOG2 N) - 1 STAGE PERMUTATION NETWORKS.
    Le, Kyungsook Yoon
    IEEE Transactions on Computers, 1985, C-34 (05) : 412 - 425
  • [23] Wide-sense and strict-sense nonblocking operation of multicast multi-log2 N switching networks
    Kabacinski, W
    Danilewicz, G
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (06) : 1025 - 1036
  • [24] AN O(N LOG2 N) ALGORITHM FOR MAXIMUM FLOW IN UNDIRECTED PLANAR NETWORKS
    HASSIN, R
    JOHNSON, DB
    SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 612 - 624
  • [25] Wide-sense nonblocking logd(N, 0, p) multicast switching networks
    Danilewicz, Grzegorz
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (11) : 2193 - 2200
  • [26] Solving the Boltzmann equation in N log2 N
    Filbet, Francis
    Mouhot, Clement
    Pareschi, Lorenzo
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2006, 28 (03): : 1029 - 1053
  • [27] Choosing the best logk(N,m,P) strictly nonblocking networks
    Hwang, FK
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (04) : 454 - 455
  • [28] REARRANGEABLE NONBLOCKING CONDITION FOR MULTI-LOG2 N MULTICONNECTION NETWORKS
    TSCHA, YW
    CHOI, YH
    LEE, KH
    INFORMATION PROCESSING LETTERS, 1993, 48 (03) : 107 - 112
  • [29] An O(n log2 n) algorithm for a sink location problem in dynamic tree networks
    Mamada, S
    Uno, T
    Makino, K
    Fujishige, S
    EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS, 2004, 155 : 251 - 264
  • [30] Expected Linear Time Sorting for Word Size Ω(log2 n log log n)
    Belazzougui, Djamal
    Brodal, Gerth Stolting
    Nielsen, Jesper Sindahl
    ALGORITHM THEORY - SWAT 2014, 2014, 8503 : 26 - +
12345