By Topic

Traffic analysis of rectangular SW-banyan 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

2 Author(s)
R. M. Jenevein ; Texas Univ., Austin, TX, USA ; T. Mookken

An algorithm to route packets in rectangular SW-banyans is described. A packet-switching scheme is modeled on single-sided and double-sided SW-banyans. Effects of queue lengths and processor configurations on performance are studied. Prevention of deadlocks in the network is discussed. Simulation results suggest a scheme with varying queue lengths for different levels of the network to optimize performance, and that the length be limited. The algorithm presented is able to take advantage of the network traffic information stored at a node and dynamically route a packet through a shortest path which has the least load

Published in:

Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on

Date of Conference:

30 May-2 Jun 1988