摘要
Different loads in the network require distinct Qo S 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.
Different loads in the network require distinct Qo S 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.
基金
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)
