期刊文献+

A Fault-Tolerant Routing Scheme in Dynamic Networks

A Fault-Tolerant Routing Scheme in Dynamic Networks
原文传递
导出
摘要 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 faulttolerance. 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. 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 faulttolerance. 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.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2001年第4期371-380,共10页 计算机科学技术学报(英文版)
基金 the National Natural Science Foundation of China (No.69896250).
关键词 MNLIR scheme fault-tolerant routing scheme dynamic network interval routing MNLIR scheme, fault-tolerant routing scheme, dynamic network, interval routing
  • 相关文献

参考文献5

  • 1Tse S S H,Computer J,1998年,41卷,238页
  • 2Tse S S H,Networks,1997年,29卷,49页
  • 3Tse S S H,Proceedings of 2nd Annual Int Colloquium on Structure Information and Communication Complexity Olymp,1996年,123页
  • 4Bakker E M,Computer Network ISDN Systems,1993年,26卷,403页
  • 5Van Leeuwen J,Computer J,1987年,30卷,298页

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部