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.

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.

Method to enhance traffic capacity for two-layer complex networks

2014 ◽  
Vol 92 (12) ◽  
pp. 1599-1605 ◽  
Author(s):  
Shuai Zhang ◽  
Man-Gui Liang ◽  
Hui-Jia Li
Keyword(s):  
Topological Structure ◽  
Peer Networks ◽  
Traffic Dynamics ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Virtual Links ◽  
Peer To Peer Networks ◽  
Average Transmission ◽  
Simulation Results

The study of traffic dynamics on multilayered networks is a hot issue, where the network topology is composed of two layers of subnetworks, such as wired–wireless networks and peer-to-peer networks. Virtual links on the logical layer can be changed or constructed easily, and therefore the topological structure of the upper logical layer can be efficiently constructed by a link removal strategy. In this paper, edges linking to nodes with large betweenness will be removed. The structure of the upper-layer network can be optimized freely based on our method. Simulation results show that for both shortest path routing strategy and efficient routing strategy, the traffic capacity of two-layer networks is significantly improved. In addition, the average transmission time of packets and the average path length are also investigated in this paper.

An optimal routing strategy on scale-free networks

2017 ◽  
Vol 28 (07) ◽  
pp. 1750087 ◽  
Author(s):  
Yibo Yang ◽  
Honglin Zhao ◽  
Jinlong Ma ◽  
Zhaohui Qi ◽  
Yongbin Zhao
Keyword(s):  
Traffic Congestion ◽  
Transportation Systems ◽  
Optimal Routing ◽  
Shortest Path Routing ◽  
Transport Efficiency ◽  
Scale Free ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Traffic Performance ◽  
Scale Free Networks

Traffic is one of the most fundamental dynamical processes in networked systems. With the traditional shortest path routing (SPR) protocol, traffic congestion is likely to occur on the hub nodes on scale-free networks. In this paper, we propose an improved optimal routing (IOR) strategy which is based on the betweenness centrality and the degree centrality of nodes in the scale-free networks. With the proposed strategy, the routing paths can accurately bypass hub nodes in the network to enhance the transport efficiency. Simulation results show that the traffic capacity as well as some other indexes reflecting transportation efficiency are further improved with the IOR strategy. Owing to the significantly improved traffic performance, this study is helpful to design more efficient routing strategies in communication or transportation systems.

An efficient improved routing strategy for multilayer networks

2020 ◽  
pp. 2150078
Author(s):  
Jinlong Ma ◽  
Min Li ◽  
Yaming Li ◽  
Xiangyang Xu ◽  
Weizhan Han ◽  
...  
Keyword(s):  
Multilayer Structure ◽  
High Speed ◽  
Multilayer Networks ◽  
Traffic Dynamics ◽  
The Core ◽  
Transmission Process ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Average Transmission ◽  
Simulation Results

Traffic dynamics of multilayer networks draws continuous attention from different communities since many systems are actually proved to have a multilayer structure. Since the core nodes of network are prone to congested, an effective routing strategy is of great significance to alleviate the congestion of the multilayer networks. In this paper, we propose an efficient improved routing strategy, with which the core nodes that can reasonably avoid congestion at the high-speed layer in the transmission process of packets, and can also make the most of the traffic resources of the low-speed layer nodes to optimize the traffic capacity of multilayer networks. The simulation results show that the proposed routing strategy can not only improve the network traffic capacity, but also shorten the average path length and average transmission time.

An incremental optimal routing strategy for scale-free networks

2014 ◽  
Vol 25 (09) ◽  
pp. 1450044 ◽  
Author(s):  
Zhong-Yuan Jiang
Keyword(s):  
Traffic Load ◽  
Traffic Model ◽  
Optimal Routing ◽  
Traffic Dynamics ◽  
Shortest Path Routing ◽  
Scale Free ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Real Complex ◽  
Link Congestion

The link congestion based traffic model can more accurately reveal the traffic dynamics of many real complex networks such as the Internet, and heuristically optimizing each link's weight for the shortest path routing strategy can strongly improve the traffic capacity of network. In this work, we propose an optimal routing strategy in which the weight of each link is regulated incrementally to enhance the network traffic capacity by minimizing the maximum link betweenness of any link in the network. We also estimate more suitable value of the tunable parameter β for the efficient routing strategy under the link congestion based traffic model. The traffic load of network can be significantly balanced at the expense of increasing a bit average path length or average traffic load.

The self-adaptive routing strategy to alleviate packet loss in finite buffer networks

2021 ◽  
Vol 2021 (12) ◽  
pp. 123402
Author(s):  
Qing Wu ◽  
Qing-Yang Liu ◽  
Xiang Ling ◽  
Li-Jun Zhang
Keyword(s):  
Heuristic Algorithm ◽  
Packet Loss ◽  
Storage Capacity ◽  
Transportation Systems ◽  
The Self ◽  
Finite Buffer ◽  
Traffic Dynamics ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Traffic Capacity

Abstract In real communication or transportation systems, loss of agents is very common due to finite storage capacity. We study the traffic dynamics in finite buffer networks and propose a routing strategy motivated by a heuristic algorithm to alleviate packet loss. Under this routing strategy, the traffic capacity is further improved, comparing to the shortest path routing strategy and efficient routing strategy. Then we investigate the effect of this routing strategy on the betweenness of nodes. Through dynamic routing changes, the maximum node betweenness of the network is greatly reduced, and the final betweenness of each node is almost the same. Therefore, the routing strategy proposed in this paper can balance the node load, thereby effectively alleviating packet loss.

ENHANCING TRAFFIC CAPACITY OF TWO-LAYER COMPLEX NETWORKS

2013 ◽  
Vol 24 (08) ◽  
pp. 1350051 ◽  
Author(s):  
ZHONG-YUAN JIANG ◽  
MAN-GUI LIANG ◽  
SHUAI ZHANG ◽  
WEIXING ZHOU ◽  
HUIQIN JIN
Keyword(s):  
Complex Systems ◽  
Network Model ◽  
Network Traffic ◽  
Physical Layer ◽  
Traffic Load ◽  
Traffic Dynamics ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Real Complex

As two-layer or multi-layer network model can more accurately reveal many real structures of complex systems such as peer-to-peer (P2P) networks on IP networks, to better understand the traffic dynamics and improve the network traffic capacity, we propose to efficiently construct the structure of upper logical layer network which can be possibly implemented. From the beginning, we assume that the logical layer network has the same structure as the lower physical layer network, and then we use link-removal strategy in which a fraction of links with maximal product (ki* kj) are removed from the logical layer, where ki and kj are the degrees of node i and node j, respectively. Traffic load is strongly redistributed from center nodes to noncenter nodes. The traffic capacity of whole complex system is enhanced several times at the expense of a little average path lengthening. In two-layer network model, the physical layer network structure is unchanged and the shortest path routing strategy is used. The structure of upper layer network can been constructed freely under our own methods. This mechanism can be employed in many real complex systems to improve the network traffic capacity.

A link-adding strategy for transport efficiency of complex networks

2016 ◽  
Vol 27 (05) ◽  
pp. 1650054 ◽  
Author(s):  
Jinlong Ma ◽  
Weizhan Han ◽  
Qing Guo ◽  
Zhenyong Wang ◽  
Shuai Zhang
Keyword(s):  
Complex Networks ◽  
Shortest Path ◽  
Path Length ◽  
Critical Parameters ◽  
Shortest Path Routing ◽  
Transport Efficiency ◽  
Network Transport ◽  
Local Degree ◽  
Traffic Capacity ◽  
Low Degree

The transport efficiency is one of the critical parameters to evaluate the performance of a network. In this paper, we propose an improved efficient (IE) strategy to enhance the network transport efficiency of complex networks by adding a fraction of links to an existing network based on the node’s local degree centrality and the shortest path length. Simulation results show that the proposed strategy can bring better traffic capacity and shorter average shortest path length than the low-degree-first (LDF) strategy under the shortest path routing protocol. It is found that the proposed strategy is beneficial to the improvement of overall traffic handling and delivering ability of the network. This study can alleviate the congestion in networks, and is helpful to design and optimize realistic 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.

Sign in / Sign up

Export Citation Format

Share Document