Close category search window
 

Efficient routing and conflict resolution in F and IADM 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

3 Author(s)
Anand, K.C. ; Comput. Syst. & Commun. Group, Tata Inst. of Fundamental Res., Bombay, India ; Agrawal, D.P. ; Kini, N.M.

The paper introduces a novel routing technique and a way to realize passable permutations in F and IADM redundant multistage interconnection networks. The simplicity of selecting alternate routes for a given source-destination pair is demonstrated by two examples. The concept of cycles is introduced and is used to develop an algorithm to realize conflict free permutations in these networks

Published in:
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference: 9-13 Dec 1990

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.