Scale-free property of optimal network for packet flow by a packet routing control

Jun Ohkubo and Tsuyoshi Horiguchi

Physica A: Statistical Mechanics and its Applications, 2005, vol. 353, issue C, 649-660

Abstract: We investigate an optimal network structure for packet flow on large-scale networks. For this aim, we introduce a cost function which represents efficiency of the packet flow. Our strategy for obtaining an optimal network is to reconnect links in the network so as to minimize the defined cost function. We apply this strategy to a packet communication network in which a packet routing is controlled by using neural networks. We found that the optimal network shows a scale-free property for large degree k when the buffer-size distribution has a power-law form and the probability with which a node is chosen as a destination of a packet is proportional to the buffer size of the node.

Keywords: Network; Scale-free; Packet flow; Routing control; Optimal network (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437105000609
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

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:eee:phsmap:v:353:y:2005:i:c:p:649-660

DOI: 10.1016/j.physa.2005.01.020

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().