Research Article
Self-organized Balanced Resources in Random Networks with Transportation Bandwidths
@INPROCEEDINGS{10.1007/978-3-642-02466-5_80, author={Chi Yeung and K. Wong}, title={Self-organized Balanced Resources in Random Networks with Transportation Bandwidths}, proceedings={Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1}, proceedings_a={COMPLEX PART 1}, year={2012}, month={5}, keywords={resource allocation bandwidth Maxwell’s construction scale-free networks Bethe approximation message-passing}, doi={10.1007/978-3-642-02466-5_80} }- Chi Yeung
K. Wong
Year: 2012
Self-organized Balanced Resources in Random Networks with Transportation Bandwidths
COMPLEX PART 1
Springer
DOI: 10.1007/978-3-642-02466-5_80
Abstract
We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths for the transportation of resources along the links. We derive algorithms which searches the optimal solution without the need of a global optimizer. For networks with uniformly high connectivity, the resource shortage of a node becomes a well-defined function of its capacity. An efficient profile of the allocated resources is found, with clusters of node interconnected by an extensive fraction of unsaturated links, enabling the resource shortages among the nodes to remain balanced. The capacity-shortage relation exhibits features similar to the Maxwell’s construction. For scale-free networks, such an efficient profile is observed even for nodes of low connectivity.