Probability routing strategy for scale-free networks
This study proposes a probability routing strategy for improving traffic capability on scale-free networks. Compared with the shortest path routing strategy depending on central nodes largely and the efficient routing strategy avoiding hub routers as much as possible, the probability routing strategy makes use of hub routers more efficiently, transferring approximate average amount of packs of the whole network. Simulation results indicate that the probability routing strategy has the highest network capacity among the three routing strategies. This strategy provides network capacity that can be more than 30 times higher than that of the shortest path routing strategy and over 50% higher than that of the efficient routing strategy. In addition, the average routing path length of our proposed strategy is over 10% shorter than that of the efficient routing strategy and only about 10% longer than that of the shortest path routing strategy.
Volume (Year): 392 (2013)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/|
When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:392:y:2013:i:4:p:953-958. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.