Cart (Loading....) | Create Account
Close category search window

Wide-sense nonblocking Clos networks under packing strategy

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)
Yuanyuan Yang ; Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA ; Jianchao Wang

In this paper, we study wide-sense nonblocking conditions under packing strategy for the three-stage Clos network, or υ(m, n, r) network. Wide-sense nonblocking networks are generally believed to have lower network cost than strictly nonblocking networks. However, the analysis for the wide-sense nonblocking conditions is usually more difficult. Moore proved that a υ(m, n, 2) network is nonblocking under packing strategy if the number of middle stage switches m⩾[3/2n]. This result has been widely cited in the literature, and is even considered as the wide-sense nonblocking condition under packing strategy for the general υ(m, n, r) networks in some papers. In fact, it is still not known that whether the condition m⩾[3/2n] holds for υ(m, n, r) networks when r⩾3. In this paper, we introduce a systematic approach to the analysis of wide-sense nonblocking conditions for general υ(m, n, r) networks with any r value. We first translate the problem of finding the nonblocking condition under packing strategy for a υ(m, n, r) network to a set of linear programming problems. We then solve this special type of linear programming problems and obtain a closed form optimum solution. We prove that the necessary condition for a υ(m, n, r) network to be nonblocking under packing strategy is m⩾[(2-1/F2r-1)n] where F2r-1 is the Fibonacci number. In the case of n⩽F 2r-1, this condition is also a sufficient nonblocking condition for packing strategy. We believe that the systematic approach developed in this paper can be used for analyzing other wide-sense nonblocking control strategies as well

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 3 )

Date of Publication:

Mar 1999

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.