By Topic

Performance evaluation and modeling for dynamic routing in direct multicomputer 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

2 Author(s)
Ben-Ayed, M. ; Dept. of Electr. Eng., Rochester Univ., NY, USA ; Merriam, Charles W.

Performance evaluation and modeling of a dynamic self-routing (i.e. distributed) algorithm is presented. Each node in the network implements a message-switching dynamic-routing algorithm. Queues are not used in nodes for the purpose of routing. Instead, the algorithm maintains a flow-out=flow-in property of messages at every node on every network cycle by rerouting messages when conflicts occur. Simulation results of various network topologies indicate near-optimal performance of O(k), where k is the diameter of the particular network under consideration. The formulation of a performance model for networks using this routing algorithm yields a 2-D random-walk problem with nonstationary transition probabilities. This model results in a system of nonhomogeneous partial-difference equations which can be solved numerically using the Jacobi iterative method. Performance evaluations and modeling results indicate robustness of the dynamic self-routing algorithm for many multicomputer networks

Published in:

System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on  (Volume:i )

Date of Conference:

2-5 Jan 1990