A Packet Routing Method Using Chaotic Neurodynamics for Complex Networks

2006 ◽  
pp. 1012-1021 ◽  
Author(s):  
Takayuki Kimura ◽  
Tohru Ikeguchi
Keyword(s):  
Complex Networks ◽  
Packet Routing ◽  
Routing Method

A Packet Routing Method Based on a Hogg-Huberman Strategy

1998 ◽  
Vol 31 (20) ◽  
pp. 757-762
Author(s):  
Toshimitsu Ushio ◽  
Tatsushi Yamasaki
Keyword(s):  
Packet Routing ◽  
Routing Method

scholarly journals Neural-Based Routing Method for Alleviating Congestion in Complex Networks

2016 ◽  
Vol 06 (04) ◽  
pp. 343-354 ◽  
Author(s):  
Takayuki Kimura ◽  
Tohru Takamizawa ◽  
Takafumi Matsuura
Keyword(s):  
Complex Networks ◽  
Routing Method

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.

Cernet packet routing method

1980 ◽  
Vol 3 (4) ◽  
pp. 173-176
Author(s):  
Roar Fjellheim
Keyword(s):  
Packet Routing ◽  
Routing Method
Sign in / Sign up

Export Citation Format

Share Document