Stable high-capacity one-hop distributed hash tables

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2006, Pages 687-694

  Risson, John ^a   Harwood, Aaron ^b   Moors, Tim ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TABLES; HIERARCHICAL SYSTEMS; INTERNET; RESOURCE ALLOCATION; TABLE LOOKUP;

DISTRIBUTED HASH TABLES (DHT); INTERNET DATA CENTERS; ONE HOP FEDERATION (1HF);

DISTRIBUTED DATABASE SYSTEMS;

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

References (36)

1. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for Internet applications, IEEE/ACM Trans. on Networking 11(1) (2003) 17-32.
2. B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, Tapestry: A Resilient Global-Scale overlay for Service Deployment, IEEE Journal on Selected Areas in Communications 22 (1) (2004) 41-53.
3. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content-addressable network, Proc. of the conf. on Applications, technologies, architectures and protocols for computer communications, August 27-31 2001, pp. 161-172.
4. A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, IFIP/ACM Middleware 2001, Nov 2001.
5. S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, OpenDHT: a public DHT service and its uses, Proc. of the conf. on Applications, technologies, architectures and protocols for computer communications, Aug 22-26 2005, pp. 73-84.
6. W. Litwin, M.-A. Niemat, and D. Schneider, LH* - Linear Hashing for Distributed Files, Proc. ACM Int'l Conf. on Management of Data SIGMOD, May 1993.
7. R. Devine, Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm, Proc. 4th Int'l Conf. on Foundations of Data Organizations and Algorithms 1993.
8. S. Gribble, E. Brewer, J. M. Hellerstein, and D. Culler, Scalable, Distributed Data Structures for Internet Service Construction, Proc. 4th Symp. on Operating Systems Design and Implementation OSDI 2000, October 2000.
9. W. Litwin, R. Moussa, and T. Schwarz, LH*RS - a highly-available scalable distributed data structure, ACM Trans. on Database Systems 30 (3) (2005) 769-811.
10. A. Gupta, B. Liskov, and R. Rodrigues, Efficient Routing for Peer-to-Peer Overlays, First Symp. on Networked Systems Design and Implementation NSDI, March 2004.
11. C. Tang, M. Buco, R. Chang, S. Dwarkadas, L. Luan, E. So, and C. Ward, Low traffic overlay networks with large routing tables, Proc. of ACM Sigmetrics Int'l Conf. on Measurement and Modeling of Comp. Sys., Jun 6-10 2005, pp. 14-25.
12. A. C. Huang and A. Fox, Cheap recovery: a key to self-managing state, ACM Trans. on Storage 1 (1) (2004) 38-70.
13. A. Tanenbaum and M. van Steen, Distributed Systems: Principles and Paradigms. Prentice Hall, Upper Saddle River, New Jersey, USA, 2002.
14. G. S. Manku, M. Bawa, and P. Raghavan, Symphony: Distributed Hashing in a Small World, Proc. 4th USENIX Symp. on Internet Technologies and Systems, March 26-28 2003.
15. J. Li, J. Stribling, R. Morris, F. Kaashoek, and T. Gil, A performance vs. cost framework for evaluating DHT design tradeoffs under churn, Proc. IEEE Infocom, Mar 13-17 2005.
16. E. Brewer, Lessons from Giant-Scale Services, IEEE Internet Computing 5 (4) (2001) 46-55.
17. E. Brewer, "Combining systems and databases: a search engine retrospective," in Readings in Database Systems, 4th ed, 2004.
18. R. Rodrigues and C. Blake, When Multi-Hop Peer-to-Peer Lookup Matters, The 3rd Int'l Workshop on Peer-to-Peer Systems, San Diego, CA, USA, February 26-27 (2004)
19. D. Loguinov, J. Casas, and X.-M. Wang, Graph-theoretic analysis of structured systems: routing distances and fault resilience, IEEE-ACM. Trans. on Networking 13 (5) (2005) 1107-1120.
20. S. Deering and D. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Trans. on Computer Systems 8 (2) (1990) 85-110.
21. B. Levine and J. J. Garcia-Luna-Aceves, A comparison of reliable multicast protocols, Multimedia Systems 6 (1998) 334-348.
22. M. Balakrishnan, S. Pleisch, and K. Birman, Slingshot: time-critical multicast for clustered applications, IEEE Network Computing and Applications 2005.
23. P. Yalagandula, S. Nath, H. Yu, P. Gibbons, and S. Srinivasan, Beyond availability: towards a deeper understanding of machine failure characteristics in large distributed system, Proc. First Workshop on Real, Large Distributed Systems, December 2004.
24. C. Yoshikawa, B. Chun, P. Eastham, A. Vahdat, T. Anderson, and D. E. Culler, Using smart clients to build scalable services, Proc. of the Usenix Annual Technical Conference, Jan 1997.
25. K. Ostrowski, K. Birman, and A. Phanishayee, The power of indirection: achieving multicast scalability by mapping groups to regional underlays, (2005)
26. J. Li, J. Stribling, R. Morris, and F. Kaashoek, Bandwidth-efficient management of DHT routing tables, Proc. 2nd Symposium on Networked Systems Design and Implementation, May 2-4 2005.
27. V. Ramasubramanian and E. Sirer, The Design and Implementation of a Next Generation Name Service for the Internet, ACM SIGCOMM 2004, Portland, Oregon, USA, August 30-September 3 2004.
28. J. Risson, S. Qazi, T. Moors, and A. Harwood, A Dependable Global Location Service using Rendezvous on Hierarchic Distributed Hash Tables, Proc. of the IEEE 5th International Conference on Networking, Apr 23-28 2006.
29. J. Pujol, S. Schmid, L. Eggert, M. Brunner, and J. Quittek, Scalability analysis of the TurfNet naming and routing architecture, Proc. of the 1st ACM workshop on Dynamic Interconnection of Networks, Sep 2005, pp. 28-32.
30. G. Ballintijn, M. Van Steen, and A. Tanenbaum, Exploiting Location Awareness for Scalable Location-Independent Object IDs, Proc. Fifth ASCI Ann. Conf. 1999, pp. 321-328.
31. T. Deegan, J. Crowcroft, and A. Warfield, The main name system: an exercise in centralized computing, ACM SIGCOMM Computer Communication Review 35 (3) (2005) 5-14.
32. M. van Steen, F. Hauck, P. Homburg, and A. Tanenbaum, Locating Objects in Wide-Area Systems, IEEE Communications Magazine (1998)
33. A. Mislove and P. Druschel, Providing administrative control and autonomy in structured peer-to-peer overlays, The 3rd Int'l Workshop on Peer-to-Peer Systems, June 9-12 2004.
34. L. Garces-Erice, E. W. Biersack, K. Ross, P. Felber, and G. Urvoy-Keller, Hierarchical P2P Systems, Proc. ACM/IFIP Int'l Conf. on Para, and Dist. Comp., Aug 2003.
35. N. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman, SkipNet: A Scalable Overlay Network with Practical Locality Properties, Proc. Fourth USENIX Symp. on Internet Technologies and Systems USITS'03, March 2003.
36. H. Ballani and P. Francis, Towards a global IP anycast service, Proc. Of ACM SIGCOMM 2005, Aug 22-26 2005.