|Table of Contents|

Parallel Algorithm Based on QPAS in Multiple Links Network

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

Issue:
2009年05期
Page:
632-637
Research Field:
Publishing date:

Info

Title:
Parallel Algorithm Based on QPAS in Multiple Links Network
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
Keywords:
route optimization parallel route searching QoS routing network divisions routing update
PACS:
TP393.02
DOI:
-
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:
-
Last Update: 2012-11-19