Optimal resource allocation in random networks with transportation bandwidths

Chi Ho YEUNG, K. Y. Michael WONG

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Recursive relations from the Bethe approximation are converted into useful algorithms. Bottlenecks emerge when the bandwidths are small, causing an increase in the fraction of idle links. For a given total bandwidth per node, the efficiency of allocation increases with the network connectivity. In the high connectivity limit, we find a phase transition at a critical bandwidth, above which clusters of balanced nodes appear, characterized by a profile of homogenized resource allocation similar to the Maxwell construction. Copyright © 2009 IOP Publishing Ltd.
Original languageEnglish
Article numberP03029
JournalJournal of Statistical Mechanics: Theory and Experiment
Volume2009
Issue number3
DOIs
Publication statusPublished - 2009

Fingerprint

resource allocation
Random Networks
Optimal Allocation
Resource Allocation
Bandwidth
bandwidth
Network Connectivity
Statistical Physics
Vertex of a graph
resources
Connectivity
Phase Transition
physics
Resources
Resource allocation
Approximation
profiles
approximation
Node

Citation

Yeung, C. H., & Wong, K. Y. M. (2009). Optimal resource allocation in random networks with transportation bandwidths. Journal of Statistical Mechanics: Theory and Experiment, 2009(3). Retrieved from http://dx.doi.org/10.1088/1742-5468/2009/03/P03029