多重链路网络中基于QPAS的并行算法  

Parallel Algorithm Based on QPAS in Multiple Links Network

作　　者：秦勇[1] 梁本来[1,2] 贾云富[1,2] 宋继光[1,2] 蔡昭权[3,4] 

机构地区：[1]茂名学院信息与网络中心,广东茂名525000 [2]太原理工大学计算机与软件学院,山西太原030024 [3]惠州学院教育技术中心,广东惠州516015 [4]清华大学计算机科学与技术系,北京100084

出　　处：《南京理工大学学报》2009年第5期632-637,共6页Journal of Nanjing University of Science and Technology

基　　金：广东省自然科学基金(05011896);广东省高校自然科学研究项目(Z03080)

摘　　要：提出一种基于最短路径的QoS度量并行算法(QPAS)的两级并行算法。将多重链路网络按连接规则划分为若干网络分区,利用QPAS算法并行计算出每个分区内的QoS路由,并将路由结果发送给相应的分区处理器,最终由分区处理器调用最短路径并行算法计算出分区间代价最小路径。最后研究了路由更新频度。实验结果表明,基于QPAS的两级并行算法的时间复杂度更低,适用于有限节点网络的路由寻优。A two-level parallel algorithm based on QPAS （QoS metrics parallel algorithm based on shortest path） is provided. A multiple links network is divided into several divisions according to connection rules. The QoS （ Quality of Service） route of each division is worked out by parallel computing based on the QPAS algorithm and the route result is sent to the corresponding division processor. The minimal price path is worked out by the shortest path parallel algorithm by division processors. Routing update frequency is researched. Experimental results show the time complexity of the two-level parallel algorithm based on QPAS is lower, which can be used for route optimization of limited node networks.

关 键 词：路由寻优 并行路由搜索 QOS路由 网络分区 路由更新 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]