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.

AN EFFICIENT WEIGHTED ROUTING STRATEGY FOR SCALE-FREE NETWORKS

2012 ◽  
Vol 26 (29) ◽  
pp. 1250195 ◽  
Author(s):  
ZHONG-YUAN JIANG ◽  
MAN-GUI LIANG ◽  
JIAN-LING HUANG ◽  
QIAN LI
Keyword(s):  
Traffic Congestion ◽  
Heavy Traffic ◽  
Traffic Load ◽  
Shortest Path Routing ◽  
Scale Free ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Edge Betweenness ◽  
Real Complex ◽  
Link Congestion

Considering the link congestion based traffic model, which can more accurately model the traffic diffusing process of many real complex systems such as the Internet, we propose an efficient weighted routing strategy in which each link's weight is assigned with the edge betweenness of the original un-weighted network with a tunable parameter α. As the links with the highest edge betweenness are susceptible to traffic congestion, our routing strategy efficiently redistribute the heavy traffic load from central links to noncentral links. The highest traffic capacity under this new routing strategy is achieved when compared with the shortest path routing strategy and the efficient routing strategy. Moreover, the average path length of our routing strategy is much smaller than that of the efficient routing strategy. Therefore, our weighted routing strategy is preferable to other routing strategies and can be easily implemented through software method.

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.

Efficient packet navigation method on scale-free networks with finite and diversiform node delivery capacity

2016 ◽  
Vol 27 (09) ◽  
pp. 1650098
Author(s):  
Xuan He ◽  
Kai Niu ◽  
Zhiqiang He ◽  
Jiaru Lin ◽  
Hui Zhang ◽  
...  
Keyword(s):  
Capacity Allocation ◽  
Traffic Load ◽  
Allocation Mechanism ◽  
Good Correspondence ◽  
Shortest Path Routing ◽  
Scale Free ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Network Diameter ◽  
Node Capacity

Routing strategy is essential for high transport efficiency on realistic networked complex systems. Beginning from the consideration of finite and diversiform node delivery capacity distributions, a general node capacity allocation mechanism with a tunable parameter [Formula: see text] is presented. A node capacity, based routing strategy is proposed to improve the network traffic capacity. Compared with the traditional shortest path routing (SPR) and the efficient routing (ER) methods, it suggests that routing strategy should be chosen heuristically according to the limited capacity resource distribution, instead of using one certain method for all cases. With proper range of parameter [Formula: see text], the new routing strategy achieves the highest traffic capacity and other preferable measure metrics including network diameter, average path length, efficient betweenness, average packet travel time and average traffic load. The theoretical analysis for traffic capacity has a good correspondence to the simulation results. This work studies routing mechanisms from a very practical perspective, and helps network researchers to understand the traffic dynamics on complex networks comprehensively.

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.

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.

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 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.

IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS

2012 ◽  
Vol 23 (02) ◽  
pp. 1250016 ◽  
Author(s):  
ZHONG-YUAN JIANG ◽  
MAN-GUI LIANG
Keyword(s):  
Network Traffic ◽  
Traffic Congestion ◽  
Heavy Traffic ◽  
Traffic Load ◽  
Transport Efficiency ◽  
Scale Free ◽  
Network Transport ◽  
Routing Strategy ◽  
Traffic Capacity ◽  
Path Cost

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási–Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document