By Topic

Yet another result on multi-log2N networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yeonghwan Tscha ; Dept. of Comput. Sci. & Eng., Sangji Univ., Kangwon, South Korea ; Kyoon-Ha Lee

One-to-many connection (i.e., multicast) is an important communication primitive used in parallel processing and high-speed switching in order to simultaneously send data from an input to more than one output. We prove that for even (respectively, odd) n, a multi-log2N network is strictly nonblocking for a one-to-many connection traffic if it is designed by vertically stacking at least (δn)/4+1((δ/2)(n-1)+1) planes of a log2N network together, where N=2n, δ=2[n/2], and [x] denotes the greatest integer less than or equal to x. We thus give answer to the open problem and introduce yet another strictly nonblocking multicast network. The characterized network has self-routing capability, regular topology, O(2log2N+2log2(log2N)) stages, and fewer crosspoints than the Clos network for N⩾512. We then extend multi log2N multicast networks to the fanout restricted nonblocking networks. It turns out that the multi-log2N network nonblocking in a strict-sense for a one-to-one connection traffic is also wide-sense nonblocking for a multicast traffic in which the fanout of any connection does not exceed δ, provided that for even (respectively, odd) n, the fanout capability of each log2N network is restricted to stage (n/2)(((n-1)/2)+1) through n-1

Published in:

Communications, IEEE Transactions on  (Volume:47 ,  Issue: 9 )