Traffic Dynamics on Effective Routing Strategy for Complex Networks

2014 ◽  
Vol 1 ◽  
pp. 539-542
Author(s):  
Takayuki Kimura ◽  
Tohru Ikeguchi
2016 ◽  
Vol 27 (04) ◽  
pp. 1650044 ◽  
Author(s):  
Jinlong Ma ◽  
Weizhan Han ◽  
Qing Guo ◽  
Shuai Zhang ◽  
Junfang Wang ◽  
...  

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.


2011 ◽  
Vol 25 (10) ◽  
pp. 1419-1428 ◽  
Author(s):  
KUN LI ◽  
XIAOFENG GONG ◽  
SHUGUANG GUAN ◽  
C.-H. LAI

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.


2018 ◽  
Vol 32 (13) ◽  
pp. 1850155 ◽  
Author(s):  
Jinlong Ma ◽  
Huiling Wang ◽  
Zhuxi Zhang ◽  
Yi Zhang ◽  
Congwen Duan ◽  
...  

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.


2016 ◽  
Vol 27 (06) ◽  
pp. 1650059
Author(s):  
Wen-Ping Zhang ◽  
Yongxiang Xia ◽  
Fei Tan

Many real-world networks are interconnected with each other. In this paper, we study the traffic dynamics in interconnected complex networks under an intentional attack. We find that with the shortest time delay routing strategy, the traffic dynamics can show the stable state, periodic, quasi-periodic and chaotic oscillations, when the capacity redundancy parameter changes. Moreover, compared with isolated complex networks, oscillations always take place in interconnected networks more easily. Thirdly, in interconnected networks, oscillations are affected strongly by the coupling probability and coupling preference.


2012 ◽  
Vol 02 (01) ◽  
pp. 73-81 ◽  
Author(s):  
Takayuki Kimura ◽  
Tohru Ikeguchi ◽  
Chi K. Tse

2009 ◽  
pp. 733-738
Author(s):  
Mao-Bin Hu ◽  
Yong-Hong Wu ◽  
Rui Jiang ◽  
Qing-Song Wu ◽  
Wen-Xu Wang

2018 ◽  
Vol 32 (05) ◽  
pp. 1850054 ◽  
Author(s):  
Jinlong Ma ◽  
Lixin Wang ◽  
Sufeng Li ◽  
Congwen Duan ◽  
Yu Liu

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.


2020 ◽  
pp. 2150078
Author(s):  
Jinlong Ma ◽  
Min Li ◽  
Yaming Li ◽  
Xiangyang Xu ◽  
Weizhan Han ◽  
...  

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.


2011 ◽  
Vol 84 (4) ◽  
Author(s):  
Han-Xin Yang ◽  
Wen-Xu Wang ◽  
Ying-Cheng Lai ◽  
Yan-Bo Xie ◽  
Bing-Hong Wang

Sign in / Sign up

Export Citation Format

Share Document