双环网D (N, h)的最短路径选择算法
AN ALGORITHM FOR FINDING THE SHORTEST PATH IN DOUBLE-LOOP NETWORKS
-
摘要: 双环网是分布式系统常用的一种拓扑结构。它的寻径问题是人们关心的主要问题之一。本文给出了一个求双环网中任意两个节点间的最短路径算法,此算法所需时间为O(△),其中△是该网络的直径。
-
关键词:
- 双环网络; 最短路径; 算法
Abstract: Double-loop network has been one of the most populular topologies used in the distribution systwms. An important problem is to find the shortest path between any two nodes in this kind of networks. This paper gives an O(△) time algorithm for finding the shortest path between any two nodes of the double-loop network. -
Liu MT, et al. Design of the distributed double-loop computer network(DDLCN). J. Digital System, 1988, 5(1): 3-37.[2]Grnarov A, Kleinrock L, Gerla M. A highly reliable distributed loop network architecture. In Proc. of Int. Symp. Fault-Tolersnt Computing, U.S.A: 1988, 319-324.[3]Raghavendra C S, Gerla M, Avizienis A. Reliable loop topologies for local computer networks[J].IEEE Trans. on Comp.1985, C-34(1):46-54[4]Raghavendra C S, Silvester J S. A survey of multiconnected loop topologies for local computer-[5]networks. Computer Networks and ISDN Sydtems, 1986, 11(1): 29-42.[6]冯斐玲,金林钢.一类双环网的特征分析及寻径控制.计算机学报,1994, 17(11): 859-865.[7]K. Mukhopadhyaya, B.P. Sinha. Fault-tolerant routing in distributed loop network. IEEE Trans. on Comp., 1995, C-44(): 1452-1456. -
计量
- 文章访问数: 1901
- HTML全文浏览量: 122
- PDF下载量: 559
- 被引次数: 0
下载:
