Optimum Index Assignment Algorithm for Swap Explicit Path Routing
Original Publication Date: 1980-Dec-01
Included in the Prior Art Database: 2005-Feb-14
This article relates to an algorithm for assigning swap routing indexes for a network to which end nodes may be dynamically added. The algorithm enhances the capabilities of a prior-used protocol for end node addition.