DHT Applications

  • Hao Zhang
  • Yonggang Wen
  • Haiyong Xie
  • Nenghai Yu
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)


Like Pythagorean theorem and Newton Law, excellent theories are always simple and graceful. DHT, which performs so graceful that only two basic operations: get data from DHT and put data into DHT, is wildly used in many aspects of applications. In this chapter several DHT applications will be discussed.


Multicast Tree Multicast Group Bloom Filter Instant Messaging File Sharing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    W. Litwin, Marie-Anna Neimat, and D. A. Schneider. Lh*-a scalable, distributed data structure. In ACM Transactions on Database Systems, volume 21, December 1996.Google Scholar
  2. 2.
  3. 3.
    Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma, and Steven Lim. A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials, 7:72–93, 2005.Google Scholar
  4. 4.
    Stephanos, Androutsellis-Theotokis, and Diomidis Spinellis. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys, 36(4):335–371, December 2004.CrossRefGoogle Scholar
  5. 5.
    D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In STOC ’97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 654–663, May 1997.Google Scholar
  6. 6.
    Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM ’01 Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 149–160, August 2001.Google Scholar
  7. 7.
  8. 8.
  9. 9.
    Avinash Lakshman and Prashant Malik. Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review, 44:35–40, April 2010.CrossRefGoogle Scholar
  10. 10.
  11. 11.
  12. 12.
    Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. Dynamo: Amazon’s highly available key-value store. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, 2007.Google Scholar
  13. 13.
    Guangyu Shi, Jian Chen, Hao Gong, Lingyuan Fan, Haiqiang Xue, Qingming Lu, and Liang Liang. A dht key-value storage system with carrier grade performance. In Euro-Par 2009 Parallel Processing, volume 5704, pages 361–374, 2009.Google Scholar
  14. 14.
  15. 15.
    Gnunet: Gnu’ framework for secure peer-to-peer networking.
  16. 16.
    Filipe Araujo and Luis Rodrigues. Survey on distributed hash tables, 2006.
  17. 17.
    Stephanos Androutsellis-Theotokis and Diomidis Spinellis. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys, 36:335–371, December 2004.CrossRefGoogle Scholar
  18. 18.
    Siamak Sarmady. A survey on peer-to-peer and dht, 2010.
  19. 19.
    Zhang YiMing, Lu XiCheng, and Li DongSheng. Survey of dht topology construction techniques in virtual computing environments. Science China Information sciences, 54(11):2221–2235, November 2011.Google Scholar
  20. 20.
    Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz. Handling churn in a dht. In Proceedings of the USENIX Annual Technical Conference, June 2004.Google Scholar
  21. 21.
    Us secure hash algorithm 1 (sha1), 2001. http://
  22. 22.
    Paola Flocchini, Amiya Nayak, and Ming Xie. Enhancing peer-to-peer systems through redundancy. IEEE Journal on Selected Areas in Communications, 25(1):15–24, January 2007.CrossRefGoogle Scholar
  23. 23.
    Yuh-Jzer Joung and Jiaw-Chang Wang. chord 2:a two-layer chord for reducing maintenance overhead via heterogeneity. Computer Networks, 51(3):712–731, February 2007.Google Scholar
  24. 24.
    M. Frans Kaashoek and David R. Karger. Koorde: A simple degree-optimal distributed hash table. Lecture Notes in Computer Science, 2735:98–107, 2003.Google Scholar
  25. 25.
  26. 26.
    G. Cordasco, L. Gargano, A. Negro, V. Scarano, and M. Hammar. F-chord: Improved uniform routing on chord. Networks, 52(4):325–332, June 2008.MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Moni Naor and Udi Wiede. Know thy neighbor’s neighbor: Better routing for skip-graphs and small worlds. In Peer-to-Peer Systems III, volume 3279, pages 269–277, 2005.Google Scholar
  28. 28.
    G. S. Manku. The power od lookahead in small-world routing networks. In STOC, 2004.Google Scholar
  29. 29.
    Gurmeet Singh Manku, Moni Naor, and Udi Wieder. Know thy neighbor’s neighbor: The power of lookahead in randomized p2p networks. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 54–63, 2004.Google Scholar
  30. 30.
    Prasanna Ganesan and Gurmeet Singh Manku. Optimal routing in chord. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 176–185, 2004.Google Scholar
  31. 31.
    Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker. A scalable content-addressable network. In SIGCOMM ’01 Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 161–172, August 2001.Google Scholar
  32. 32.
    Daishi Kato. Gisp: Global information sharing protocol—a distributed index for peer-to-peer systems. In Second International Conference on Peer-to-Peer Computing, pages 65–72, September 2002.Google Scholar
  33. 33.
    Petar Maymounkov and David Mazières. Gisp: Global information sharing protocol—a distributed index for peer-to-peer systems. In 1st International Workshop on Peer-to-Peer Systems, March 2002.Google Scholar
  34. 34.
  35. 35.
  36. 36.
  37. 37.
    Johan Pouwelse, Pawel Garbacki, Dick Epema, and Henk Sips. The bittorrent p2p file-sharing system: Measurements and analysis. Lecture Notes in Computer Science, 3640:205–216, 2005.CrossRefGoogle Scholar
  38. 38.
    D. Stutzbach and R. Rejaie. Improving lookup performance over a widely-deployed dht. In 25th IEEE International Conference on Computer Communications, 2006.Google Scholar
  39. 39.
    Di Wu, Ye Tian, and Kam Wing Ng. Analytical study on improving lookup performance of distributed hash table systems under churn. In Sixth IEEE International Conference on Peer-to-Peer Computing, September 2006.Google Scholar
  40. 40.
    Zhonghong Ou, Erkki Harjula, Otso Kassinen, and Mika Ylianttila. Performance evaluation of a kademlia-based communication-oriented p2p system under churn. Computer Networks, 54(5):689–705, April 2010.CrossRefMATHGoogle Scholar
  41. 41.
    Hun J. Kang, Eric Chan-Tin, Nicholas J. Hopper, and Yongdae Kim. Why kad lookup fails. In IEEE P2P’09, September 2009.Google Scholar
  42. 42.
    Andreas Binzenhofer and Holger Schnabel. Improving the performance and robustness of kademlia-based overlay networks. Kommunikation in Verteilten Systemen (KiVS), pages 15–26, 2007.Google Scholar
  43. 43.
    Antony Rowstron and Peter Druschel. Pastry: Scalabel, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms, pages 329–350, November 2001.Google Scholar
  44. 44.
    Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, and John D. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. In IEEE Journal on Selected Areas in Communications, volume 22, 2004.Google Scholar
  45. 45.
    An architecture for ip address allocation with cidr, September 1993.
  46. 46.
    Dahlia Malkhi, Moni Naor, and David Ratajczak. Viceroy: A scalabel and dynamic emulation of the butterfly. In Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 183–192, 2002.Google Scholar
  47. 47.
    Elena Meshkovaa, Janne Riihijarvia, Marina Petrovaa, and Petri Mahonen. A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Computer Networks, 52(11):2097–2128, August 2008.CrossRefGoogle Scholar
  48. 48.
    C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32(3):241–280, 1999.MathSciNetCrossRefMATHGoogle Scholar
  49. 49.
    Ryan Huebsch, Joseph M. Hellerstein, Nick Lanham, Boon Thau Loo, Scott Shenker, and Ion Stoica. Querying the internet with pier. In Proceedings of the 29th international conference on Very large data bases, volume 29, pages 321–332, 2003.Google Scholar
  50. 50.
  51. 51.
  52. 52.
    Michael J. Freedman, Eric Freudenthal, and David Mazieres. Democratizing content publication with coral. In Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation, 2004.Google Scholar
  53. 53.
    Michael J. Freedman and Princeton University. Experiences with coralcdn: A five-year operational view. In Proceedings of the 7th USENIX conference on Networked systems design and implementation, 2010.Google Scholar
  54. 54.
    Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, and Harlan Yu. Opendht: A public dht service and its uses. In Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, 2005.Google Scholar
  55. 55.
    Jxta: The language and platform independent protocol for p2p networking.
  56. D. Brookshier, D. Govoni, N. Krishnan, and J. C. Soto. JXTA: Java P2P Programming. Daniel Brookshier Darren Govoni Navaneeth Krishnan Juan Carlos Sotoen, 2002.Google Scholar
  57. 57.
  58. 58.
    Bernard Traversat, Mohamed Abdelaziz, and Eric Pouyoul. Project jxta: A loosely-consistent dht rendezvous walker, 2004.
  59. 59.
  60. 60.
  61. 61.
    Krista Bennett, Christian Grothoff, Tzvetan Horozov, Ioana Patrascu, and Tiberiu Stef. Gnunet - a truly anonymous networking infrastructure. In Proc. Privacy Enhancing Technologies Workshop, 2002.Google Scholar
  62. 62.
  63. 63.
  64. 64.
  65. 65.
    Patrick Hunt, Mahadev Konar, Flavio P. Junqueira, and Benjamin Reed. Zookeeper: wait-free coordination for internet-scale systems. In Proceeding USENIXATC’10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference, 2010.Google Scholar
  66. 66.
    Internet indirection infrastructure.
  67. 67.
    Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, and Sonesh Surana. Internet indirection infrastructure. In SIGCOMM, 2002.Google Scholar
  68. 68.
  69. 69.
    Kazuyuki Shudo, Yoshio Tanaka, and Satoshi Sekiguchi. Overlay weaver: An overlay construction toolkit. Computer Communications, 31(2):402–412, February 2008.CrossRefGoogle Scholar
  70. 70.
  71. 71.
    Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber. Bigtable: A distributed storage system for structured data. In Proceedings of the 7th Conference on USENIX Symposium on Operating Systems Design and Implementation, volume 7, pages 205–218, 2006.Google Scholar
  72. 72.
    Naohiro Hayashibara, Xavier Defago, Rami Yared, and Takuya Katayama. The φ accrual failure detector. In Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004.Google Scholar
  73. 73.
  74. 74.
  75. 75.
    IBM. Scalable, Integrated Solutions for Elastic Caching Using IBM WebSphere eXtreme Scale, 2011. Redbooks.Google Scholar
  76. 76.
    Dynamo: A flawed architecture.
  77. 77.
    Bruce S. Davie and Jan Medved. A programmable overlay router for service provider innovation. In Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow, 2009.Google Scholar
  78. 78.
  79. 79.
  80. 80.
  81. 81.
  82. 82.
  83. 83.
  84. 84.
    Charles Killian, James W. Anderson, Ryan Braud, Ranjit Jhala, and Amin Vahdat. Mace: Language support for building distributed systems. In Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, 2007.Google Scholar
  85. 85.
  86. 86.
  87. 87.
    Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante. Drafting behind akamai. In SIGCOMM’06, 2006.Google Scholar
  88. 88.
    D. M. Moen. Overview of overlay multicast protocols.
  89. 89.
    Stefan Birrer and Fabian E. Bustamante. A comparison of resilient overlay multicast approaches. IEEE Journal on Selected Areas in Communications, 25(9):1695–1705, 2007.CrossRefGoogle Scholar
  90. 90.
    Miguel Castro, Peter Druschel, Anne Marie Kermarrec, and Antony Rowstron. Scribe: A large-scale and decentralized application-level multicast infrasstructure. In IEEE Journal on Selected Areas in Communications, volume 20, October 2002.Google Scholar
  91. 91.
    Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellerer, and Zoran Despotovic. mdht: Multicast-augmented dht architecture for high availability and immunity to churn. In Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference, 2009.Google Scholar
  92. 92.
    Andrea Passarella, Franca Delmastro, and Marco Conti. Xscribe: a stateless, cross-layer approach to p2p multicast in multi-hop ad hoc networks. In Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking, 2006.Google Scholar
  93. 93.
    Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Animesh Nandi, Antony Rowstron, and Atul Singh. Splitstream: high-bandwidth multicast in cooperative environments. ACM SIGOPS Operating Systems Review, 37(5):298–313, December 2003.CrossRefGoogle Scholar
  94. 94.
    Shelley Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, and John D. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video, 2001.Google Scholar
  95. 95.
    W.-P. Ken Yiu, Xing Jin, and S.-H. Gary Chan. Challenges and approaches in large-scale p2p media streaming. IEEE Multimedia, 14(2):50–59, 2007.Google Scholar
  96. 96.
    Michael J. Freedman, Karthik Lakshminarayanan, and David Mazières. Oasis: Anycast for any service. In Proceedings of the 3rd conference on Networked Systems Design and Implementation - Volume 3, 2006.Google Scholar
  97. 97.
    Guodong Wang, Yang Chen, Lei Shi, Eng Keong Lua, Beixing Deng, and Xing Li. Proxima: towards lightweight and flexible anycast service. In Proceedings of the 28th IEEE international conference on Computer Communications Workshops, 2009.Google Scholar
  98. 98.
    Hitesh Ballani and Paul Francis. Towards a global ip anycast service. In Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, 2005.Google Scholar
  99. 99.
    Hitesh Ballani and Paul Francis. Analysis of an anycast based overlay system for scalable service discovery and execution. Computer Networks, 54(1):97–111, January 2010.CrossRefGoogle Scholar
  100. 100.
    Byung gon Chun, Peter Wu, Hakim Weatherspoon, and John Kubiatowicz. Chunkcast: An anycast service for large content distribution. In In Proceedings of the 5th International Workshop on Peer-to-Peer Systems, 2006.Google Scholar
  101. 101.
    Ip version 6 addressing architecture.
  102. 102.
    Venugopalan Ramasubramanian and Emin Gün Sirer. The design and implementation of a next generation name service for the internet. In Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, 2004.Google Scholar
  103. 103.
    Venugopalan Ramasubramanian and Emin Gün Sirer. Beehive: Exploiting power law query distributions for o(1) lookup performance in peer to peer overlays. symposium on networked systems design and implementation. In Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1, 2004.Google Scholar
  104. 104.
    V. Pappas, D. Massey, A. Terzis,, and L. Zhang. A comparative study of the dns design with dht-based alternatives. In INFOCOM, 2006.Google Scholar
  105. 105.
    Fang Qiming, Yang Guangwen, Wu Yongwei, and Zheng Weimin. P2p web search technology. Journal of Software, 19(10):2706–2719, October 2008.Google Scholar
  106. 106.
  107. 107.
    B. Goetz. The lucene search engine: Powerful, flexible, and free, 2002.
  108. 108.
  109. 109.
  110. 110.
  111. 111.
  112. 112.
    John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Chris Wells, and Ben Zhao. Oceanstore: An architecture for global-scale persistent storage. ACM SIGOPS Operating Systems Review, 34(5):190–201, November 2000.CrossRefGoogle Scholar
  113. 113.
    Peter Druschel and Antony Rowstron. Past: A large-scale, persistent peer-to-peer storage utility. In Eighth Workshop on Hot Topics in Operating Systems, pages 75–80, May 2001.Google Scholar
  114. 114.
    Marcel Karnstedt, Kai-Uwe Sattler, Martin Richtarsky, Jessica Muller, Manfred Hauswirth, Roman Schmidt, and Renault John. Unistore: Querying a dht-based universal storage. IEEE 23rd International Conference on Data Engineering, 1:1503–1504, 2007.Google Scholar
  115. 115.
    Martin Raack. Okeanos: Reconfigurable fault-tolerant transactional storage supporting object deletions. In High Performance Computing (HiPC), 2010 International Conference on, pages 1–10, december 2011.Google Scholar
  116. 116.
    Antony Rowstron and Peter Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In SOSP ’01 Proceedings of the eighteenth ACM symposium on Operating systems principles, pages 188–201, 2001.Google Scholar
  117. 117.
    Qinlu He, Zhanhuai Li, and Xiao Zhang. Study on dht based open p2p cloud storage services systems. In 2010 International Conference on Computational and Information Sciences, 2010.Google Scholar
  118. 118.
  119. 119.
    Ian Clarke, Scott G. Miller, Theodore W. Hong, Oskar Sandberg, and Brandon Wiley. Protecting free expression online with freenet. IEEE Internet Computing, 6(1):40–49, 2002.CrossRefGoogle Scholar
  120. 120.
  121. 121.
    Ian Clarke. A distributed decentralised information storage and retrieval system, 1999.
  122. 122.
    L. Clarke, O. Sandberg, B. Wiley, and T.W. Hong. Freenet: a distributed anonymous information storage and retrieval system. In Designing Privacy Enhancing Technologies. International Workshop on Design Issues in Anonymity and Unobservability, 2000.Google Scholar
  123. 123.
    Toby Walsh. Searching in a small world. In IJCAI, pages 1172–1177, 1999.Google Scholar
  124. 124.
    Vilhelm Verende. Switching for a small world. Master’s thesis, Chalmers University of Technology, 2007.
  125. 125.
    Ian Clarke, Oskar Sandberg, Matthew Toseland, and Vilhelm Verendel. Private communication through a network of trusted connections: The dark freenet, 2010.
  126. 126.
    Peter Biddle, Paul Engl, Marcus Peinado, and Bryan Willman. The darknet and the future of content distribution. In Digital Rights Management: Technological, Economic, Legal and Political Aspects, volume 2770, pages 344–365, 2003.Google Scholar
  127. 127.
    Salman A. Baset and Henning Schulzrinne. An analysis of the skype peer-to-peer internet telephony protocol. Proceedings IEEE INFOCOM 2006 25TH IEEE International Conference on Computer Communications, 6(c):1–11, 2004.Google Scholar
  128. 128.
    David A. Bryan, Bruce Lowekamp, and Cullen Jennings. Sosimple: A serverless, standards-based, p2p sip communication system. In AAA-IDEA’05, pages 42–49, 2005.Google Scholar
  129. 129.
    Marti A. Motoyama and George Varghese. Crosstalk: scalably interconnecting instant messaging networks. In Proceedings of the 2nd ACM workshop on Online social networks, 2009.Google Scholar
  130. 130.
  131. 131.
  132. 132.
    Thomas Ristenpart, Gabriel Maganis, Arvind Krishnamurthy, and Tadayoshi Kohno. Privacy-preserving location tracking of lost or stolen devices: Cryptographic techniques and replacing trusted third parties with dhts. In Proceedings of the 17th conference on Security symposium, pages 275–290, 2008.Google Scholar
  133. 133.
    Jim Gray. An analysis of the skype peer-to-peer internet telephony protocol. Queue, 6(3):63–68, May 2008.CrossRefGoogle Scholar
  134. 134.
    David P. Anderson, Jeff Cobb, Eric Korpela, Matt Lebofsky, and Dan Werthimer. Seti@home: An experiment in public-resource computing. Communications of the ACM, 45(11):56–61, November 2002.CrossRefGoogle Scholar
  135. 135.
    S. Keshav. Efficient and decentralized computation of approximate global state. ACM SIGCOMM Computer Communication Revie, 36(1), January 2006.Google Scholar
  136. 136.
    Rafik Makhloufi, Gregory Bonnet, Guillaume Doyen, and Dominique Gaiti. Decentralized aggregation protocols in peer-to-peer networks: A survey. In Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications, number 1, pages 111–116, 2009.Google Scholar
  137. 137.
    David Kempe, Alin Dobra, and Johannes Gehrke. Gossip-based computation of aggregate information. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.Google Scholar
  138. 138.
    Ji Li, Karen Sollins, and Dah-Yoh Lim. Implementing aggregation and broadcast over distributed hash tables. In ACM SIGCOMM Computer Communication Review, volume 35, pages 81–92, January 2005.Google Scholar
  139. 139.
    Marc S. Artigas, Pedro Garcia, and Antonio F. Skarmeta. Deca: A hierarchical framework for decentralized aggregation in dhts. In 17th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, October 2006.Google Scholar
  140. 140.
    Matthew Harren, Joseph M. Hellerstein, Ryan Huebsch, Boon Thau Loo, Scott Shenker, and Ion Stoica. Complex queries in dht based p eer-to-peer networks. In Proceeding IPTPS ’01 Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 242–259, 2002.Google Scholar
  141. 141.
    Bauer Daniel, Hurley Paul, Pletka Roman, and Waldvogel Marcel. Complex queries in dht based peer-to-peer networks. In Proceeding 29th Annual IEEE International Conference on Local Computer Networks, May 2004.Google Scholar
  142. 142.
    Davide Carfi, Massimo Coppola, Domenico Laforenza, and Laura Ricci. Ddt: A distributed data structure for the support of p2p range query. In CollaborateCom’09, pages 1–10, 2009.Google Scholar
  143. 143.
    Guanling Lee, Jia-Sin Huang, and Yi-Chun Chen. Supporting filename partial matches in structured peer-to-peer overlay. In 5th International Conference on Grid and Pervasive Computing, 2010.Google Scholar
  144. 144.
    Tan Yunsong and Wu Yuntao. Efficient range indexing in dht-based peer-to-peer networks. In International Forum on Information Technology and Applications, 2009.Google Scholar
  145. 145.
    Guido Urdaneta, Guillaume Pierre, and Maarten van Steen. A survey of dht security techniques. ACM Computing Surveys, 43, January 2011.Google Scholar

Copyright information

© The Author(s) 2013

Authors and Affiliations

  • Hao Zhang
    • 1
  • Yonggang Wen
    • 2
  • Haiyong Xie
    • 3
  • Nenghai Yu
    • 1
  1. 1.Department of Electronic Engineering and Information ScienceUniversity of Science and Technology of ChinaHefeiChina
  2. 2.School of Computer EngineeringNanyang Technological UniversitySingaporeSingapore
  3. 3.Department of Computer Science & Suzhou Institute for Advanced StudyUniversity of Science and Technology of ChinaSuzhouChina

Personalised recommendations