The Multicast Rearrangeability of Banyan-type Networks
碩士 === 國立中山大學 === 應用數學系研究所 === 94 === In the thesis, we study the f-cast rearrangeability of the Banyan-type network with crosstalk constraint. Let n, j, x and c be nonnegative integers with 0leq jleq n+1, 0leq xleq n and f=2^{j}. B_{n}(x,p,c) is the Banyan-type network with, 2^{n+1} inputs, 2^{n+1}...
Main Authors: | Yun-Ruei Li, 李昀叡 |
---|---|
Other Authors: | Li-Da Tong |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/82200526072121508643 |
Similar Items
-
The Rearrangeability of Banyan-type Networks
by: Yi-Ming Huang, et al.
Published: (2005) -
Characterizing the 2d-nary Banyan-type Networks
by: Ya-Luen Wu, et al.
Published: (2009) -
Fault Diagnosis and Tolerance of Banyan Networks
by: Wen-Ting Wei, et al.
Published: (1993) -
On reducing the blocking probability of banyan networks
by: HUANG, RUO-MEI, et al.
Published: (1989) -
Nonblocking Banyan-type optical switching networks under crosstalk constraint
by: Vaez, Mohammad-Mehdi
Published: (2007)