scholarly journals Efficient Routing Strategy with Memory Information for Complex Networks

2012 ◽  
Vol 02 (01) ◽  
pp. 73-81 ◽  
Author(s):  
Takayuki Kimura ◽  
Tohru Ikeguchi ◽  
Chi K. Tse
Keyword(s):  
Complex Networks ◽  
Routing Strategy ◽  
With Memory

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 CONGESTION ANALYSIS IN COMPLEX NETWORKS BASED ON VARIOUS ROUTING STRATEGIES

2007 ◽  
Vol 21 (15) ◽  
pp. 929-939 ◽  
Author(s):  
XUAN GUO ◽  
HONGTAO LU
Keyword(s):  
Complex Networks ◽  
Traffic Congestion ◽  
Small World ◽  
Modern Society ◽  
Information Communication ◽  
Shortest Path Routing ◽  
Scale Free ◽  
Deterministic Routing ◽  
Routing Strategy ◽  
Network Topologies

Networks, acting as infrastructure for information communication, play an important role in modern society, therefore, the elements affecting the efficiency of network traffic are worthy of deep research. In this paper, we investigate numerically the problem of traffic congestion in complex networks through the use of various routing strategies. Three types of complex networks structures, namely Poisson random networks, small-world networks and scale-free networks, are considered. Three different routing strategies are used on networks: deterministic routing strategy, preferential routing strategy and shortest path routing strategy. We evaluate the efficiency of different routing strategies on different network topologies and show how the network structures and routing strategies influence the traffic congestion status.

Extended shortest path selection for package routing of complex networks

2017 ◽  
Vol 28 (11) ◽  
pp. 1750129 ◽  
Author(s):  
Fan Ye ◽  
Lei Zhang ◽  
Bing-Hong Wang ◽  
Lu Liu ◽  
Xing-Yi Zhang
Keyword(s):  
Complex Networks ◽  
Shortest Path ◽  
Network Flow ◽  
Path Selection ◽  
Local Load ◽  
Maximum Throughput ◽  
Distance Analysis ◽  
Routing Optimization ◽  
Routing Strategy ◽  
Peer To Peer Networks

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

Study of routing strategy on complex networks

2010 ◽  
Vol 30 (8) ◽  
pp. 2210-2213
Author(s):  
Hai-juan ZANG ◽  
Yan REN ◽  
Xiao-ping XUE ◽  
Yun-tian TAN
Keyword(s):  
Complex Networks ◽  
Routing Strategy

Traffic Dynamics on Effective Routing Strategy for Complex Networks

2014 ◽  
Vol 1 ◽  
pp. 539-542
Author(s):  
Takayuki Kimura ◽  
Tohru Ikeguchi
Keyword(s):  
Complex Networks ◽  
Traffic Dynamics ◽  
Routing Strategy

scholarly journals An adaptive routing strategy for packet delivery in complex networks

2007 ◽  
Vol 364 (3-4) ◽  
pp. 177-182 ◽  
Author(s):  
Huan Zhang ◽  
Zonghua Liu ◽  
Ming Tang ◽  
P.M. Hui
Keyword(s):  
Complex Networks ◽  
Adaptive Routing ◽  
Packet Delivery ◽  
Routing Strategy

Static weighted routing strategy on two-layer complex networks

2011 ◽  
Vol 84 (5) ◽  
pp. 055802 ◽  
Author(s):  
Yue Zhuo ◽  
Yunfeng Peng ◽  
Xiaolong Yang ◽  
Keping Long
Keyword(s):  
Complex Networks ◽  
Routing Strategy
Sign in / Sign up

Export Citation Format

Share Document