| 双环网络DL（N,h）（h｜N）的最短路径算法 |
| |
| 引用本文： | 陈忠学,靳蕃.双环网络DL（N,h）（h｜N）的最短路径算法[J].西南交通大学学报,2001,36(4):444-447. |
| |
| 作者姓名： | 陈忠学 靳蕃 |
| |
| 作者单位： | 西南交通大学计算机与通信工程学院 |
| |
| 摘 要： | 对双环网络DL（N，h)（满足最大公因数g(N,h)=h)进行了分析，证明了这类双环网络中最短路径形式唯一且可用简单的数学表达来描述，给出了最短路径的公式，在此基础上，给出了一个求最短路径的简便算法，讨论了该类网络的直径等有关问题，证明了两点间的平均距离等于直径的一半。
|
| 关 键 词： | 网络拓扑学 双环网络 最短路径 网络直径 平均距离 最短路径算法 |
| 文章编号： | 0258-2724(2001)04-0444-04 |
An Algorithm for Shortest Path of Double-loop Networks DL(N,h) ( h|N) |
| |
| CHEN Zhong-xue,JIN Fan.An Algorithm for Shortest Path of Double-loop Networks DL(N,h) ( h|N)[J].Journal of Southwest Jiaotong University,2001,36(4):444-447. |
| |
| Authors: | CHEN Zhong-xue JIN Fan |
| |
| Abstract: | This paper analyzes a kind of double-loop networks DL(N, h), where the greatest common divisor is equal to h. It proves that the shortest path between any two given nodes in these networks is one and only, and can be expressed with simple mathematical equations. The equations for the shortest path are presented, and based on them a simple algorithm is proposed to find the shortest path for any pair of nodes in these networks. In addition, the diameter and other issues about this kind of networks are discussed. It is proved that the average distance between two nodes is equal to half of the diameter. |
| |
| Keywords: | network topology algorithm double-loop network shortest path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
