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

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.

scholarly journals Traffic dynamics in scale-free networks with limited packet-delivering capacity

2008 ◽  
Vol 387 (27) ◽  
pp. 6857-6862 ◽  
Author(s):  
Han-Xin Yang ◽  
Wen-Xu Wang ◽  
Zhi-Xi Wu ◽  
Bing-Hong Wang
Keyword(s):  
Traffic Dynamics ◽  
Scale Free ◽  
Scale Free Networks

Improved efficient queue resource reallocation strategy for traffic dynamics on scale-free networks

2019 ◽  
Vol 30 (08) ◽  
pp. 1950056 ◽  
Author(s):  
Jinlong Ma ◽  
Huiling Wang ◽  
Xiangyang Xu ◽  
Weizhan Han ◽  
Congwen Duan ◽  
...  
Keyword(s):  
Transportation Systems ◽  
Resource Reallocation ◽  
Traffic Dynamics ◽  
Transport Efficiency ◽  
Scale Free ◽  
Traffic Capacity ◽  
Scale Free Networks ◽  
Significant Area ◽  
Simulation Results ◽  
Node Capacity

In recent years, the transportation systems have to face the increasing challenges of congestion and inefficiency, and therefore the research on traffic dynamics of complex networks has become a significant area. When the total node capacity of the network is fixed, a reasonable queue resource reallocation strategy is effective in improving the network traffic capacity. In this paper, a new queue resource allocation method is proposed based on the betweenness centrality and the degree centrality of nodes. With the proposed strategy, the node queue length is allocated accurately to enhance the transport efficiency. Simulation results show that the proposed strategy can effectively improve the traffic capacity of the scale-free networks.

Optimal link rewiring strategy for transport efficiency on scale-free networks with limited bandwidth

2019 ◽  
Vol 31 (02) ◽  
pp. 2050033
Author(s):  
Yongqiang Zhang ◽  
Yaming Li ◽  
Yi Zhou ◽  
Jinlong Ma
Keyword(s):  
Network Topology ◽  
Path Length ◽  
Traffic Dynamics ◽  
Transport Efficiency ◽  
Scale Free ◽  
Limited Bandwidth ◽  
Traffic Loads ◽  
Traffic Capacity ◽  
Scale Free Networks ◽  
Simulation Results

The network topology structure has great impact on its traffic capacity. Most of the biological and technological networks have been proved to exhibit scale-free feature. In real networks, the hub links, which usually bear large traffic loads, have restricted transport efficiency of the complex networks. In this paper, we focus on the bandwidth congestion and propose a rewiring link strategy to optimize traffic dynamics on scale-free networks. Two link rewiring strategies are compared and the simulation results on scale-free networks show that our strategy has more advantages, which makes the degree distribution of the network more uniform, reducing the average path length of different nodes, balancing the resources of the network and increasing the traffic capacity of the network. This work will be beneficial for designing network topology and optimizing network performances.

scholarly journals A hybrid queuing strategy for network traffic on scale-free networks

2017 ◽  
Vol 31 (05) ◽  
pp. 1750083
Author(s):  
Kai-Quan Cai ◽  
Lu Yu ◽  
Yan-Bo Zhu
Keyword(s):  
Network Traffic ◽  
Queue Length ◽  
Dynamics Model ◽  
Traffic Dynamics ◽  
Scale Free ◽  
Traffic Efficiency ◽  
Scale Free Networks ◽  
Traffic Systems ◽  
First In First Out

In this paper, a hybrid queuing strategy (HQS) is proposed in traffic dynamics model on scale-free networks, where the delivery priority of packets in the queue is related to their distance to destination and the queue length of next jump. We compare the performance of the proposed HQS with that of the traditional first-in-first-out (FIFO) queuing strategy and the shortest-remaining-path-first (SRPF) queuing strategy proposed by Du et al. It is observed that the network traffic efficiency utilizing HQS with suitable value of parameter h can be further improved in the congestion state. Our work provides new insights for the understanding of the networked-traffic systems.

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

Delivering capacity allocation strategy for traffic dynamics on scale-free networks

2019 ◽  
Vol 31 (02) ◽  
pp. 2050029
Author(s):  
Jinlong Ma ◽  
Wei Sui ◽  
Changfeng Du ◽  
Xiangyang Xu ◽  
Guanghua Zhang
Keyword(s):  
Network Capacity ◽  
Capacity Allocation ◽  
Allocation Strategy ◽  
Traffic Dynamics ◽  
Shortest Path Routing ◽  
Scale Free ◽  
Optimal Value ◽  
Scale Free Networks ◽  
Resource Allocation Strategy ◽  
Traffic Systems

The traffic dynamics of complex networks are largely determined by the node’s resource distribution. In this paper, based on the shortest path routing strategy, a node delivering capacity distribution mechanism is proposed into the traffic dynamics in Barabási and Albert (BA) scale-free networks; the efficiency of the mechanism on the network capacity measured by the critical point ([Formula: see text]) of phase transition from free flow to congestion is primarily explored. Based on the proposed strategy, the total delivering capacity is reallocated according to both degree and betweenness of each node, and an optimal value of parameter [Formula: see text] is found, leading to the maximum traffic capacity. The results of numerical experiments on scale-free networks suggest that the resource allocation strategy proposed here is capable of effectively enhancing the transmission capacity of networks. Furthermore, this study may provide novel insights into research on networked traffic systems.

Sign in / Sign up

Export Citation Format

Share Document