Shortcuts: Using soft state to improve DHT routing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3293, Issue , 2004, Pages 44-62

  Tati, Kiran ^a   Voelker, Geoffrey M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TELECOMMUNICATION NETWORKS;

CONTENT DELIVERY; DHT ROUTING; DISTRIBUTED HASH TABLE; ROUTE REQUESTS; ROUTING LATENCY; ROUTING PERFORMANCE; ROUTING TABLE; WEB CACHE;

WORLD WIDE WEB;

EID: 35048861938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30471-5_4     Document Type: Article

References (27)

1. R. Bhagwan, S. Savage, and G. M. Voelker. Understanding availability. In 2nd International Workshop on Peer-to-Peer Systems, Feb. 2003.
2. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. Splitstream: High-bandwidth multicast in cooperative environments. In 19th ACM Symposium on Operating Systems Principles, Oct. 2003.
3. R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris. Practical, distributed network coordinates. In proceedings of Second Workshop on Hot Topics in Networks, Nov. 2003.
4. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris. Designing a dht for low latency and high throughput. In ACM/USENIX Symposium on Networked Systems Design and Implementation, Mar. 2004.
5. F. D. Emil Sit and J. Robertson. Usenetdht: A low overhead usenet server. In 3rd International Workshop on Peer-to-Peer Systems, Feb. 2004.
6. A. Gupta, B. Liskov, and R. Rodrigues. Efficient routing for peer-to-peer overlays. In ACM/USENIX Symposium on Networked Systems Design and Implementation, Mar. 2004.
7. I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse. Kelips: Building an efficient and stable p2p dht through increased memory and background overhead. In 2nd International Workshop on Peer-to-Peer Systems, Feb. 2003.
8. S. Iyer, A. Rowstron, and P. Druschel. Squirrel: A decentralized and peer-to-peer web cache. In 21st ACM Symposium on Principles of Distributed Computing, July 2002.
9. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal hash table. In 2nd International Workshop on Peer-to-Peer Systems, Feb. 2003.
10. M. F. Kaashoek and R. Morris. http://www.pdos.lcs.mit.edu/chord/.
11. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: High bandwidth data dissemination using an overlay mesh. In 19th ACM Symposium on Operating Systems Principles, Oct. 2003.
12. S. S. Krishna P. Gummadi and S. D. Gribble. King: Estimating latency between arbitrary internet end hosts. In 2nd Internet Measurement Workshop, Nov. 2002.
13. J. Li, B. T. Loo, J. M. Hellerstein, M. F. Kaashoek, D. R. Karger, and R. Morris. On the feasibility of peer-to-peer web indexing and search. In 2nd International Workshop on Peer-to-Peer Systems, Feb. 2003.
14. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Observations on the dynamic evolution of peer-to-peer networks. In First International Workshop on Peer-to-Peer Systems, Mar. 2002.
15. B. T. Loo, S. Krishnamurthy, and O. Cooper. Distributed web crawling over dhts. Technical Report UCB/CSD-4-1305, UC Berkeley, 2004.
16. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In 21st ACM Symposium on Principles of Distributed Computing, July 2002.
17. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In 4th USENIX Symposium on Internet Technologies and Systems, Mar. 2003.
18. P. Maymounkov and D. Mazires. Kademlia: A peer-to-peer information system based on the xor metric. In 1st International Workshop on Peer-to-Peer Systems, Mar. 2002.
19. J. McCaleb. http://www.overnet.com/.
20. A. Mizrak, Y. Cheng, V. Kumar, and S. Savage. Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In IEEE Workshop on Internet Applications, June 2003.
21. V. Ramasubramanian and E. G. Sirer. Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In ACM/USENIX Symposium on Networked Systems Design and Implementation, Mar. 2004.
22. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In proceedings of ACM SIGCOMM, Aug. 2001.
23. M. Roussopoulos and M. Baker. Cup: Controlled update propagation in peer-to-peer networks. In USENIX Annual Technical Conference, June 2003.
24. A. 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), Nov. 2001.
25. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In proceedings of ACM SIGCOMM, Aug. 2001.
26. D. E. William J. Bolosky, John R. Douceur and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. In Proceedings of SIGMETRICS, June 2000.
27. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001.