By Topic

Bounding techniques for the reliability of multistage interconnection 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
$33 $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

3 Author(s)
M. Kraetzl ; Dept. of Math. & Stat., Curtin Univ. of Technol., Perth, WA, Australia ; C. J. Colbourn ; J. S. Devitt

Multistage interconnection networks are widely used in multiprocessing environment. The authors introduce new, efficient methods for determining the lower and upper bounds on the probabilities of input-output communication in a multistage interconnection network. A novel lower bounding strategy (shifting) and a novel upper bounding strategy (averaging) are presented. They can be combined with existing methods based on coherence and on consecutive cuts, to obtain an improvement on previously known efficiently computable bounds. The applications in broadcasting and permutation capabilities of interconnection networks, are discussed

Published in:

Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on  (Volume:2 )

Date of Conference:

6-11 Sep 1993