Optimal resource allocation strategy for two-layer complex networks

2018 ◽  
Vol 32 (05) ◽  
pp. 1850054 ◽  
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.

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.

AN EFFICIENT BANDWIDTH ALLOCATION STRATEGY FOR SCALE-FREE NETWORKS

2012 ◽  
Vol 23 (10) ◽  
pp. 1250065 ◽  
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.

Improved efficient routing strategy on two-layer complex networks

2016 ◽  
Vol 27 (04) ◽  
pp. 1650044 ◽  
Author(s):  
Jinlong Ma ◽  
Weizhan Han ◽  
Qing Guo ◽  
Shuai Zhang ◽  
Junfang Wang ◽  
...  
Keyword(s):  
Complex Networks ◽  
Research Topic ◽  
Global Awareness ◽  
Traffic Dynamics ◽  
Shortest Path Routing ◽  
Transport Efficiency ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Traffic Performance ◽  
Simulation Results

The traffic dynamics of multi-layer networks has become a hot research topic since many networks are comprised of two or more layers of subnetworks. Due to its low traffic capacity, the traditional shortest path routing (SPR) protocol is susceptible to congestion on two-layer complex networks. In this paper, we propose an efficient routing strategy named improved global awareness routing (IGAR) strategy which is based on the betweenness centrality of nodes in the two layers. With the proposed strategy, the routing paths can bypass hub nodes of both layers to enhance the transport efficiency. Simulation results show that the IGAR strategy can bring much better traffic capacity than the SPR and the global awareness routing (GAR) strategies. Because of the significantly improved traffic performance, this study is helpful to alleviate congestion of the two-layer complex networks.

Traffic dynamics on two-layer multiplex networks with limited queue resource

2019 ◽  
Vol 33 (26) ◽  
pp. 1950312
Author(s):  
Jinlong Ma ◽  
Huiling Wang ◽  
Hao Ren ◽  
Xiangyang Xu ◽  
Dongwen Zhang ◽  
...  
Keyword(s):  
Queue Length ◽  
World Systems ◽  
Allocation Strategy ◽  
Traffic Dynamics ◽  
Transport Efficiency ◽  
Physical Layers ◽  
Multiplex Networks ◽  
Structure And Dynamics ◽  
Traffic Capacity ◽  
High Degree

Modeling multiple complex systems as multiplex networks has refreshed our opinions about the structure and dynamics of assorted real-world systems. By studying the traffic dynamics of two-layer multiplex networks, it can be found that the limited buffer queue length of each node in both the logical and physical layers is one of the factors that restrict the whole network traffic capacity. Since high degree nodes in the network may bear heavier load, it is necessary to allocate a larger buffer queue to them. In order to enhance the transport efficiency, a new queue allocation strategy is proposed to alleviate the congestion of the two-layer multiplex networks. By extensive computer simulations, the proposed strategy can effectively improve the traffic capacity of the multiplex 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.

An efficient routing strategy for traffic dynamics on two-layer complex networks

2018 ◽  
Vol 32 (13) ◽  
pp. 1850155 ◽  
Author(s):  
Jinlong Ma ◽  
Huiling Wang ◽  
Zhuxi Zhang ◽  
Yi Zhang ◽  
Congwen Duan ◽  
...  
Keyword(s):  
Complex Networks ◽  
Traffic Congestion ◽  
Physical Layer ◽  
Traffic Load ◽  
Global Awareness ◽  
Traffic Dynamics ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Optimal Paths ◽  
Traffic Capacity

In order to alleviate traffic congestion on multilayer networks, designing an efficient routing strategy is one of the most important ways. In this paper, a novel routing strategy is proposed to reduce traffic congestion on two-layer networks. In the proposed strategy, the optimal paths in the physical layer are chosen by comprehensively considering the roles of nodes’ degrees of the two layers. Both numerical and analytical results indicate that our routing strategy can reasonably redistribute the traffic load of the physical layer, and thus the traffic capacity of two-layer complex networks are significantly enhanced compared with the shortest path routing (SPR) and the global awareness routing (GAR) strategies. This study may shed some light on the optimization of networked traffic dynamics.

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

2013 ◽  
Vol 24 (03) ◽  
pp. 1350013 ◽  
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.

An efficient resource allocation strategy for multilayer networks

2021 ◽  
Vol 35 (05) ◽  
pp. 2150073
Author(s):  
Yongqiang Zhang ◽  
Yaming Li ◽  
Min Li ◽  
Jinlong Ma ◽  
Zhaohui Qi
Keyword(s):  
Resource Allocation ◽  
Utilization Efficiency ◽  
Network Congestion ◽  
Allocation Strategy ◽  
Multilayer Networks ◽  
Network Resources ◽  
Simulation Experiments ◽  
Traffic Capacity ◽  
Efficient Resource ◽  
Resource Allocation Strategy

The resource allocation strategy plays an important role in the improvement of network traffic capacity. In order to solve the problem of network congestion, an efficient resource allocation strategy is proposed for multilayer networks to optimize the utilization efficiency of network resources. With the proposed strategy, the network resources are allocated to nodes more reasonable and the network congestions are evidently reduced. Simulation experiments show that the proposed resource allocation strategy can greatly improve the traffic capacity of the multilayer networks compared with the average resource allocation strategy. The proposed strategy can give full play to the traffic resources of multilayer networks, which has guiding significance for optimizing the existing networks and building new networks.

Sign in / Sign up

Export Citation Format

Share Document