By Topic

Address-Independent Routing for Local 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 $31
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

1 Author(s)
Franaszek, P.A. ; IBM Research Division, P.O. Box 218, Yorktown Heights, New York 10598, USA

A routing methodology is introduced which permits messages to be propagated throughout a network without recourse to destination or origin addresses. Two classes of networks, bidirectional trees and augmented rings, are analyzed from this point of view. An optimality property is proved for the bidirectional tree, and three types of address-independent routing strategies are derived. It is shown that augmented loops, a class of structures incorporating redundant links, may be rerouted to compensate for the failure of any single node or link.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:27 ,  Issue: 5 )