Symphony: Distributed hashing in a small world

4th USENIX Symposium on Internet Technologies and Systems, USITS 2003

Volumn , Issue , 2003, Pages

  Manku, Gurmeet Singh ^a   Bawa, Mayank ^a   Raghavan, Prabhakar ^b  

^a STANFORD UNIVERSITY   (United States)

^b Verity Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

A-RINGS; DISTRIBUTED HASH TABLE; HARMONIC DISTRIBUTION; SMALL WORLDS;

WIDE AREA NETWORKS;

EID: 84924089521     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. L. Barriere, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient routing in networks with long range contacts. In Proc. 15th Intl. Symp. on Distributed Computing (DISC 01), pages 270{284,2001.
2. M. Bawa, G. S. Manku, and P. Raghavan. SETS: Search Enhanced by Topic Segmentation. Submitted for publication, 2003.
3. W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. In ACM SIGMETRICS 2000, pages 34{43, 2000.
4. I. Clarke, T. Hong, S. Miller, O. Sandberg, and B. Wiley. Protecting Free Expression Online with Freenet. IEEE Internet Computing, 6(1):40{49, 2002.
5. R. Cox, A. Muthitacharoen, and R. T. Morris. Serving dns using a peer-to-peer lookup service. In Proc. 1st Intl. Workshop on Peer-to-Peer Systems (IPTPS 2002), pages 155-165, 2002.
6. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. 18th ACM Symposium on Operating Systems Principles (SOSP 2001), pages 202-215, 2001.
7. S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. Scalable, distributed data structures for internet service construction. In Proc. 4th Symposium on Operating System Design and Implementation (OSDI 2000), pages 319-332, 2000.
8. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pages 41-52, 2002.
9. S. Iyer, A. I. T. Rowstron, and P. Druschel. Squirrel: A decentralized, peer-to-peer web cache. In Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pages 213-222, 2002.
10. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. 32nd ACM Symposium on Theory of Computing (STOC 2000), pages 163-170, 2000.
11. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proc. 9th Intl. conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), pages 190-201, 2000.
12. W. Litwin, M. Neimat, and D. A. Schneider. Lh∗-a scalable, distributed data structure. A CM Transactions on Database Systems, 21(4):480-525, 1996.
13. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proc 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pages 183-192, 2002.
14. S. Milgram. The small world problem. Psychology Today, 67(1), 1967.
15. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), pages 311-320, 1997.
16. S. Ratnasamy, P. Francis, M. Handley, and R. M. Karp. A Scalable Content-Addressable Network. In Proc. ACM SIGCOMM 2001, pages 161-172, 2001.
17. S. Ratnasamy, S. Handley, R. M. Karp, and S. Shenker. Application-level multicast using content addressable networks. In Proc. 3rd Intl. Networked Group Communication Workshop (NGC 2001), pages 14-29, 2001.
18. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), pages 329-350, 2001.
19. A. I. T. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc 18th ACM Symposium on Operating Systems Principles (SOSP 2001), pages 188-201, 2001.
20. A. I. T. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel. SCRIBE: The design of a large-scale event notification infrastructure. In Proc. 3rd Intl. Networked Group Communication Workshop (NGC 2001), pages 30-43, 2001.
21. S. Saroiu, P. Gummadi, and S. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of the Multimedia Computing and Networking (MMCN'02), 2002.
22. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM 2001, pages 149-160, 2001.
23. S. Zhang, B. Zhao, B. Joseph, R. H. Katz, and J. Kubiatowicz. Bayeux: An architecture for wide-area, fault-tolerant data dissemination. In Proc. 11th Intl. Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001), pages 11-20, 2001.