Congestion control strategy on complex network with privilege traffic

被引:4
作者
Li, Shi-Bao [1 ]
He, Ya [1 ]
Liu, Jian-Hang [1 ]
Zhang, Zhi-Gang [1 ]
Huang, Jun-Wei [1 ]
机构
[1] China Univ Petr East China, Coll Comp & Commun Engn, Qingdao 266580, Shandong, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2017年 / 28卷 / 09期
基金
中国国家自然科学基金;
关键词
Complex networks; congestion control; privilege traffic; privilege grade; SCALE-FREE NETWORKS; ROUTING STRATEGY; EFFICIENT; DYNAMICS; TRANSPORT; FLOW;
D O I
10.1142/S0129183117501170
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The congestion control of traffic is one of the most important studies in complex networks. In the previous congestion algorithms, all the network traffic is assumed to have the same priority, and the privilege of traffic is ignored. In this paper, a privilege and common traffic congestion control routing strategy (PCR) based on the different priority of traffic is proposed, which can be devised to cope with the different traffic congestion situations. We introduce the concept of privilege traffic in traffic dynamics for the first time and construct a new traffic model which taking into account requirements with different priorities. Besides, a new factor is introduced by the theoretical derivation to characterize the interaction between different traffic routing selection, furthermore, IL, is related to the network throughput. Since the joint optimization among different kinds of traffic is accomplished by PCR, the maximum value of U-i can be significantly reduced and the network performance can be improved observably. The simulation results indicate that the network throughput with PCR has a better performance than the other strategies. Moreover, the network capacity is improved by 25% at least. Additionally, the network throughput is also influenced by privilege traffic number and traffic priority.
引用
收藏
页数:15
相关论文
共 41 条
[1]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[2]   Optimization of transport protocols in complex networks [J].
Chen, Long ;
Chen, Jiancong ;
Guan, Zhi-Hong ;
Zhang, Xian-He ;
Zhang, Ding-Xue .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (11) :3336-3341
[3]   Transport optimization on complex networks [J].
Danila, Bogdan ;
Yu, Yong ;
Marsh, John A. ;
Bassler, Kevin E. .
CHAOS, 2007, 17 (02)
[4]   Optimal transport on complex networks [J].
Danila, Bogdan ;
Yu, Yong ;
Marsh, John A. ;
Bassler, Kevin E. .
PHYSICAL REVIEW E, 2006, 74 (04)
[5]   Effective usage of shortest paths promotes transportation efficiency on scale-free networks [J].
Du, Wen-Bo ;
Wu, Zhi-Xi ;
Cai, Kai-Quan .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (17) :3505-3512
[6]  
Echenique P, 2004, PHYS REV E, V70, DOI 10.1103/PhysRevE.70.056105
[7]   Dynamics of jamming transitions in complex networks [J].
Echenique, P ;
Gómez-Gardeñes, J ;
Moreno, Y .
EUROPHYSICS LETTERS, 2005, 71 (02) :325-331
[8]   Universal behavior of load distribution in scale-free networks [J].
Goh, KI ;
Kahng, B ;
Kim, D .
PHYSICAL REVIEW LETTERS, 2001, 87 (27) :278701-278701
[9]   A tree-like complex network model [J].
Gu, Yuying ;
Sun, Jitao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2010, 389 (01) :171-178
[10]   Routing in scale-free networks based on expanding betweenness centrality [J].
Guan, Zhi-Hong ;
Chen, Long ;
Qian, Tong-Hui .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2011, 390 (06) :1131-1138