EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management

Computer Communications

Volumn 29, Issue 9 SPEC. ISS., 2006, Pages 1243-1259

  Leong, Ben ^a   Liskov, Barbara ^a   Demaine, Erik D ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distributed Hash Table (DHT); Overlay network

Indexed keywords

ALGORITHMS; COSTS; QUERY LANGUAGES; TOPOLOGY;

DISTRIBUTED HASH TABLE (DHT); OVERLAY NETWORK; PARALLEL QUERIES;

ROUTERS;

EID: 33646408149     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2005.10.002     Document Type: Article

References (25)

1. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A. scalable content-addressable network, in: Proceedings of the 2001 ACM SIGCOMM Conference, 2001.
2. I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, Chord: a scalable Peer-To-Peer lookup service for internet applications, in: Proceedings of the 2001 ACM SIGCOMM Conference, 2001, pp. 149-160.
3. B.Y. Zhao, J.D. Kubiatowicz, A.D. Joseph, Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.
4. A. Rowstron, P. Druschel, Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 2001.
5. D. Malkhi, M. Naor, D. Ratajczak, Viceroy: a scalable and dynamic emulation of the butterfly, in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC '02), 2002.
6. P. Maymounkov, D. Mazieres, Kademlia: a peer-to-peer information system based on the xor metric, in: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), 2002.
7. G. Manku, M. Bawa, P. Raghavan, Symphony: distributed hashing in a small world, in: Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003.
8. G.S. Manku, Routing networks for distributed hash tables, in: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), ACM, Boston, Massachusetts, 2003.
9. I. Gupta, K. Birman, P. Linga, A. Demers, R. van Renesse, Kelips: building an efficient and stable P2P DHT through increased memory and background overhead, in: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), 2003.
10. F. Kaashoek, D. Karger, Koorde: a simple degree-optimal distributed hash table, in: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), 2003.
11. N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, A. Wolman, Skipnet: a scalable overlay network with practical locality properties, in: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems (USITS '03), 2003.
12. A. Mizrak, Y. Cheng, V. Kumar, S. Savage, Structured superpeers: leveraging heterogeneity to provide constant-time lookup, in: Proceedings of the 4th IEEE Workshop on Internet Applications, 2003.
13. A. Gupta, B. Liskov, R. Rodrigues, Efficient routing for peer-to-peer overlays, in: Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), 2004, pp. 113-126.
14. K. Gummadi, G. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, I. Stoica, The impact of DHT routing geometry on resilience and proximity, in: Proceedings of the 2003 ACM SIGCOMM Conference, 2003, pp. 381-394.
15. R. Cox, F. Dabek, F. Kaashoek, J. Li, R. Morris, Practical, distributed network coordinates, in: Proceedings of the Second Workshop on Hot Topics in Networks (HotNets-II), ACM SIGCOMM, Cambridge, Massachusetts, 2003.
16. T. Ng, H. Zhang, Towards global network positioning, in: Proceedings of the IEEE Infocom'02, 2002.
17. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, B. Zhao, Oceanstore: an architecture for global-scale persistent storage, in: Proceedings of the ACM ASPLOS, ACM, 2000.
18. F. Dabek, J. Li, E. Sit, J. Robertson, M.F. Kaashoek, R. Morris, Designing a DHT for low latency and high throughput, in: Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), 2004, pp. 85-98.
19. F. 180-1, Secure hash standard, Technical report, US Department of Commerce/NIST, http://www.itl.nist.gov/fipspubs/fip180-1.htm, April 1995.
20. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M.F. Kaashoek, F. Dabek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, Technical report, MIT LCS, 2002.
21. S. Saroiu, P.K. Gummadi, S.D. Gribble, A measurement study of peer-to-peer file sharing systems, in: Proceedings of the Multimedia Computing and Networking 2002 (MMCN'02), San Jose, CA, USA, 2002.
22. ssfnet.org, Scalable simulation framework, http://www.ssfnet.org.
23. J. Li, J. Stribling, R. Morris, M.F. Kaashoek, T.M. Gil, DHT routing tradeoffs in network with churn, in: Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04), 2004.
24. L. Zhuang, F. Zhou, Understanding Chord performance and topology-aware overlay construction for Chord, http://www.cs.berkeley.edu/∼zf/papers/chord_perf.pdf, 2003.
25. M. Harchol-Balter, T. Leighton, D. Lewin, Resource discovery in distributed networks, in: Proceedings of the 18th annual ACM Symposium on Principles of Distributed Computing (PODC 1999), ACM Press, 1999, pp. 229-237.