Communication channel management for maintenance of strong overlay connectivity

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2006, Pages 63-68

  Baldoni, Roberto ^a   Scipioni, Sirio ^a   Tucci Piergiovanni, Sara ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION MANAGEMENT; NETWORK PROTOCOLS; PROBLEM SOLVING;

INFINITE PARTICIPATION; NETWORK TOPOLOGY; UNBOUNDED CONCURRENCY;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 34547262730     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2006.51     Document Type: Conference Paper

References (16)

1. J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384-393, January 2003.
2. Roberto Baldoni, Sara Tucci Piergiovanni: Group Membership for Peer-to-Peer Communication, Technical Report 2005, available on http://www.dis.uniroma1.it/midlab/publications
3. Bittorrent. [Online]. Available: http://bitconjurer.org/BitTorrent/
4. Gnutella development forum, the gnutella v0.6 protocol. [Online]. Available: http://groups.yahoo.com/group/the gdf/files/
5. K. Hildrum, J. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed data location in a dynamic network. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 41-52, August 2002.
6. Kazaa media desktop. [Online]. Available: http://www.kazaa.com/
7. X. Li, J. Misra, and C. G. Plaxton. Active and Concurrent Topology Maintenance. In Proceedings of the 18th International Symposium on Distributed Computing, pages 320-334, 2004. Extended version Technical Report TR-04-21, Department of Computer Science, University of Texas at Austin, May 2004.
8. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, pages 233-242, July 2002.
9. H. Liu and S. S. Lam. Neighbor table construction and update in a dynamic peer-to-peer network. In Proceedings of the 23rd International Conference on Distributed Computing Systems, pages 509-519, May 2003.
10. N. Lynch, D. Malkhi, and D. Ratajczak. Atomic data access in content addressable networks. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems, pages 295-305, March 2002
11. Michael Merritt, Gadi Taubenfeld. Computing with Infinitely Many Processes. In Proceedings of the 14th International Symposium on Distributed Computing, pages 164-178, 2000.
12. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications, 21:995-1002, August 2003.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content addressable network, in Processings of the ACM SIGCOMM, 2001, pp. 161172.
14. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet appli- cations. IEEE/ACM. Transactions on Networking, 11:17-32, February 2003.
15. Daniel Stutzbach, Reza Rejaie, Towards a Better Understanding of Churn in Peer-to-Peer Networks.Technical Report CIS-TR-04-06, Department of Computer Science, University of Oregon, November, 2004
16. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, Tapestry: A. resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, pp. 4153, January 2004.