A survey of DHT security techniques

ACM Computing Surveys

Volumn 43, Issue 2, 2011, Pages

  Urdaneta, Guido ^a   Pierre, Guillaume ^a   Van Steen, Maarten ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Distributed hash tables; Eclipse attack; Peer to peer systems; Secure P2P routing and storage; Sybil attack

Indexed keywords

COMPUTER CRIME; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; NETWORK SECURITY; PEER TO PEER NETWORKS;

DISTRIBUTED HASH TABLE; ECLIPSE ATTACK; NETWORK-BASED; PEER-TO-PEER NETWORKS; PEER-TO-PEER SYSTEM; ROUTINGS; SECURE P2P ROUTING AND STORAGE; SECURITY ATTACKS; SYBIL ATTACK; TABLE-BASED SYSTEMS;

SURVEYS;

EID: 79551699813     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/1883612.1883615     Document Type: Article

References (91)

1. ANDERSON, D. P. AND FEDAK, G. 2006. The computational and storage potential of volunteer computing. In Proceedings ot the 6th International Symposium on Cluster Computing and the Grid. IEEE Computer Society Press, Los Alamitos, CA, 73-80. (Pubitemid 44761684)
2. ANTONY, S., AGRAWAL, D., AND ABBADI, A. E. 2008. P2P systems with transactional semantics. In Proceedings of the 11th International Conference on Extended Database Technology. ACM Press, New York, NY, 4-15. (Pubitemid 351661687)
3. AWERBUCH, B. AND SCHEIDELER, C. 2004. Group spreading: A protocol for provably secure distributed name service. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes on Computer Science, vol. 3142. Springer-Verlag, Berlin, Germeny, 183-195.
4. AWERBUCH, B. AND SCHEIDELER, C. 2006. Towards a scalable and robust DHT. In Proceedings of the 18th Symposium on Parallel Algorithms and Applications. ACM Press, New York, NY, 318-327. (Pubitemid 44535663)
5. AWERBUCH, B. AND SCHEIDELER, C. 2007. Towards scalable and robust overlay networks. In Proceedings of the 6th International Workshop on Peer-to-Peer Systems.
6. BAUMGART, I. AND MIES, S. 2007. S/Kademlia: A practicable approach towards secure key-based routing. In Proceedings of the 13th International Conference on Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos, CA, 2:1-8.
7. BAZZI, R. A. AND KONJEVOD, G. 2005. On the establishment of distinct identities in overlay networks. In Proceedings of the 24th Symposium on Principles of Distributed Computing. ACM Press, New York, NY, 312-320. (Pubitemid 43218411)
8. BAZZI, R. A., RI CHOI, Y., AND GOUDA, M. G. 2006. Hop chains: Secure routing and the establishment of distinct identities. In Proceedings of the 10th International Conference on Principles of Distributed Systems. Lecture Notes on Computer Science, vol. 4305. Springer-Verlag, Berlin, Germany, 365-379.
9. BLAKE, C. AND RODRIGUES, R. 2003. High Availability, scalable storage, dynamic peer networks: Pick two. In Proceedings of the 9th Conference on Hot Topics in Operating Systems. USENIX, Berkeley, CA, 1-6.
10. BORISOV, N. 2006. Computational puzzles as sybil defenses. In Proceedings of the 6th International Conference on Peer-to-Peer Computing. IEEE Computer Society Press, Los Alamitos, CA, 171-176.
11. CAI, M., CHERVENAK, A., AND FRANK, M. 2004. A peer-to-peer replica location service based on a distributed hash table. In Proceedings of the 18th International Conference on Supercomputing. IEEE Computer Society Press, Los Alamitos, CA, 56.
12. CASTRO, M., COSTA, M., AND ROWSTRON, A. 2004. Performance and dependability of structured peer-to-peer overlays. In Proceedings of the International Conference on Dependable Systems and Networks. IEEE Computer Society Press, Los Alamitos, CA, 9-18.
13. CASTRO, M., DRUSCHEL, P., GANESH, A., ROWSTRON, A., AND WALLACH, D. S. 2002a. Secure routing for structured peer-to-peer overlay networks. In Proceedings of the 5th Symposium on Operating System Design and Implementation. ACM Press, New York, NY, 299-314.
14. CASTRO, M., DRUSCHEL, P., KERMARREC, A.-M., AND ROWSTRON, A. 2002b. Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE J. Select. Areas Comm. 20, 8, 100-110.
15. CASTRO, M. AND LISKOV, B. 2002. Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20, 4, 398-461. (Pubitemid 135702591)
16. CERRI, D., GHIONI, A., PARABOSCHI, S., AND TIRABOSCHI, S. 2005. ID mapping attacks in P2P networks. In Proceedings of the Global Telecommunications Conference (GLOBECOM). IEEE Computer Society Press, Los Alamitos, CA.
17. CONDIE, T., KACHOLIA, V., SANKARARAMAN, S., HELLERSTEIN, J., AND MANIATIS, P. 2006. Induced churn as shelter from routing table poisoning. In Proceedings of the 13th Symposium on Network and Distributed System Security. The Internet Society, San Diego, CA.
18. CROSBY, S. AND WALLACH, D. S. 2007. An analysis of BitTorrent's two kademlia-based DHTs. Tech. rep. TR-07-04. Department of Computer Science, Rice University, Houston.
19. DABEK, F., KAASHOEK, M. F., KARGER, D., MORRIS, R., AND STOICA, I. 2001. Wide-area cooperative storage with CFS. In Proceedings of the 18th Symposium on Operating System Principles. ACM Press, New York, NY.
20. DABEK, F., LI, J., SIT, E., ROBERTSON, J., KAASHOEK, M. F., AND MORRIS, R. 2004. Designing a DHT for low latency and high throughput. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation. USENIX, Berkeley, CA, 85-98.
21. DAHAN, S. AND SATO, M. 2007. Survey of six myths and oversights about distributed hash tables' security. In Proceedings of the 27th International Conference on Distributed Computing Systems Workshops. IEEE Computer Society Press, Los Alamitos, CA, 26.
22. DANEZIS, G., LESNIEWSKI-LAAS, C., KAASHOEK, M. F., AND ANDERSON, R. J. 2005. Sybil-resistant DHT Routing. In Proceedings of the 10th European Symposium on Research in Computer Security. Lecture Notes on Computer Science. Springer-Verlag, Berlin, Germany, 305-318.
23. DASWANI, N. 2004. Denial-of-service (DoS) attacks and commerce infrastructure in peer-to-peer networks. Ph.D. dissertation, Dept. of Computer Science, Stanford University, Stanford, CA.
24. DEMERS, A., GREENE, D., HAUSER, C., IRISH, W., LARSON, J., SHENKER, S., STURGIS, H., SWINEHART, D., AND TERRY, D. 1987. Epidemic algorithms for replicated database maintenance. In Proceedings of the 6th Symposium on Principles of Distributed Computing. ACM Press, New York, NY, 1-12.
25. DINGER, J. AND HARTENSTEIN, H. 2006. Defending the Sybil attack in P2P networks: Taxonomy, challenges, and a proposal for self-registration. In Proceedings of the 1st International Conference on Availability, Reliability and Security. IEEE Computer Society Press, Los Alamitos, CA, 756-763. (Pubitemid 44732717)
26. DOUCEUR, J. R. 2002. The Sybil attack. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2429. Springer-Verlag, Berlin, Germany, 251-260.
27. FIAT, A. AND SAIA, J. 2002. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the 13th Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 94-103.
28. FIAT, A. AND SAIA, J. 2007. Censorship resistant peer-to-peer networks. Theor. Comput. 3, 1, 1-23.
29. FIAT, A., SAIA, J., AND YOUNG, M. 2005. Making Chord robust to Byzantine attack. In Proceedings of the 13th Annual European Symposium on Algorithms. Lecture Notes on Computer Science, vol. 3669. Springer- Verlag, Berlin, Germany, 803-814. (Pubitemid 41491577)
30. FONSECA, R., RATNASAMY, S., ZHAO, J., EE, C. T., CULLER, D. E., SHENKER, S., AND STOICA, I. 2005. Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In Proceedings of the 2nd Symposium on Networked Systems Design and Implementation. ACM Press, New York, NY, 1-11.
31. GANESH, L. AND ZHAO, B. Y. 2005. Identity theft protection in structured overlays. In Proceedings of the 13th International Conference on Network Protocols. IEEE Computer Society Press, Los Alamitos, CA, 49-54. (Pubitemid 44461875)
32. GODFREY, B., LAKSHMINARAYANAN, K., SURANA, S., KARP, R. M., AND STOICA, I. 2004. Load balancing in dynamic structured P2P systems. In Proceedings of the 23rd Annual Joint Conference of the IEE Computer and Communications Socities (Infocom). Vol. 4. IEEE Computer Society Press, Los Alamitos, CA, 2253-2262.
33. GODFREY, P. B., SHENKER, S., AND STOICA, I. 2006. Minimizing churn in distributed systems. In Proceedings of the ACM SIGCOMM Data Communication Festival. ACM Press, New York, NY, 147-158. (Pubitemid 44623723)
34. GUMMADI, K.,GUMMADI, R.,GRIBBLE, S.,RATNASAMY, S.,SHENKER, S., AND STOICA, I. 2003. The impact of DHT routing geometry on resilience and proximity. In Proceedings of the ACM SIGCOMM Data Communication Festival. ACM Press, New York, NY, 381-394.
35. GUPTA, A., LISKOV, B., AND RODRIGUES, R. 2004. Efficient routing for peer-to-peer overlays. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation. USENIX, Berkeley, CA, 113-126.
36. GUPTA, I., BIRMAN, K. P., LINGA, P., DEMERS, A. J., AND VAN RENESSE, R. 2003. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In Proceedings of the 2nd InternationalWorkshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2735. Springer- Verlag, Berlin, Germany, 160-169.
37. HARVESF, C. AND BLOUGH, D.M. 2006. The effect of replica placement on routing robustness in distributed hash tables. In Proceedings of the 6th International Conference on Peer-to-Peer Computing. IEEE Computer Society Press, Los Alamitos, CA, 57-6.
38. HILDRUM, K. AND KUBIATOWICZ, J. 2003. Asymptotically efficient approaches to fault-tolerance in peer-topeer networks. In Proceedings of the 17th International Symposium on Distributed Computing (DISC). Lecture Notes on Computer Science, vol. 2848. Springer-Verlag, Berlin, German, 321-336.
39. HOLZ, T., STEINER, M., DAHL, F., BIERSACK, E., AND FREILING, F. 2008. Measurements and mitigation of peerto- peer-based botnets: A case study on Storm Worm. In Proceedings of the 1st USENIX Workshop on Large-Scale Exploits and Emergent Threats (LEET). USENIX, Berkeley, CA, 1-9.
40. KARGER, D. R. AND RUHL, M. 2006. Simple efficient load-balancing algorithms for peer-to-peer systems. Theor. Comput. Syst. 39, 6, 787-804. (Pubitemid 44878426)
41. KLEINBERG, J. 2000. The small-world phenomenon: An algorithm perspective. In Proceedings of the 32nd Symposium on Theory of Computing. ACM Press, New York, NY, 163-170.
42. LESNIEWSKI-LAAS, C. 2008. A Sybil-proof one-hop DHT. In Proceedings of the 1st Workshop on Social Network Systems (SocialNets). ACM Press, New York, NY, 19-24.
43. LEVINE, B. N., SHIELDS, C., AND MARGOLIN, B. N. 2006. A survey of solutions to the Sybil attack. Tech. rep. University of Massachusetts, Amherst, Amherst, MA.
44. LI, J., STRIBLING, J., MORRIS, R., KAASHOEK, M. F., AND GIL, T. M. 2005. A Performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Computer Society Press, Los Alamitos, CA. 225-236.
45. LOS ANGELES TIMES. 2006. EDonkey file-sharing network is shut down. http://articles.latimes.com/2006/sep/13/business/fi-donkey13.
46. MAHAJAN, R., RODRIG, M., WETHERALL, D., AND ZAHORJAN, J. 2004. Experiences applying game theory to system design. In Proceedings of the Workshop on Practice and Theory of Incentives in Networked Systems (PINS). ACM Press, New York, NY, 183-190. (Pubitemid 40062768)
47. MARGOLIN, N. B. AND LEVINE, B. N. 2007. Informant: Detecting Sybils using incentives. In Proceedings of the 11th International Conference on Financial Cryptography and Data Security. Lecture Notes on Computer Science, vol. 4886. Springer-Verlag, Berlin, Germany, 192-207. (Pubitemid 351153053)
48. MAYMOUNKOV, P. AND MAZIÉRES, D. 2002. Kademlia: A peer-to-peer information system based on the XOR metric. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2429. Springer-Verlag, Berlin, Germany, 53-65.
49. MESAROS, V., COLLET, R., GLYNN, K., AND VAN ROY, P. 2005. A transactional system for structured overlay networks. Tech. rep. RR2005-01, Universit Catholique de Louvain. Louvain, Belgium.
50. MILLS, B. N. AND ZNATI, T. F. 2008. SCAR-Scattering, Concealing and Recovering Data within a DHT. In Proceedings of the 41st Annual Simulation Symposium. IEEE Computer Society Press, Los Alamitos, CA, 35-42.
51. NAOR, M. AND WIEDER, U. 2003. A simple fault tolerant distributed hash table. In Proceedings of the 2nd InternationalWorkshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2735. Springer- Verlag, Berlin, Germany, 88-97.
52. PETERSON, L., BAVIER, A., FIUCZYNSKI, M. E., AND MUIR, S. 2006. Experiences building PlanetLab. In Proceedings of the 7th Symposium on Operating System Design and Implementation. USENIX, Berkeley, CA.
53. PIERRE, G. AND VAN STEEN, M. 2006. Globule: A collaborative content delivery network. IEEE Comm. Mag. 44, 8, 127-133. (Pubitemid 46405191)
54. PLANTIKOW, S., REINEFELD, A., AND SCHINTKE, F. 2007. Transactions for distributedWikis on structured overlays. In Proceedings of the 18thWorkshop onDistributed Systems: Operations and Management. Lecture Notes on Computer Science, vol. 4785. Springer-Verlag, Berlin, Germany, 256-267.
55. POUWELSE, J., GARBACKI, P., WANG, J., BAKKER, A., YANG, J., IOSUP, A., EPEMA, D., REINDERS, M., VAN STEEN, M., AND SIPS, H. 2007. Tribler: A social-based peer-to-peer system. Concurr. Comput. Pract. Exp. 20, 2, 127-138.
56. RAMASUBRAMANIAN, V. AND SIRER, E. G. 2004a. Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation. USENIX, Berkeley, CA, 99-112.
57. RAMASUBRAMANIAN, V. AND SIRER, E. G. 2004b. The design and implementation of a next generation name service for the internet. In Proceedings of the ACM SIGCOMM Data Communications Festival. ACM Press, New York, NY.
58. RAO, A., LAKSHMINARAYANAN, K., SURANA, S., KARP, R. M., AND STOICA, I. 2003. Load balancing in structured P2P systems. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2735. Springer-Verlag, Berlin, Germanny, 68-79.
59. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SCHENKER, S. 2001. A scalable content-addressable Network. In Proceedings of the ACM SIGCOMM Data Communications Festival. ACM Press, New York, NY, 161-172. (Pubitemid 32981962)
60. REIDEMEISTER, T., BOHM, K., WARD, P. A. S., AND BUCHMANN, E. 2005. Malicious behaviour in content-addressable peer-to-peer networks. In Proceedings of the 3rd Annual Communication Networks and Services Research Conference. IEEE Computer Society Press, Los Alamitos, CA, 319-326. (Pubitemid 44130672)
61. RHEA, S., GEELS, D., ROSCOE, T., AND KUBIATOWICZ, J. 2004. Handling churn in a DHT. In Proceedings of the USENIX Annual Technical Conference. USENIX, Berkeley, CA, 127-140.
62. RHEA, S. C. 2005. OpenDHT: A public DHT service. Ph.D. dissertation, University of California at Berkeley, Berkeley, CA.
63. RODRIGUES, R. AND LISKOV, B. 2005. High availability in DHTs: Erasure coding vs. replication. In Proceedings of the 4th International Workshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 3640. Springer-Verlag, Berlin, Germany, 226-239.
64. ROWAIHY, H., ENCK, W., MCDANIEL, P., AND LA PORTA, T. 2007. Limiting Sybil attacks in structured peer-to-peer networks. In Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE Computer Society Press, Los Alamitos, CA, 2596-2600. (Pubitemid 47334528)
65. ROWSTRON, A. AND DRUSCHEL, P. 2001a. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of theMiddleware Conference. Lecture Notes on Computer Science, vol. 2218. Springer-Verlag, Berlin, Germany, 329-350. (Pubitemid 33362020)
66. ROWSTRON, A. AND DRUSCHEL, P. 2001b. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th Symposium on Operating System Principles. ACM Press, New York, NY, 188-201. (Pubitemid 33612614)
67. SAIA, J., FIAT, A., GRIBBLE, S. D., KARLIN, A. R., AND SAROIU, S. 2002. Dynamically fault-tolerant content addressable networks. In Proceedings of the 1st InternationalWorkshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2429. Springer-Verlag, Berlin, Germany, 270-279.
68. SÁNCHEZ ARTIGAS, M.,GARCÍA LÓPEZ, P., AND GÓMEZ SKARMETA, A. F. 2005. A novel methodology for constructing secure multipath overlays. IEEE Internet Comput. 9, 6, 50-57. (Pubitemid 43051368)
69. SCHEIDELER, C. 2005. How to spread adversarial nodes? Rotate! In Proceedings of the 37th Symposium on Theory of Computing. ACM Press, New York, NY, 704-713. (Pubitemid 43098643)
70. SCHÜTT, T., SCHINTKE, F., AND REINEFELD, A. 2008. Scalaris: Reliable transactional P2P key/value store. In Proceedings of the 7th ACM SIGPLAN Workshop on ERLANG (ERLANG). ACM Press, New York, NY, 41-48.
71. SINGH, A., NGAN, T.-W., DRUSCHEL, P., AND WALLACH, D. S. 2006. Eclipse attacks on overlay networks: Threats and defenses. In Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communiations Societies. IEEE Computer Society Press, Los Alamitos, CA, 1-12.
72. SIT, E. AND MORRIS, R. 2002. Security considerations for peer-to-peer distributed hash tables. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2429. Springer-Verlag, Berlin, Germany, 261-269.
73. SKYPE LIMITED. 2008. Skype. http://www.skype.com.
74. SRIVATSA, M. AND LIU, L. 2004. Vulnerabilities and security threats in structured overlay networks: A quantitative analysis. In Proceedings of the 20th Annual Computer Security Applications Conference. IEEE Computer Society Press, Los Alamitos, CA, 252-261. (Pubitemid 40931080)
75. STADING, T., MANIATIS, P., AND BAKER, M. 2002. Peer-to-peer caching schemes to address flash crowds. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 2429. Springer-Verlag, Berlin, Germany, 203-213.
76. STEINER, M., BIERSACK, E. W., AND ENNAJJARY, T. 2007a. Towards scalable and robust overlay networks. In Proceedings of the 6th International Workshop on Peer-to-Peer Systems.
77. STEINER, M., EN-NAJJARY, T., AND BIERSACK, E. W. 2007b. Exploiting KAD: Possible uses and misuses. ACM Comput. Comm. Rev. 37, 5, 65-70.
78. STOICA, I., MORRIS, R., LIBEN-NOWELL, D., KARGER, D. R., KAASHOEK, M. F., DABEK, F., AND BALAKRISHNAN, H. 2003. Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Trans. Netw. 11, 1, 17-32.
79. SZYMANIAK, M., PIERRE, G., AND VAN STEEN, M. 2004. Scalable cooperative latency estimation. In Proceedings of the 10th International Conference on Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos, CA, 367-376.
80. SZYMANIAK, M., PRESOTTO, D., PIERRE, G., AND VAN STEEN, M. 2008. Practical large-scale latency estimation. Comput. Netw. 52, 7, 1343-1364.
81. TANG, C., XU, Z., AND MAHALINGAM, M. 2003. pSearch: Information retrieval in structured overlays. ACM Comput. Comm. Rev. 33, 1, 89-94.
82. WALLACH, D. 2002. A survey of peer-to-peer security issues. In Proceedings of the International Symposium on Software Security. Lecture Notes on Computer Science, vol. 2609. Springer-Verlag, Berlin, Germany, 42-57.
83. WANG, H., ZHU, Y., AND HU, Y. 2005. An efficient and secure peer-to-peer overlay network. In Proceedings of the 30th Local Computer Networks. IEEE Computer Society Press, Los Alamitos, CA, 764-771. (Pubitemid 44815680)
84. WANG, P.,OSIPKOV, I.,HOPPER, N., AND KIM, Y. 2007. Myrmic: Secure and robust DHT routing. Tech. rep. Digital Technology Center, University of Minnesota at Twin Cities, Minneapolis/St. Paul, MN.
85. YANG, K.-H. AND HO, J.-M. 2006. Proof: A DHT-based peer-to-peer search engine. In Proceedings of the International Conference on Web Intelligence (WI). IEEE Computer Society Press, Los Alamitos, CA, 702-708.
86. YU, H., GIBBONS, P. B., KAMINSKY, M., AND XIAO, F. 2008. SybilLimit: A near-optimal social network defense against sybil attacks. In Proceedings of the International Symposium on Security and Privacy. IEEE Computer Society Press, Los Alamitos, CA, 3-17.
87. YU, H., KAMINSKY, M., GIBBONS, P. B., AND FLAXMAN, A. 2006. SybilGuard: Defending against Sybil attacks via social networks. In Proceedings of the ACM SIGCOMMN Data Communications Festival. ACM Press, New York, NY, 267-278. (Pubitemid 44623733)
88. YU, Y., LEE, S., AND ZHANG, Z.-L. 2005. Leopard: A locality aware peer-to-peer system with no hot spot. In Proceedings of the 4th International Networking Conference (NETWORKING). Lecture Notes on Computer Science, vol. 3462. Springer-Verlag, Berlin, Germany, 27-39. (Pubitemid 41312782)
89. ZHAO, B., HUANG, L., STRIBLING, J., RHEA, S., JOSEPH, A., AND KUBIATOWICZ, J. 2004. Tapestry: A resilient globalscale overlay for service deployment. IEEE J. Select. Areas Comm. 22, 1, 41-53.
90. ZHOU, L. AND VAN RENESSE, R. 2004. P6P: A peer-to-peer approach to Internet infrastructure. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems. Lecture Notes on Computer Science, vol. 3279. Springer-Verlag, Berlin, Germany, 75-86. (Pubitemid 41190540)
91. ZHU, Y. AND HU, Y. 2005. Efficient, proximity-aware load balancing for DHT-based P2P systems. IEEE Trans. Parallel Distrib. Syst. 16, 4, 349-361. (Pubitemid 40589983)