雙環(huán)網D (N, h)的最短路徑選擇算法
AN ALGORITHM FOR FINDING THE SHORTEST PATH IN DOUBLE-LOOP NETWORKS
-
摘要: 雙環(huán)網是分布式系統(tǒng)常用的一種拓撲結構。它的尋徑問題是人們關心的主要問題之一。本文給出了一個求雙環(huán)網中任意兩個節(jié)點間的最短路徑算法,此算法所需時間為O(△),其中△是該網絡的直徑。
-
關鍵詞:
- 雙環(huán)網絡; 最短路徑; 算法
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]馮斐玲,金林鋼.一類雙環(huán)網的特征分析及尋徑控制.計算機學報,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. -
計量
- 文章訪問數(shù): 1925
- HTML全文瀏覽量: 131
- PDF下載量: 562
- 被引次數(shù): 0
下載:
