### 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 language | English |
---|---|

Pages (from-to) | 193-199 |

Number of pages | 7 |

Journal | European Physical Journal B |

Volume | 38 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2004 Mar 1 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Condensed Matter Physics
- Electronic, Optical and Magnetic Materials

### Cite this

*European Physical Journal B*,

*38*(2), 193-199. https://doi.org/10.1140/epjb/e2004-00113-2

**Packet transport along the shortest pathways in scale-free networks.** / Ghim, C. M.; Oh, E.; Goh, Kwang-Il; Kahng, B.; Kim, D.

Research output: Contribution to journal › Article

*European Physical Journal B*, vol. 38, no. 2, pp. 193-199. https://doi.org/10.1140/epjb/e2004-00113-2

}

TY - JOUR

T1 - Packet transport along the shortest pathways in scale-free networks

AU - Ghim, C. M.

AU - Oh, E.

AU - Goh, Kwang-Il

AU - Kahng, B.

AU - Kim, D.

PY - 2004/3/1

Y1 - 2004/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=2942536804&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2942536804&partnerID=8YFLogxK

U2 - 10.1140/epjb/e2004-00113-2

DO - 10.1140/epjb/e2004-00113-2

M3 - Article

AN - SCOPUS:2942536804

VL - 38

SP - 193

EP - 199

JO - European Physical Journal B

JF - European Physical Journal B

SN - 1434-6028

IS - 2

ER -