On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out
نویسندگان
چکیده
For the multicast rearrangeable 3-stage Clos networks where input crossbars do not have fan-out capability, Kirkpatrick, Klawe, and Pippenger gave a sufficient condition and also a necessary condition which differs from the sufficient condition by a factor of 2. In this paper, we first tighten their conditions. Then we propose a new necessary condition based on the affine plane such that the necessary condition matches the sufficient condition for an infinite class of 3-stage Clos networks.
منابع مشابه
Rearrangeable f-cast multi-log2 N networks
Multi-log2 N networks (or vertically stacked banyan networks) have been an attractive class of switching networks due to their small depth O(log N), absolute signal loss uniformity and good fault tolerance property. Recently, F.K.Hwang extended the study of multi-log2 N networks to the generalf -cast case, which covers the unicast case (f = 1) and multicast case (f = N) as special cases, and de...
متن کاملStrictly nonblocking three-stage Clos networks with some rearrangeable multicast capability
Hwang and Lin introduced a new nonblocking requirement for 2-cast traffic which imposes different requirements on different types of coexisting calls. The requirement is strictly nonblocking for point-to-point calls among the 2-cast traffic, and is rearrangeable for genuine 2-cast calls. We generalize the 2-cast calls to multicast calls and give a sufficient condition for such networks when the...
متن کاملA new routing algorithm for multirate rearrangeable Clos networks
In this paper, we study the problem of finding routing algorithms on the multirate rearrangeable Clos networks which use as few number of middle-stage switches as possible. We propose a new routing algorithm called the “grouping algorithm”. This is a simple algorithm which uses fewer middle-stage switches than all known strategies, given that the number of input-stage switches and output-stage ...
متن کاملClos-knockout: a Large-scale Modular Multicast Atm Switch
A large-scale modular multicast ATM switch based on a three-stage Clos network architecture is proposed and its performance is studied in this paper. The complexity of our proposed switch is N p N if the switch size is N N. The rst stage of the proposed multicast switch consists of n sorting modules, where n = p N. Each sorting module has n inputs and n outputs and is responsible for traac dist...
متن کاملOn Rearrangeability of Multirate Clos Networks
Chung and Ross [SIAM J. Comput., 20 (1991), pp. 726–736] conjectured that the multirate three-stage Clos network C(n, 2n− 1, r) is rearrangeable in the general discrete bandwidth case; i.e., each connection has a weight chosen from a given finite set {p1, p2, . . . , pk} where 1 ≥ p1 > p2 > · · · > pk > 0 and pi is an integer multiple of pk, denoted by pk | pi, for 1 ≤ i ≤ k − 1. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2006