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

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.

Download Full-text

Optimal resource allocation strategy for two-layer complex networks

Modern Physics Letters B ◽

10.1142/s0217984918500549 ◽

2018 ◽

Vol 32 (05) ◽

pp. 1850054 ◽

Cited By ~ 2

Author(s):

Jinlong Ma ◽

Lixin Wang ◽

Sufeng Li ◽

Congwen Duan ◽

Yu Liu

Keyword(s):

Complex Networks ◽

Service Providers ◽

Network Capacity ◽

Capacity Allocation ◽

Allocation Strategy ◽

Traffic Dynamics ◽

Traffic Capacity ◽

Optimal Value ◽

Optimal Resource ◽

Resource Allocation Strategy

We study the traffic dynamics on two-layer complex networks, and focus on its delivery capacity allocation strategy to enhance traffic capacity measured by the critical value [Formula: see text]. With the limited packet-delivering capacity, we propose a delivery capacity allocation strategy which can balance the capacities of non-hub nodes and hub nodes to optimize the data flow. With the optimal value of parameter [Formula: see text], the maximal network capacity is reached because most of the nodes have shared the appropriate delivery capacity by the proposed delivery capacity allocation strategy. Our work will be beneficial to network service providers to design optimal networked traffic dynamics.

Download Full-text

An efficient routing strategy on spatial scale-free networks

International Journal of Modern Physics C ◽

10.1142/s012918311450017x ◽

2014 ◽

Vol 25 (07) ◽

pp. 1450017 ◽

Cited By ~ 8

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.

Download Full-text

ANALYSIS OF TRAFFIC FLOW ON COMPLEX NETWORKS

International Journal of Modern Physics B ◽

10.1142/s0217979211100655 ◽

2011 ◽

Vol 25 (10) ◽

pp. 1419-1428 ◽

Cited By ~ 5

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.

Download Full-text

QUEUE RESOURCE REALLOCATION STRATEGY FOR TRAFFIC SYSTEMS IN SCALE-FREE NETWORK

International Journal of Modern Physics C ◽

10.1142/s0129183113500137 ◽

2013 ◽

Vol 24 (03) ◽

pp. 1350013 ◽

Cited By ~ 19

Author(s):

SHUAI ZHANG ◽

MAN-GUI LIANG ◽

ZHONG-YUAN JIANG ◽

HUI-JIA LI

Keyword(s):

Queue Length ◽

Communication Systems ◽

Allocation Strategy ◽

Resource Reallocation ◽

Physical Constraints ◽

Scale Free ◽

Traffic Capacity ◽

Free Network ◽

Resource Allocation Strategy ◽

Traffic Systems

In real communication systems, each node has a finite queue length to store packets due to physical constraints. In this paper, we propose a queue resource allocation strategy for traffic dynamics in scale-free networks. With a finite resource of queue, the allocation of queue length on node i is based on Bi, where Biis the generalized betweenness centrality of node i. The overall traffic capacity of a network system can be evaluated by the critical packet generating rate (Rc). Through the use of the proposed queue allocation scheme for the shortest path protocol and efficient routing protocol, our strategy performs better than the uniform queue length allocation strategy, which is demonstrated by a larger value of the critical generating rate. We also give a method to estimate the network traffic capacity theoretically.

Download Full-text

AN EFFICIENT BANDWIDTH ALLOCATION STRATEGY FOR SCALE-FREE NETWORKS

International Journal of Modern Physics C ◽

10.1142/s0129183112500659 ◽

2012 ◽

Vol 23 (10) ◽

pp. 1250065 ◽

Cited By ~ 18

Author(s):

ZHONG-YUAN JIANG ◽

MAN-GUI LIANG ◽

SHUAI ZHANG ◽

SHU-JUAN WANG ◽

DONG-CHAO GUO

Keyword(s):

Bandwidth Allocation ◽

Service Providers ◽

Network Size ◽

Urban Transport ◽

Allocation Strategy ◽

Transport Networks ◽

Scale Free ◽

Traffic Capacity ◽

Optimal Value ◽

Scale Free Networks

Traffic capacity is critical for various networks and strongly depends on the distribution of link's bandwidth resources. In this paper, we propose a betweenness-based bandwidth allocation strategy in which the bandwidth of each link lij is allocated proportionally to the product (1 + Bi)α(1 + Bj)α, where α is a tunable parameter, and Bi and Bj are the betweenness of node i and node j, respectively. The optimal value of α is achieved by extensive simulations and slightly increases with the network size. Our new bandwidth allocation strategy achieves the highest traffic capacity when compared with the average bandwidth allocation strategy and the previously proposed degree-based bandwidth allocation strategy. Our work will be beneficial for network service providers to improve the traffic capacity by efficiently allocating or reallocating the overall finite link's bandwidth resources of networks such as the Internet, urban transport networks and airway networks.

Download Full-text

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

Modern Physics Letters B ◽

10.1142/s021798491750083x ◽

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.

Download Full-text

An efficient routing strategy for coupled spatial networks

Modern Physics Letters B ◽

10.1142/s0217984921505849 ◽

2021 ◽

Author(s):

Xing-Li Jing ◽

Mao-Bin Hu ◽

Cong-Ling Shi ◽

Xiang Ling

Keyword(s):

Capacity Allocation ◽

Spatial Networks ◽

Allocation Strategy ◽

Traffic Dynamics ◽

Traffic Characteristics ◽

Routing Strategy ◽

Topology Information ◽

Traffic Systems ◽

Heterogeneous Node ◽

Better Than

The study of traffic dynamics on couple networks is important for the design and management of many real systems. In this paper, an efficient routing strategy on coupled spatial networks is proposed, considering both traffic characteristics and network topology information. With the routing strategy, the traffic capacity can be greatly improved in both scenarios of identical and heterogeneous node capacity allocation. Heterogeneous allocation strategy of node delivery capacity performs better than identical capacity allocation strategy. The study can help to improve the performance of real-world multi-modal traffic systems.

Download Full-text