See this document in CiteSeerX!

Symphony: Distributed Hashing in a Small World (2003)  (Make Corrections)  (42 citations)
Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan



  Home/Search   Context   Related

 
View or download:
stanford.edu/~bawa/./Pub/symphony.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  stanford.edu/~bawa...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance contacts drawn from a family of harmonic distributions. Through simulation, we demonstrate that our construction is scalable, flexible, stable in the presence of frequent updates and offers small average latency with only a handful of long distance links per node. The cost of updates when hosts join and... (Update)

Cited by:   More
Active and Concurrent Topology Maintenance - Xiaozhou Li Jayadev   (Correct)
Concurrent Maintenance of Rings - Xiaozhou Li Jayadev   (Correct)
Heterogeneity and Load Balance - In Distributed Hash   (Correct)

Active bibliography (related documents):   More   All
0.2:   Peer-to-Peer Overlay Networks: A Survey - Chonggang Wang Bo   (Correct)
0.2:   NoN-Greedy Routing Algorithms Are Optimal or Know thy.. - Naor, Wieder (2003)   (Correct)
0.2:   Dynamic Lookup Networks - Malkhi (2002)   (Correct)

Similar documents based on text:   More   All
1.1:   SETS: Search Enhanced by Topic Segmentation - Bawa, Manku, Raghavan (2003)   (Correct)
0.4:   Mining Significant Associations in Large Scale Text Corpora - Prabhakar Raghavan Verity   (Correct)
0.4:   Routing Networks for Distributed Hash Tables - Manku (2003)   (Correct)

Related documents from co-citation:   More   All
37:   Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
27:   A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
23:   Viceroy: A scalable and dynamic emulation of the butterfly - MALKHI, NAOR et al. - 2002

BibTeX entry:   (Update)

G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003. http://citeseer.ist.psu.edu/manku03symphony.html   More

@misc{ manku03symphony,
  author = "G. Manku and M. Bawa and P. Raghavan",
  title = "Symphony: Distributed hashing in a small world",
  text = "G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in
    a small world. Proc. 4th USENIX Symposium on Internet Technologies and Systems
    (USITS 2003.",
  year = "2003",
  url = "citeseer.ist.psu.edu/manku03symphony.html" }
Citations (may not include all citations):
1225   Chord: A scalable peer-to-peer lookup service for internet a.. - Stoica, Morris et al. - 2001
1023   A Scalable Content-Addressable Network - Ratnasamy, Francis et al. - 2001
449   Oceanstore: An architecture for global-scale persistent stor.. - Kubiatowicz, Bindel et al. - 2000
342   Wide-area cooperative storage with CFS - Dabek, Kaashoek et al. - 2001
338   A measurement study of peer-to-peer file sharing systems - Saroiu, Gummadi et al. - 2002
282   Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaraman et al. - 1997
280   persistent peer-to-peer storage utility (context) - Rowstron, Druschel et al. - 2001
144   Application-level multicast using content addressable networ.. - Ratnasamy, Handley et al. - 2001
128   on and P. Druschel. Pastry: Scalable, decentralized object l.. (context) - Rowstr - 2001
128   Viceroy: A scalable and dynamic emulation of the butterfly - Malkhi, Naor et al. - 2002
123   SCRIBE: The design of a large-scale event notification infra.. - Rowstron, Kermarrec et al. - 2001
117   The small world problem (context) - Milgram - 1967
116   Feasibility of a serverless distributed file system deployed.. (context) - Bolosky, Douceur et al. - 2000
96   The small-world phenomenon: An algorithmic perspective - Kleinberg - 2000
84   distributed data structures for internet service constructio.. (context) - Gribble, Brewer et al. - 2000
81   Distributed object location in a dynamic network - Hildrum, Kubiatowicz et al. - 2002
39   Protecting Free Expression Online with Freenet - Clarke, Hong et al. - 2002
26   Serving dns using a peer-to-peer lookup service - Cox, Muthitacharoen et al. - 2002
26   ACM Transactions on Database Systems (context) - Litwin, Neimat et al. - 1996
23   peer-to-peer web cache (context) - Iyer, Rowstron et al. - 2002
14   SETS: Search Enhanced by Topic Segmentation - Bawa, Manku et al. - 2003
11   fault-tolerant data dissemination (context) - Zhang, Zhao et al. - 2001
4   Efficient routing in networks with long range contacts (context) - Barriere, Fraigniaud et al. - 2001



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www-db.stanford.edu/~bawa/publications.html):   More
Transience of Peers and Streaming Media - Bawa, Deshpande, Garcia-Molina (2002)   (Correct)
SETS: Search Enhanced by Topic Segmentation - Bawa, Manku, Raghavan (2003)   (Correct)
Make it Fresh, Make it Quick - Searching a Network of.. - Bawa, Bayardo, Jr. (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC