Traffic dynamics based on a traffic awareness routing strategy on scale-free networks

2008 ◽  
Vol 387 (12) ◽  
pp. 3001-3007 ◽  
Author(s):  
Dan Wang ◽  
Yuanwei Jing ◽  
Siying Zhang
Keyword(s):  
Traffic Dynamics ◽  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks ◽  
Traffic Awareness

ANALYSIS OF TRAFFIC FLOW ON COMPLEX NETWORKS

2011 ◽  
Vol 25 (10) ◽  
pp. 1419-1428 ◽  
Author(s):  
KUN LI ◽  
XIAOFENG GONG ◽  
SHUGUANG GUAN ◽  
C.-H. LAI
Keyword(s):  
Complex Networks ◽  
Network Capacity ◽  
Traffic Load ◽  
Packet Routing ◽  
Traffic Dynamics ◽  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks ◽  
New Strategy ◽  
Mixed Networks

We propose a new routing strategy for controlling packet routing on complex networks. The delivery capability of each node is adopted as a piece of local information to be integrated with the load traffic dynamics to weight the next route. The efficiency of transport on complex network is measured by the network capacity, which is enhanced by distributing the traffic load over the whole network while nodes with high handling ability bear relative heavier traffic burden. By avoiding the packets through hubs and selecting next routes optimally, most travel times become shorter. The simulation results show that the new strategy is not only effective for scale-free networks but also for mixed networks in realistic networks.

Traffic dynamics based on an efficient routing strategy on scale free networks

2006 ◽  
Vol 49 (2) ◽  
pp. 205-211 ◽  
Author(s):  
C.-Y. Yin ◽  
B.-H. Wang ◽  
W.-X. Wang ◽  
G. Yan ◽  
H.-J. Yang
Keyword(s):  
Traffic Dynamics ◽  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks

scholarly journals Effective gravitation path routing strategy on scale-free networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jinlong Ma ◽  
Junfeng Zhang ◽  
Yongqiang Zhang
Keyword(s):  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks

Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network

2009 ◽  
pp. 733-738
Author(s):  
Mao-Bin Hu ◽  
Yong-Hong Wu ◽  
Rui Jiang ◽  
Qing-Song Wu ◽  
Wen-Xu Wang
Keyword(s):  
Scale Free Network ◽  
Traffic Dynamics ◽  
Scale Free ◽  
Routing Strategy ◽  
Free Network ◽  
Local Routing

scholarly journals Traffic Dynamics in Scale-Free Networks

Complexus ◽  
2006 ◽  
Vol 3 (1-3) ◽  
pp. 97-107 ◽  
Author(s):  
Attila Fekete ◽  
Gábor Vattay ◽  
Ljupco Kocarev
Keyword(s):  
Traffic Dynamics ◽  
Scale Free ◽  
Scale Free Networks

scholarly journals Distance-Based Routing Strategy for Traffic Transport in Spatial Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-12
Author(s):  
Wei Huang ◽  
Xiang Pan ◽  
Xi Yang ◽  
Jianhua Zhang
Keyword(s):  
Spatial Scale ◽  
Large Scale ◽  
Spatial Information ◽  
Good Choice ◽  
Spatial Distance ◽  
Greedy Routing ◽  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks ◽  
Large Scale Networks

It is well known that routing strategies based on global topological information is not a good choice for the enhancement of traffic throughput in large-scale networks due to the heavy communication cost. On the contrary, acquiring spatial information, such as spatial distances among nodes, is more feasible. In this paper, we propose a novel distance-based routing strategy in spatial scale-free networks, called LDistance strategy. The probability of establishing links among nodes obeys the power-law in the spatial network under study. Compared with the LDegree strategy (Wang et al., 2006) and the mixed strategy (a strategy combining both greedy routing strategy and random routing strategy), results show that our proposed LDistance strategy can further enhance traffic capacity. Besides, the LDistance strategy can also achieve a much shorter delivering time than the LDegree strategy. Analyses reveal that the superiority of our strategy is mainly due to the interdependent relationship between topological and spatial characteristics in spatial scale-free networks. Furthermore, along transporting path in the LDistance strategy, the spatial distance to destination decays more rapidly, and the degrees of routers are higher than those in the LDegree strategy.

An efficient routing strategy on spatial scale-free networks

2014 ◽  
Vol 25 (07) ◽  
pp. 1450017 ◽  
Author(s):  
Xiang-Min Guan ◽  
Xue-Jun Zhang ◽  
Yanbo Zhu ◽  
Inseok Hwang ◽  
Deng-Feng Sun
Keyword(s):  
Spatial Scale ◽  
Euclidean Distance ◽  
Network Capacity ◽  
Traffic Load ◽  
System Throughput ◽  
Traffic Dynamics ◽  
Space Factor ◽  
Scale Free ◽  
Routing Strategy ◽  
Traffic Systems

Traffic dynamics has drawn much more attention recently, but most current research barely considers the space factor, which is of critical importance in many real traffic systems. In this paper, we focus our research on traffic dynamics of a spatial scale-free network with the restriction of bandwidth proportional to link Euclidean distance, and a new routing strategy is proposed with consideration of both Euclidean distance and betweenness centralities (BC) of edges. It is found that compared with the shortest distance path (SDP) strategy and the minimum betweenness centralities (MBC) of links strategy, our strategy under some parameters can effectively balance the traffic load and avoid excessive traveling distance which can improve the spatial network capacity and some system behaviors reflecting transportation efficiency, such as average packets traveling time, average packets waiting time and system throughput, traffic load and so on. Besides, though the restriction of bandwidth can trigger congestion, the proposed routing strategy always has the best performance no matter what bandwidth becomes. These results can provide insights for research on real networked traffic systems.

Sign in / Sign up

Export Citation Format

Share Document