Growing distributed networks with arbitrary degree distributions
arXiv:physics/0608057 · doi:10.1140/epjb/e2007-00208-2
Abstract
We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with some mild constraints, it is possible by a suitable choice of rules to arrange for the network to have any degree distribution we desire. We also describe a mechanism based on biased random walks by which appropriate rules could be implemented in practice. As an example application, we describe and simulate the construction of a peer-to-peer network optimized to minimize search times and bandwidth requirements.
10 pages, 2 figures
References in corpus (9)
- The structure and function of complex networks
- Power laws, Pareto distributions and Zipf's law
- Random graphs with arbitrary degree distributions and their applications
- Search in Power-Law Networks
- Organization of Growing Random Networks
- Optimization of Robustness of Complex Networks
- Exact solutions for models of evolving networks with addition and deletion of nodes
- Scale-Free and Stable Structures in Complex {\em Ad hoc} networks
- Scalable Percolation Search in Power Law Networks