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

Traffic dynamics in scale-free networks with limited packet-delivering capacity

Author

Listed:
  • Yang, Han-Xin
  • Wang, Wen-Xu
  • Wu, Zhi-Xi
  • Wang, Bing-Hong

Abstract

We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node’s packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node i is proportional to kiϕ, where ki is the degree of node i and ϕ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the local routing strategy, and found that there exists an optimal value of parameter ϕ leading to the maximal network capacity under both routing strategies. We provide some explanations for the emergence of optimal ϕ.

Suggested Citation

  • Yang, Han-Xin & Wang, Wen-Xu & Wu, Zhi-Xi & Wang, Bing-Hong, 2008. "Traffic dynamics in scale-free networks with limited packet-delivering capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(27), pages 6857-6862.
  • Handle: RePEc:eee:phsmap:v:387:y:2008:i:27:p:6857-6862
    DOI: 10.1016/j.physa.2008.09.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437108007802
    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.09.016?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. Lin, Yi & Zhang, Jianwei & Yang, Bo & Liu, Hong & Zhao, Liping, 2019. "An optimal routing strategy for transport networks with minimal transmission cost and high network capacity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 551-561.
    2. Zhang, Yue & Huang, Ning & Yin, Shigang & Sun, Lina, 2017. "Phase transition in lattice networks with heavy-tailed user behaviors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 484(C), pages 367-377.

    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:27:p:6857-6862. 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.