Issue No.03 - March (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.127440
<p>A 'state model' is proposed for solving the problem of routing and rerouting messages in the inverse augmented data manipulator (IADM) network. Necessary and sufficient conditions the reroutability of messages are established using this model, and destination tag schemes are derived. These schemes are simpler, more efficient, and require less complex hardware than previously proposed routing schemes. Two destination tag schemes are proposed. A universal rerouting algorithm is constructed based on one of the schemes. It finds a blockage-free path for any combination of multiple blockages if there exists such a path, and indicates the absence of such a path if there exists none. In addition, the state model is used to derive constructively a lower bound on the number of subgraphs which are isomorphic to the indirect binary n-cube network in the IADM network. This knowledge can be used to characterize properties of the IADM networks and for permutation routing in the IADM networks.</p>
necessary and sufficient conditions; state model; IADM network; routing; inverse augmented data manipulator; reroutability; universal rerouting algorithm; lower bound; isomorphic; indirect binary n-cube network; permutation routing; fault tolerant computing; multiprocessor interconnection networks.
D. Rau, J.A.B. Fortes, H.J. Siegel, "Destination Tag Routing Techniques Based on a State Model for the IADM Network", IEEE Transactions on Computers, vol.41, no. 3, pp. 274-285, March 1992, doi:10.1109/12.127440