D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of the Symposium on Theory of Computing, May 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Chord: A Scalable Peer-to-Peer Lookup Protocol for .. - Stoica, Morris.. (2001) (61 citations) Self-citation (Karger) (Correct)
No context found.
KARGER, D., LEHMAN, E., LEIGHTON, F., LEVINE, M., LEWIN, D., AND PANIGRAHY, R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, TX, May 1997), pp. 654--663.
D1HT: A Distributed One Hop Hash Table - And (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of the Symposium on Theory of Computing, May 1997.
Democratizing content publication with Coral - Michael Freedman Eric (2004) (20 citations) (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In STOC, May 1997.
Heterogeneity and Load Balance - In Distributed Hash (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing, pages 654--663, May 1997.
D1HT: A Distributed One Hop Hash Table - Monnerat, Amorim (2005) (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of the Symposium on Theory of Computing, May 1997.
Heterogeneity and Load Balance - In Distributed Hash (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing, pages 654--663, May 1997.
OASIS: Anycast for Any Service - Michael Freedman Karthik (2006) (2 citations) (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In STOC, May 1997.
USENIX Association - Usits Th Usenix (1992) (2 citations) (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigraphy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual STOC, May 1997.
Designing Semantic Publish/Subscribe Networks Using.. - Chirita, Idreos.. (2005) (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 654--663, El Paso, Texas, 4--6 May 1997.
Self-Stabilizing Structured Ring Topology P2P Systems - And (2005) (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing, pages 654--663, May 1997.
Distributed Algorithms and Educational Simulation/Visualisation.. - Koldehofe (2005) (Correct)
No context found.
Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., and Panigrahy, R. 1997. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing. El Paso, Texas, 654--663.
WebSOS: An Overlay-based System for Protecting Web .. - Stavrou, Cook.. (2005) (1 citation) (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, R. Panigrahy, M. Levine, D. Lewin, Consistent Hashing and Random Trees: Distributed Caching Protocols for Relievig Hot Spots on the World Wide Web, in: Proceedings of ACM Symposium on Theory of Computing (STOC), 1997, pp. 654--663. URL citeseer.nj.nec.com/karger97consistent.html
Distributed Selfish Replication - Laoutaris, Telelis, Zissimopoulos.. (2005) (Correct)
No context found.
D. Karger, E. Lehman, F.T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web," in Proceedings of the 29th Annual Symposium on Theory of Computing (ACM STOC), May 1996, pp. 654--663.
On The Feasibility of Distributed Intrusion Detection - Columbia University Dnad (2004) (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relievig Hot Spots on the World Wide Web. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 654--663, May 1997. 29
A Protocol for Improved User Perceived QoS in Web.. - Romano, Quaglia, Ciciani (2004) (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levin, D. Lewin and R. Panigrahy, "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web", Proc. of ACM STOC, 1997.
A Case for Virtualized Arrays of RAID - Brinkmann, Salzwedel, Vodisek (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC), pages 654--663, 4--6 May 1997.
Dynamic Load Balancing in Distributed Hash Tables - Bienkowski, Korzeniowski.. (2004) (1 citation) (Correct)
No context found.
D. R. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pages 654--663, May 1997.
A Survey of Trust Management and Resource Discovery.. - Suryanarayana, Taylor (2004) (Correct)
No context found.
Karger, D. R., Lehman, E., et al. (1997). Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. ACM Symposium on Theory of Computing, ACM Press. 56
Distributed, Secure Load Balancing with Skew, Heterogeneity.. - Ledlie, Seltzer (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In ACM Symposium on Theory of Computing, El Paso, TX, May 1997.
WebSOS: An Overlay-based System for Protecting Web .. - Stavrou, Cook.. (2005) (1 citation) (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, R. Panigrahy, M. Levine, D. Lewin, Consistent Hashing and Random Trees: Distributed Caching Protocols for Relievig Hot Spots on the World Wide Web, in: Proceedings of ACM Symposium on Theory of Computing (STOC), 1997, pp. 654--663. URL citeseer.nj.nec.com/karger97consistent.html
Decentralized Software Architecture - Khare (Correct)
No context found.
Karger, D. R., Lehman, E., Leighton, F. T., Panigrahy, R., Levine, M. S., Lewin, D., "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web, " STOC 1997, pp654-663
Distributed, Secure Load Balancing with Skew, Heterogeneity.. - Ledlie, Seltzer (2004) (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In ACM Symposium on Theory of Computing, El Paso, TX, May 1997.
Information Leak in the Chord Lookup Protocol - O'Donnell, Vaikuntanathan (2004) (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed cachine protocols for relieving hot spots on the world wide web. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 654--663, 1997.
An Agenda for Robust Peer-to-Peer Storage - Rodrigo Rodrigues Massachusetts (Correct)
No context found.
D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 654--663, El Paso, TX, May 1997.
Reliable Peer-to-Peer Information Monitoring through Replication - Gedik, Liu (2003) (Correct)
No context found.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing Author Index, 1997.
First 50 documents Next 50
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