IDEAS home Printed from https://ideas.repec.org/a/wsi/acsxxx/v05y2002i04ns021952590200064x.html
   My bibliography  Save this article

Packet Transport On Scale-Free Networks

Author

Listed:
  • BOSILJKA TADIĆ

    (Jozef Stefan Institute, P.O. Box 3000, 1001 Ljubljana, Slovenia)

  • G. J. RODGERS

    (Department of Mathematical Sciences, Brunel University, Uxbridge, Middlesex UB8 3PH, UK)

Abstract

We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major kinetic properties of the transport as a function of the network geometry, the packet input rate and the buffer size. We find long-range correlations in the power spectra of arriving packet density and the network's activity bursts. The packet transit time distribution shows a power-law dependence with average transit time increasing with network size. This implies dynamic queuing on the network, in which many interacting queues are mutually driven by temporally correlated packet streams.

Suggested Citation

  • Bosiljka Tadić & G. J. Rodgers, 2002. "Packet Transport On Scale-Free Networks," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 5(04), pages 445-456.
    • Handle: RePEc:wsi:acsxxx:v:05:y:2002:i:04:n:s021952590200064x
    DOI: 10.1142/S021952590200064X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021952590200064X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021952590200064X?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. Lancaster, David, 2014. "Random walks between leaves of random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 511-522.
    2. Dávid Csercsik & Sándor Imre, 2017. "Cooperation and coalitional stability in decentralized wireless networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(4), pages 571-584, April.
    3. Zhang, Guo-Qing & Zhou, Shi & Wang, Di & Yan, Gang & Zhang, Guo-Qiang, 2011. "Enhancing network transmission capacity by efficiently allocating node capability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(2), pages 387-391.

    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:wsi:acsxxx:v:05:y:2002:i:04:n:s021952590200064x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/acs/acs.shtml .

    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.