Destination tag routing techniques based on a state model for the IADM network

A state model is proposed for solving the problem of routing and rerouting messages in the inverse augmented data manipulator (IADM) network. Using this model, necessary and sufficient conditions for the reroutability of messages are established, and two then destination tag schemes are derived. For one of the schemes, rerouting is totally transparent to the sender of the message and any blocked line of a given type can be avoided. The spatiotemporal complexity is reduced from O(log N) (for previous techniques) to O(1). For the other scheme, rerouting is possible for any type of link blockage. A universal rerouting algorithm is constructed based on the second scheme, which finds a blockage-free path for any combination of multiple blockages if there exists such a path, and indicates absence of such a path if none exists. In addition, the state model is used to constructively derive 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