[1]秦 勇,梁本来,等.多重链路网络中基于QPAS的并行算法[J].南京理工大学学报(自然科学版),2009,(05):632-637.
 QIN Yong,LIANG Ben-lai,JIA Yun-fu,et al.Parallel Algorithm Based on QPAS in Multiple Links Network[J].Journal of Nanjing University of Science and Technology,2009,(05):632-637.
点击复制

多重链路网络中基于QPAS的并行算法
分享到:

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

卷:
期数:
2009年05期
页码:
632-637
栏目:
出版日期:
2009-10-30

文章信息/Info

Title:
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
Author(s):
QIN Yong1LIANG Ben-lai12JIA Yun-fu12SONG Ji-guang12CAI Zhao-quan34
1.Center of Educational Information Technology,Maoming University,Maoming 525000,China;2.School of Computer and Software,Taiyuan University of Technology,Taiyuan 030024,China;3.Education Technology Center,Huizhou College,Huizhou 516015,China;4.Department
关键词:
路由寻优 并行路由搜索 QoS路由 网络分区 路由更新
Keywords:
route optimization parallel route searching QoS routing network divisions routing update
分类号:
TP393.02
摘要:
提出一种基于最短路径的QoS度量并行算法(QPAS)的两级并行算法。将多重链路网络按连接规则划分为若干网络分区,利用QPAS算法并行计算出每个分区内的QoS路由,并将路由结果发送给相应的分区处理器,最终由分区处理器调用最短路径并行算法计算出分区间代价最小路径。最后研究了路由更新频度。实验结果表明,基于QPAS的两级并行算法的时间复杂度更低,适用于有限节点网络的路由寻优。
Abstract:
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.

参考文献/References:

[ 1] 秦勇. 多重链路网络路由优化和负载平衡研究[ D]. 广州: 华南理工大学计算机科学与工程学院, 2007.
[ 2] 秦勇, 肖文俊,叶建锋, 等. QoS度量帕雷托并行路由快速预计算方法[ J]. 华中科技大学学报, 2009, 37( 1): 100-103.
[ 3] PitsillidesA, StylianouG. Bandwidthallocation for vir-tual paths ( BAVP), investigation of performance of classical constrainedandgenetic algorithmbase optmi -i zation techniques[ A]. Proceedings of IEEE Infocom 2000[ C]. TelAviv: The IEEE Infocom2000, 2000. 1379-1387.
[ 4] 陈国良. 并行算法的设计与分析[M]. 北京: 高等教育出版社, 2002. 433-434.
[ 5] 冯径, 周润芳, 顾冠群. 一种分类预计算QoS路由算法[ J]. 软件学报, 2002, 13( 4): 591-600.
[ 6] BernardMW. Routing ofmultipoint connections[ J]. IEEEJournal on SelectedAreas inCommunications, 1988, 6( 9): 1617-1622.

备注/Memo

备注/Memo:
基金项目: 广东省自然科学基金( 05011896);广东省高校自然科学研究项目( Z03080)
作者简介: 秦勇( 1970- ), 男,博士, 教授, 主要研究方向: 网络并行分布式处理技术与应用, E-mail: mmcqinyong @126. com。
更新日期/Last Update: 2012-11-19