Sat, 19 Jul 2008 04:44:43 BST CiteULike: p2pstreaming's diameter http://www.citeulike.org/user/p2pstreaming/tag/diameter CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/p2pstreaming/article/1325689 <i>Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on (2001), pp. 492-499.</i><br /><br />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. Building low-diameter P2P networks G Pandurangan P Raghavan E Upfal Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on (2001), pp. 492-499. 2007-05-24T19:13:13-00:00 2001 Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on 492 499 diameter peer-to-peer