Growing distributed networks with arbitrary degree distributions
- 111 Downloads
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.
PACS.89.75.Fb Structures and organization in complex systems 89.75.Hc Networks and genealogical trees
Unable to display preview. Download preview PDF.
- S.N. Dorogovtsev, J.F.F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, Oxford, 2003) Google Scholar
- M.E.J. Newman, A.-L. Barabási, D.J. Watts, The Structure and Dynamics of Networks (Princeton University Press, Princeton, 2006) Google Scholar
- N. Sarshar, P.O. Boykin, V.P. Rowchowdhury, in Proceedings of the 4th International Conference on Peer-to-Peer Computing (IEEE Computer Society, New York, 2004), pp. 2–9 Google Scholar
- T. Hong, in Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology, edited by A. Oram (O'Reilly and Associates, Sebastopol, CA, 2001), pp. 203–241 Google Scholar
- C. Gkantsidis, M. Mihail, A. Saberi, in Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (Institute of Electrical and Electronics Engineers, New York, 2004) Google Scholar
- J.P. Ritter, Why Gnutella can't scale. No, really (2000), http://www.darkridge.com/ jpr5/doc/gnutella.html Google Scholar
- M. Ripeanu, I. Foster, A. Iamnitchi, IEEE Internet Computing 6, 50 (2002) Google Scholar
- W. Aiello, F. Chung, L. Lu, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Association of Computing Machinery, New York, 2000), pp. 171–180 Google Scholar