Structured overlay without consistent hashing: Empirical results

Sixth IEEE International Symposium on Cluster Computing and the Grid Workshops, 2006. CCGRID 06

Volumn , Issue , 2006, Pages

  Schütt, Thorsten ^a   Schintke, Florian ^a   Reinefeld, Alexander ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; QUERY LANGUAGES;

LOGARITHMIC ROUTING EFFORT; NETWORK HOPS;

NETWORK PROTOCOLS;

EID: 42549172756     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ccgrid.2006.1630903     Document Type: Conference Paper

References (17)

1. 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. Workshop on Global and P2P Computing, CCGRID 2003, May 2003.
2. A. Andrzejak and Z. Xu. Scalable, efficient range queries for Grid information services. P2P2002, Sep. 2002.
3. J. Aspnes and G. Shah. Skip graphs. Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.
4. A. Bharambe, M. Agrawal and S. Seshan. Mercury: Supporting Scalable Multi-Attribute Range Queries. ACM SIGCOMM 2004, Aug. 2004.
5. N. Daswani, H. Garcia-Molina and B. Yang. Open Problems in Data-sharing Peer-to-peer Systems. ICDT 2003, Jan. 2003.
6. P. Ganesan, M. Bawa, and H. Garcia-Molina. On-line Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. VLDB 2004.
7. A. Ghodsi, L. O. Alima and S. Haridi. Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks. In 38th International HICSS Conference.
8. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating Latency between Arbitrary Internet End Hosts. Proceedings of the 2nd Usenix/ACM SIGCOMM Internet Measurement Workshop, Nov. 2002.
9. N. Harvey, M. Jones, M. Theimer and A. Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems (USITS), Mar. 2003.
10. D. Karger, E. Lehman, T. Leighton, R. Panigrah, M. Levine and D. Lewin. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In 29th Annual ACM Sympos. Theory of Comp., 654-663, May 1997.
11. D. Karger and M. Ruhl. Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. IPTPS 2004, Feb. 2004.
12. J. Li, J. Stribling, T. M. Gil, R. Morris, and M.F. Kaashoek. Comparing the performance of distributed hash tables under churn. IPTPS 2004, Feb. 2004.
13. J. Li, J. Stribling, R. Morris, M.F. Kaashoek, and T. M. Gil. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. Infocom, May. 2005.
14. S. Ratnasamy, S. Shenker, and I. Stoica. Routing algorithms for DHTs: Some open questions. IPTPS 2002, Mar. 2002.
15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. ACM SIGCOMM 2001, Aug. 2001.
16. C. Schmidt and M. Parashar. Enabling flexible queries with guarantees in P2P systems. IEEE Internet Computing, 19-26, May/June 2004.
17. I. Stoica, R. Morris, M.F. Kaashoek D. Karger, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet application. ACM SIGCOMM 2001, Aug. 2001.