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

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

Ghim, C. M., Oh, E., Goh, K. I., Kahng, B., & Kim, D. (2004). Packet transport along the shortest pathways in scale-free networks.

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