By Topic

Routing strategy with waiting time on scale-free network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Dan Wang ; Key Lab. of Manuf. Ind. Integrated, Shenyang Univ., Shenyang, China ; Yanping Li ; Wenwei Liu ; Liang Dong
more authors

We study traffic dynamics and propose a new routing strategy based on the local topological information in scale-free network. According to the new routing strategy with a single tunable parameter, a packet is delivered to next node with probabilities that depend not only on the degrees of the next node but also the estimated waiting time at the new node. The routing algorithm is implemented in BA scale-free networks in the case of nodes' delivering ability proportional to its degree. Simulations show that the maximal network capacity corresponds to an optimal controlled parameter.

Published in:

Control Automation Robotics & Vision (ICARCV), 2010 11th International Conference on

Date of Conference:

7-10 Dec. 2010