Abstract
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 is 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 it cannot 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 is 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 to store the multi-node labels.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Quaterman J S, Hoskins J C. Notable computer networks.Communications of the ACM, Oct., 1986, 29: 932–971.
Hamner M C, Samsen G R. Source routing bridge implementation.IEEE Network Magzine, 1988, 2: 10–15.
Santoro N, Khatib R. Labeling and implicit routing in networks.The Computer Journal, Feb., 1985, 28: 5–8.
Tse S S H, Lau F C M. More on the efficiency of interval routing.The Computer Journal, 1998, 41: 238–242.
May M D, Thompson P W. Transputers and Routers: Components for Concurrent Machines, Networks, Routers and Transputers. Function Performance and Applications. Inmos Limited IOS Press, 1993.
Van Leeuwen J, Tan R B. Interval routing.The Computer Journal, Aug., 1987, 30: 298–307.
Ružička P. A note on the efficiency of an interval routing algorithm.The Computer Journal, 1991, 34: 475–476.
Tse S S H, Lau F C M. A lower bound for interval routing in general networks.Networks, 1997, 29: 49–53.
Tse S S H, Lau F C M. Lower bounds for multi-label interval routing. InProceedings of 2nd Annual International Colloquium on Structure Information and Communication Complexity, Kirousis L Informatics Series 2, 1996, pp.123–134.
Bakker E M, van Leeuwen J, Tan R B. Prefix routing scheme in dynamic network.Computer Networks and ISDN Systems, 1993, 26: 403–421.
Evangelos Krannakis, Dannh Krizanc, Ravi S S. On multi-label linear interval routing schemes.The Computer Journal, 1996, 39: 133–139.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China (No.69896250).
FENG Xiushan received his M.S. degree in computer science from the Institute of Computing Technology, CAS in 2000. He is a student member of IEEE, and now in his first year of graduate student in the Department of Computer Science at UBC, Canada. His research interests include parallel computing, distributed systems and networks, and DSP high performance computing.
HAN Chengde is a professor and Ph.D. supervisor of Institute of Computing Technology, The Chinese Academy of Sciences. His research interests include high performance computing and DSP systems.
Rights and permissions
About this article
Cite this article
Feng, X., Han, C. A fault-tolerant routing scheme in dynamic networks. J. Comput. Sci. & Technol. 16, 371–380 (2001). https://doi.org/10.1007/BF02948985
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948985