Building low-diameter P2P networks

@inproceedings{citeulike:1325689, abstract = {In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and fragmentation into disconnected pieces separated by choke-points with inadequate bandwidth. The authors propose a simple scheme for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. It does so with no global knowledge of all the nodes in the network. In the most common P2P application to date (search), these properties are important.}, author = {Pandurangan, G. and Raghavan, P. and Upfal, E. }, citeulike-article-id = {1325689}, journal = {Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on}, keywords = {diameter, peer-to-peer}, pages = {492--499}, posted-at = {2007-05-24 20:13:38}, priority = {2}, title = {Building low-diameter P2P networks}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=959925}, year = {2001} }

TY - CONF ID - citeulike:1325689 TI - Building low-diameter P2P networks JF - Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on SP - 492 EP - 499 N2 - In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and fragmentation into disconnected pieces separated by choke-points with inadequate bandwidth. The authors propose a simple scheme for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. It does so with no global knowledge of all the nodes in the network. In the most common P2P application to date (search), these properties are important. KW - diameter KW - peer-to-peer AU - Pandurangan, G AU - Raghavan, P AU - Upfal, E PY - 2001/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=959925 ER -