Advanced Search
Volume 21 Issue 2
Mar.  1999
Turn off MathJax
Article Contents
Liu Huanping, Zhu Yangong, Yang Yixian. AN ALGORITHM FOR FINDING THE SHORTEST PATH IN DOUBLE-LOOP NETWORKS[J]. Journal of Electronics & Information Technology, 1999, 21(2): 202-205.
Citation: Liu Huanping, Zhu Yangong, Yang Yixian. AN ALGORITHM FOR FINDING THE SHORTEST PATH IN DOUBLE-LOOP NETWORKS[J]. Journal of Electronics & Information Technology, 1999, 21(2): 202-205.

AN ALGORITHM FOR FINDING THE SHORTEST PATH IN DOUBLE-LOOP NETWORKS

  • Received Date: 1997-09-05
  • Rev Recd Date: 1998-03-27
  • Publish Date: 1999-03-19
  • 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.
  • loading
  • 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.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1902) PDF downloads(559) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return