| 基于无连接传输模式的选路算法 |
| |
| 引用本文： | 刘军,刘畅,张昕.基于无连接传输模式的选路算法[J].通信技术,2010,43(1):134-136,139. |
| |
| 作者姓名： | 刘军 刘畅 张昕 |
| |
| 作者单位： | 1. 中国人民公安大学,北京,100038
2. 北京交通大学,北京,100044 |
| |
| 摘 要： | 文中借鉴通信中面向无连接传输模式的思路，构建了一个求解最佳路径的虚拟网络，使信息在虚拟网络中交互，自动探索最佳路径。并详细描述了虚拟网络的结构，给出了通信网和公交网两个求解实例。最后，通过计算复杂度分析，用文中所述算法与通用的Dijkstra算法进行比较，验证算法的计算速度。
|
| 关 键 词： | 最佳路径 面向无连接 Dijkstra算法 |
Algorithm for Optimal Routes Selection Based on Connectionless Transfer Mode |
| |
| LIU Jun,LIU Chang,ZHANG Xin.Algorithm for Optimal Routes Selection Based on Connectionless Transfer Mode[J].Communications Technology,2010,43(1):134-136,139. |
| |
| Authors: | LIU Jun LIU Chang ZHANG Xin |
| |
| Institution: | 1 Chinese People＇ s Public Security University, Beijing 100038, China; 2 Beijing Jiaotong University, Beijing 100044, China) |
| |
| Abstract: | With connectionless transfer mode in communications as a reference,a virtual network is constructed,through which the message is transferred and could automatically search the optimal routes.This paper describes in detail the structure of virtual network,and gives two practical examples of communication network and public transport network.Finally,based on complexity analysis,the comparison of this algorithm with the Dijkstra algorithm is made,and the computing speed of this algorithm is verified. |
| |
| Keywords: | optimal routes connectionless-oriented Dijkstra algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
