Self-organization of balanced nodes in random networks with transportation bandwidths
From MaRDI portal
Publication:977527
DOI10.1140/EPJB/E2010-00017-6zbMATH Open1188.91167arXiv0907.4366OpenAlexW2043702198MaRDI QIDQ977527FDOQ977527
Authors: C. H. Yeung, K. Y. M. Wong 
Publication date: 22 June 2010
Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)
Abstract: We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths along the transportation links. The mean-field approach is applicable when the connectivity is sufficiently high. It allows us to derive the resource shortage of a node as a well-defined function of its capacity. For networks with uniformly high connectivity, an efficient profile of the allocated resources is obtained, which exhibits features similar to the Maxwell construction. These results have good agreements with simulations, where nodes self-organize to balance their shortages, forming extensive clusters of nodes interconnected by unsaturated links. The deviations from the mean-field analyses show that nodes are likely to be rich in the locality of gifted neighbors. In scale-free networks, hubs make sacrifice for enhanced balancing of nodes with low connectivity.
Full work available at URL: https://arxiv.org/abs/0907.4366
Recommendations
- Bandwidth allocation strategy for traffic systems of scale-free network
- Networking -- a statistical physics perspective
- Asymmetrical resource networks. I. Stabilization processes for low resources
- Bandwidth allocation and resource adjustment for stability enhancement in complex networks
- Dynamic resource networks. The case of small resource
Cites Work
Cited In (1)
This page was built for publication: Self-organization of balanced nodes in random networks with transportation bandwidths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q977527)
