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

An efficient approach of controlling traffic congestion in scale-free networks

Author

Listed:
  • Liu, Zonghua
  • Ma, Weichuan
  • Zhang, Huan
  • Sun, Yin
  • Hui, P.M.

Abstract

We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic situations where different nodes in a network may have different capabilities, the message or packet creation and delivering rates at a node are assumed to depend on the degree of the node. Noting that congestions are more likely to take place at the nodes with high degrees in networks with scale-free character, an efficient approach of selectively enhancing the message-processing capability of a small fraction (e.g. 3%) of the nodes is shown to perform just as good as enhancing the capability of all nodes. The interplay between the creation rate and the delivering rate in determining non-congested or congested traffic in a network is studied more numerically and analytically.

Suggested Citation

  • Liu, Zonghua & Ma, Weichuan & Zhang, Huan & Sun, Yin & Hui, P.M., 2006. "An efficient approach of controlling traffic congestion in scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 370(2), pages 843-853.
    • Handle: RePEc:eee:phsmap:v:370:y:2006:i:2:p:843-853
    DOI: 10.1016/j.physa.2006.02.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437106002330
    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.2006.02.021?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. Tan, Fei & Xia, Yongxiang, 2013. "Hybrid routing on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4146-4153.
    2. Zhang, Junfeng & Ma, Jinlong & Li, Hui-Jia, 2022. "An efficient link closing strategy for improving traffic capacity on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(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:370:y:2006:i:2:p:843-853. 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.