Communications of the ACM
The Computer Journal
A note on the efficiency of an interval routing algorithm
The Computer Journal - Special issue on data structures
Prefix routing schemes in dynamic networks
Computer Networks and ISDN Systems
| Hi-index | 0.00 |
In dynamic networks, links and nodes will be deleted or added regularly. It is very essential for the routing scheme to have the ability of fault-tolerance. The method to achieve such a goal is to generate more than one path for a given set of source and destination. In this paper, the idea of interval routing are used to construct a new scheme (Multi-Node Label Interval Routing scheme, or MNLIR scheme) to realize fault-tolerance. Interval routing is a space-efficient routing method for networks, but the method is static and determinative, and itcannot realize fault-tolerance. In MNLIR scheme some nodes will have more than one label, thus some pairs of destination and source will have more than one path; the pairs of nodes, which have inheritance relation, will have the shortest path. Using this character, MNLIR scheme has better overall routing performance than the former interval routing scheme, which can be proven by simulations. The common problem concerning the insertion and deletion of nodes and links are considered in this paper. So if the networks have some changes in topology, MNLIR scheme may find alternative path for certain pairs of nodes. In this way, fault-tolerance can be realized with only a little space added tostore the multi-node labels