Packet Transport and Load Distribution in Scale-Free Networks

K.-I. Goh, B. Kahng and D. Kim
Additional contact information
K.-I. Goh: Seoul National University, School of Physics and Center for Theoretical Physics
B. Kahng: Seoul National University, School of Physics and Center for Theoretical Physics
D. Kim: Seoul National University, School of Physics and Center for Theoretical Physics

A chapter in Traffic and Granular Flow’01, 2003, pp 365-375 from Springer

Abstract: Abstract We study a problem of data packet transport in scale-free networks whose degree distribution follows a power-law with the exponent γ. We define load at each vertex as the accumulated total number of data packets passing through that vertex when every pair of vertices sends and receives a data packet along the shortest path connecting the pair. It is found that the load distribution follows a power-law with the exponent δ ≈ 2.2(1), insensitive to different values of γ in the range, 2

Keywords: Short Path; Data Packet; Degree Distribution; Load Distribution; Double Logarithmic Scale (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-10583-2_37

Ordering information: This item can be ordered from
http://www.springer.com/9783662105832

DOI: 10.1007/978-3-662-10583-2_37

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().