中国物理B ›› 2016, Vol. 25 ›› Issue (8): 88902-088902.doi: 10.1088/1674-1056/25/8/088902

• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇    

Optimized routing strategy for complex network with multiple priorities

Shi-Bao Li(李世宝), Zong-Xing Sun(孙宗星), Jian-Hang Liu(刘建航), Hai-Hua Chen(陈海华)   

  1. School of Computer and Communication Engineering, China University of Petroleum, Qingdao 266580, China
  • 收稿日期:2015-12-02 修回日期:2016-04-01 出版日期:2016-08-05 发布日期:2016-08-05
  • 通讯作者: Shi-Bao Li E-mail:lishibao_upc@163.com
  • 基金资助:
    Project supported by the Fundamental Research Funds for the Central University, China (Grant Nos. 24720152047A and 15CX05025A), the Natural Science Foundation of Shandong Province, China (Grant No. ZR2014FM017), the Science and Technology Development Plan of Huangdao District, Qingdao, China (Grant No. 2014-1-45).

Optimized routing strategy for complex network with multiple priorities

Shi-Bao Li(李世宝), Zong-Xing Sun(孙宗星), Jian-Hang Liu(刘建航), Hai-Hua Chen(陈海华)   

  1. School of Computer and Communication Engineering, China University of Petroleum, Qingdao 266580, China
  • Received:2015-12-02 Revised:2016-04-01 Online:2016-08-05 Published:2016-08-05
  • Contact: Shi-Bao Li E-mail:lishibao_upc@163.com
  • Supported by:
    Project supported by the Fundamental Research Funds for the Central University, China (Grant Nos. 24720152047A and 15CX05025A), the Natural Science Foundation of Shandong Province, China (Grant No. ZR2014FM017), the Science and Technology Development Plan of Huangdao District, Qingdao, China (Grant No. 2014-1-45).

RichHTML

0

PDF (PC)

299

赞

摘要： Different loads in the network require distinct QoS standard, while present routing strategies for complex networks ignored this fact. To solve this problem, we designed a routing strategy RS-MP with multiple priorities by which packets are classified into privileged-packets and common-packets. In RS-MP, privileged-packets route by the Shortest Path Algorithm, and do not need to queue up. Common-packets' routes are determined by a new factor BJmax of the network. The BJmax stands for the largest betweenness centrality. By minimizing BJmax, the throughout capacity of the network can be maximized. The simulation results show that RS-MP can guarantee privileged-packets with the shortest path length and smallest delay, and maximized throughout capacity for common packets in the no-congestion state.

关键词: complex network, optimized algorithm, routing strategy, multiple priorities

Abstract: Different loads in the network require distinct QoS standard, while present routing strategies for complex networks ignored this fact. To solve this problem, we designed a routing strategy RS-MP with multiple priorities by which packets are classified into privileged-packets and common-packets. In RS-MP, privileged-packets route by the Shortest Path Algorithm, and do not need to queue up. Common-packets' routes are determined by a new factor BJmax of the network. The BJmax stands for the largest betweenness centrality. By minimizing BJmax, the throughout capacity of the network can be maximized. The simulation results show that RS-MP can guarantee privileged-packets with the shortest path length and smallest delay, and maximized throughout capacity for common packets in the no-congestion state.

Key words: complex network, optimized algorithm, routing strategy, multiple priorities

中图分类号:  (Networks and genealogical trees)

  • 89.75.Hc
89.75.Fb (Structures and organization in complex systems)