Packet transport along the shortest pathways in scale-free networks

C. M. Ghim, E. Oh, K. I. Goh, B. Kahng, D. Kim

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

We investigate a problem of data packet transport between a pair of vertices on scale-free networks without loops or with a small number of loops. By introducing load of a vertex as accumulated sum of a fraction of data packets traveling along the shortest pathways between every pair of vertices, it is found that the load distribution follows a power law with an exponent δ. It is found for the Barabási-Albert-type model that the exponent δ changes abruptly from δ = 2.0 for tree structure to δ ≃ as the number of loops increases. The load exponent seems to be insensitive to different values of the degree exponent γ as long as 2 < γ < 3.

Original languageEnglish
Pages (from-to)193-199
Number of pages7
JournalEuropean Physical Journal B
Volume38
Issue number2
DOIs
Publication statusPublished - 2004 Mar

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics

Fingerprint Dive into the research topics of 'Packet transport along the shortest pathways in scale-free networks'. Together they form a unique fingerprint.

  • Cite this