An adaptive stabilization framework for distributed hash tables

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Ghinita, Gabriel ^a   Yong, Meng Teo ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; STATISTICAL METHODS; TOPOLOGY;

ADAPTIVE STABILIZATION; DISTRIBUTED HASH TABLES (DHT); OVERLAY NETWORK; STABILIZATION-INDUCED COMMUNICATION;

ADAPTIVE SYSTEMS;

EID: 33847108544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639269     Document Type: Conference Paper

References (18)

1. p2psim: The Peer-to-Peer Network Simulator. http://pdos.csail. mit.edu/p2psim.
2. Secure Hash Standard. U.S. Dept. Commerce/NIST, Springfield, VA, FIPS 180-1, Apr. 1995.
3. L. Alima, S. El-Ansary, P. Brand, and S. Haridi. DKS(N,k,f):a Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P applications. The 3rd Int'l Workshop CCGRID2003, 2003.
4. M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC), 20(8):1489-1499, 2002.
5. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. of ACM SOSP'01, Banff, Canada, 2001.
6. S. El-Ansary and S. Haridi. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad-Hoc Wireless, and Peer-to-Peer Networks, chapter An overview of structured overlay networks. CRC, 2004.
7. P. Gummadi, S. Saroiu, and S. Gribble. A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems. Multimedia Systems Journal, 9(2):170-184, 2003.
8. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In A CM Symposium on Theory of Computing, pages 654-663, 1997.
9. S. Krishnamurthy, S. El-Ansary, E. Aurell, and S. Haridi. A statistical theory of Chord under churn. In Proc. of the 5th Int'l Workshop on Peer-to-Peer Systems (IPTPS), 2005.
10. J. Li, J. Stribling, T. Gil, R. Morris, and F. Kaashoek. Comparing the performance of distributed hash tables under churn. In Proc. of the 3rd Int'l Workshop on Peer-to-Peer Systems (IPTPS), 2004.
11. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In Proc. of Principles of Distributed Computing, pages 233-242, 2002.
12. R. Mahajan, M. Castro, and A. Rowstron. Controlling the cost of reliability in peer-to-peer overlays. In Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems (IPTPS), 2003.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content Addressable Network. Tech. Report TR-00-010, Berkeley, CA, 2000.
14. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level multicast using content-addressable networks. Lecture Notes in Computer Science, 2233:14-26, 2001.
15. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In Proc. of USENIX Technical Conference, 2004.
16. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-350, 2001.
17. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM 2001, pages 149-160, 2001.
18. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001.