IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v387y2008i12p3001-3007.html
   My bibliography  Save this article

Traffic dynamics based on a traffic awareness routing strategy on scale-free networks

Author

Listed:
  • Wang, Dan
  • Jing, Yuanwei
  • Zhang, Siying

Abstract

By incorporating local traffic information into the shortest path routing strategy, we numerically investigate the effectiveness of the traffic awareness routing strategy for scale-free networks with different clustering. In order to characterize the efficiency of the packet-delivery process, we introduce an order parameter and an average transmission time that allow us to measure the network capacity by the critical value of phase transition from free flow to congestion. Compared with the shortest path routing protocol, the network capacity is greatly enhanced by the traffic awareness routing strategy. We also find that there exists an optimum value for the tunable parameter in the congestion awareness strategy. Moreover, simulation results show that the more clustered the network, the less efficient the packet-delivery process.

Suggested Citation

  • Wang, Dan & Jing, Yuanwei & Zhang, Siying, 2008. "Traffic dynamics based on a traffic awareness routing strategy on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(12), pages 3001-3007.
    • Handle: RePEc:eee:phsmap:v:387:y:2008:i:12:p:3001-3007
    DOI: 10.1016/j.physa.2008.01.085
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437108001027
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2008.01.085?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Maniadakis, Dimitris & Varoutas, Dimitris, 2014. "Network congestion analysis of gravity generated models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 114-127.
    2. Zhang, Mengyao & Huang, Tao & Guo, Zhaoxia & He, Zhenggang, 2022. "Complex-network-based traffic network analysis and dynamics: A comprehensive review," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 607(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:387:y:2008:i:12:p:3001-3007. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.