Skip to Main Content
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.