Author:
Kempe David,McSherry Frank
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference27 articles.
1. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: Proc. ACM–SIGCOMM Conference, 2001, pp. 161–172
2. A. Rowstron, P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proc. 18th IFIP/ACM Intl. Conf. on Distributed Systems Platforms, Middleware 2001, 2001, pp. 329–350
3. I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proc. ACM–SIGCOMM Conference, 2001, pp. 149–160
4. B. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Tech. Rep. UCB/CSD-01-1141, UC Berkeley, 2001
5. The anatomy of a large-scale hypertextual web search engine;Brin;Comput. Netw. ISDN Systems,1998
Cited by
85 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献