Distributed hash table (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Distributed hash table" in English language version.

refsWebsite

Global rank English rank

23web.archive.org

1^st place

13doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

4mit.edu

415^th place

327^th place

3worldcat.org

5^th place

3psu.edu

207^th place

136^th place

2freenetproject.org

low place

2acm.org

1,185^th place

840^th place

2epfl.ch

4,521^st place

4,877^th place

2stanford.edu

179^th place

183^rd place

1books.google.com

3^rd place

1cam.ac.uk

670^th place

480^th place

1berkeley.edu

580^th place

462^nd place

1newscientist.com

774^th place

716^th place

1irit.fr

low place

1globule.org

low place

1weizmann.ac.il

4,983^rd place

8,002^nd place

1polito.it

low place

1upc.es

low place

1sics.se

low place

1cypherpunks.ca

low place

1elsevier.com

610^th place

704^th place

1handle.net

102^nd place

76^th place

1springer.com

274^th place

309^th place

1tribler.org

low place

1sourceforge.net

1,669^th place

1,290^th place

acm.org

dl.acm.org

Ratnasamy, Sylvia; Francis, Paul; Handley, Mark; Karp, Richard; Shenker, Scott (2001-08-27). "A scalable content-addressable network". SIGCOMM Comput. Commun. Rev. 31 (4): 161–172. doi:10.1145/964723.383072. ISSN 0146-4833.
Lesniewski-Laas, Chris (2008-04-01). "A Sybil-proof one-hop DHT". Proceedings of the 1st Workshop on Social Network Systems. SocialNets '08. New York, NY, USA: Association for Computing Machinery. pp. 19–24. doi:10.1145/1435497.1435501. ISBN 978-1-60558-124-8.

berkeley.edu

cs.berkeley.edu

Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Looking up data in P2P systems Archived 2016-05-19 at the Wayback Machine. In Communications of the ACM, February 2003.

books.google.com

Hota, Chittaranjan; Srimani, Pradip K. (2013-01-11). Distributed Computing and Internet Technology: 9th International Conference, ICDCIT 2013, Bhubaneswar, India, February 5-8, 2013, Proceedings. Springer. ISBN 978-3-642-36071-8.

cam.ac.uk

cl.cam.ac.uk

Liz, Crowcroft; et al. (2005). "A survey and comparison of peer-to-peer overlay network schemes" (PDF). IEEE Communications Surveys & Tutorials. 7 (2): 72–93. CiteSeerX 10.1.1.109.6124. doi:10.1109/COMST.2005.1610546. S2CID 7971188. Archived (PDF) from the original on 2023-10-05. Retrieved 2019-09-24.

cypherpunks.ca

Maxwell Young; Aniket Kate; Ian Goldberg; Martin Karsten. "Practical Robust Communication in DHTs Tolerating a Byzantine Adversary" Archived 2016-07-22 at the Wayback Machine.

doi.org

Stoica, I.; Morris, R.; Karger, D.; Kaashoek, M. F.; Balakrishnan, H. (2001). "Chord: A scalable peer-to-peer lookup service for internet applications" (PDF). ACM SIGCOMM Computer Communication Review. 31 (4): 149. doi:10.1145/964723.383071. Archived (PDF) from the original on 2023-07-07. Retrieved 2018-09-18. A value can be an address, a document, or an arbitrary data item.
Liz, Crowcroft; et al. (2005). "A survey and comparison of peer-to-peer overlay network schemes" (PDF). IEEE Communications Surveys & Tutorials. 7 (2): 72–93. CiteSeerX 10.1.1.109.6124. doi:10.1109/COMST.2005.1610546. S2CID 7971188. Archived (PDF) from the original on 2023-10-05. Retrieved 2019-09-24.
Ratnasamy, Sylvia; Francis, Paul; Handley, Mark; Karp, Richard; Shenker, Scott (2001-08-27). "A scalable content-addressable network". SIGCOMM Comput. Commun. Rev. 31 (4): 161–172. doi:10.1145/964723.383072. ISSN 0146-4833.
Girdzijauskas, Šarūnas; Datta, Anwitaman; Aberer, Karl (2010-02-01). "Structured overlay for heterogeneous environments". ACM Transactions on Autonomous and Adaptive Systems. 5 (1): 1–25. doi:10.1145/1671948.1671950. ISSN 1556-4665. S2CID 13218263. Archived from the original on 2020-07-12. Retrieved 2020-03-12.
Forestiero, Agostino; Leonardi, Emilio; Mastroianni, Carlo; Meo, Michela (October 2010). "Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems". IEEE/ACM Transactions on Networking. 18 (5): 1651–1664. doi:10.1109/TNET.2010.2046745. S2CID 14797120. Archived from the original on 2012-07-01. Retrieved 2019-07-28.
Galuba, Wojciech; Girdzijauskas, Sarunas (2009), "Peer to Peer Overlay Networks: Structure, Routing and Maintenance", in LIU, LING; ÖZSU, M. TAMER (eds.), Encyclopedia of Database Systems, Springer US, pp. 2056–2061, doi:10.1007/978-0-387-39940-9_1215, ISBN 9780387399409
Girdzijauskas, Sarunas (2009). Designing peer-to-peer overlays a small-world perspective. epfl.ch (Thesis). EPFL. doi:10.5075/epfl-thesis-4327. Archived from the original on 2020-03-03. Retrieved 2019-11-11.
Castro, Miguel; Costa, Manuel; Rowstron, Antony (1 January 2004). "Should we build Gnutella on a structured overlay?" (PDF). ACM SIGCOMM Computer Communication Review. 34 (1): 131. CiteSeerX 10.1.1.221.7892. doi:10.1145/972374.972397. S2CID 6587291. Archived (PDF) from the original on 14 February 2021. Retrieved 25 September 2019.
Talia, Domenico; Trunfio, Paolo (December 2010). "Enabling Dynamic Querying over Distributed Hash Tables". Journal of Parallel and Distributed Computing. 70 (12): 1254–1265. doi:10.1016/j.jpdc.2010.08.012.
Baruch Awerbuch, Christian Scheideler. "Towards a scalable and robust DHT". 2006. doi:10.1145/1148109.1148163
Natalya Fedotova; Giordano Orzetti; Luca Veltri; Alessandro Zaccagnini. "Byzantine agreement for reputation management in DHT-based peer-to-peer networks". doi:10.1109/ICTEL.2008.4652638
Lesniewski-Laas, Chris (2008-04-01). "A Sybil-proof one-hop DHT". Proceedings of the 1st Workshop on Social Network Systems. SocialNets '08. New York, NY, USA: Association for Computing Machinery. pp. 19–24. doi:10.1145/1435497.1435501. ISBN 978-1-60558-124-8.
Kelner, Jonathan; Maymounkov, Petar (2011-07-22). "Electric routing and concurrent flow cutting". Theoretical Computer Science. Algorithms and Computation. 412 (32): 4123–4135. doi:10.1016/j.tcs.2010.06.013. hdl:1721.1/71604. ISSN 0304-3975.

elsevier.com

linkinghub.elsevier.com

Kelner, Jonathan; Maymounkov, Petar (2011-07-22). "Electric routing and concurrent flow cutting". Theoretical Computer Science. Algorithms and Computation. 412 (32): 4123–4135. doi:10.1016/j.tcs.2010.06.013. hdl:1721.1/71604. ISSN 0304-3975.

epfl.ch

infoscience.epfl.ch

Girdzijauskas, Šarūnas; Datta, Anwitaman; Aberer, Karl (2010-02-01). "Structured overlay for heterogeneous environments". ACM Transactions on Autonomous and Adaptive Systems. 5 (1): 1–25. doi:10.1145/1671948.1671950. ISSN 1556-4665. S2CID 13218263. Archived from the original on 2020-07-12. Retrieved 2020-03-12.
Girdzijauskas, Sarunas (2009). Designing peer-to-peer overlays a small-world perspective. epfl.ch (Thesis). EPFL. doi:10.5075/epfl-thesis-4327. Archived from the original on 2020-03-03. Retrieved 2019-11-11.

freenetproject.org

Searching in a Small World Chapters 1 & 2 (PDF), archived from the original (PDF) on 2012-03-16, retrieved 2012-01-10
"Section 5.2.2" (PDF), A Distributed Decentralized Information Storage and Retrieval System, archived from the original (PDF) on 2012-03-16, retrieved 2012-01-10

globule.org

Guido Urdaneta, Guillaume Pierre and Maarten van Steen. A Survey of DHT Security Techniques Archived 2023-06-01 at the Wayback Machine. ACM Computing Surveys 43(2), January 2011.

handle.net

hdl.handle.net

Kelner, Jonathan; Maymounkov, Petar (2011-07-22). "Electric routing and concurrent flow cutting". Theoretical Computer Science. Algorithms and Computation. 412 (32): 4123–4135. doi:10.1016/j.tcs.2010.06.013. hdl:1721.1/71604. ISSN 0304-3975.

irit.fr

R Mokadem, A Hameurlain and AM Tjoa. Resource discovery service while minimizing maintenance overhead in hierarchical DHT systems Archived 2022-08-09 at the Wayback Machine. Proc. iiWas, 2010

mit.edu

pdos.csail.mit.edu

Stoica, I.; Morris, R.; Karger, D.; Kaashoek, M. F.; Balakrishnan, H. (2001). "Chord: A scalable peer-to-peer lookup service for internet applications" (PDF). ACM SIGCOMM Computer Communication Review. 31 (4): 149. doi:10.1145/964723.383071. Archived (PDF) from the original on 2023-07-07. Retrieved 2018-09-18. A value can be an address, a document, or an arbitrary data item.
Whanau: A Sybil-proof Distributed Hash Table https://pdos.csail.mit.edu/papers/whanau-nsdi10.pdf Archived 2022-01-25 at the Wayback Machine

iris.pdos.csail.mit.edu

"MIT, Berkeley, ICSI, NYU, and Rice Launch the IRIS Project". Press release. MIT. September 25, 2002. Archived from the original on September 26, 2015. Retrieved November 10, 2013.

nms.lcs.mit.edu

Castro, Miguel; Costa, Manuel; Rowstron, Antony (1 January 2004). "Should we build Gnutella on a structured overlay?" (PDF). ACM SIGCOMM Computer Communication Review. 34 (1): 131. CiteSeerX 10.1.1.221.7892. doi:10.1145/972374.972397. S2CID 6587291. Archived (PDF) from the original on 14 February 2021. Retrieved 25 September 2019.

newscientist.com

David Cohen (October 1, 2002). "New P2P network funded by US government". New Scientist. Archived from the original on April 6, 2008. Retrieved November 10, 2013.

polito.it

porto.polito.it

Forestiero, Agostino; Leonardi, Emilio; Mastroianni, Carlo; Meo, Michela (October 2010). "Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems". IEEE/ACM Transactions on Networking. 18 (5): 1651–1664. doi:10.1109/TNET.2010.2046745. S2CID 14797120. Archived from the original on 2012-07-01. Retrieved 2019-07-28.

psu.edu

citeseerx.ist.psu.edu

Liz, Crowcroft; et al. (2005). "A survey and comparison of peer-to-peer overlay network schemes" (PDF). IEEE Communications Surveys & Tutorials. 7 (2): 72–93. CiteSeerX 10.1.1.109.6124. doi:10.1109/COMST.2005.1610546. S2CID 7971188. Archived (PDF) from the original on 2023-10-05. Retrieved 2019-09-24.
Castro, Miguel; Costa, Manuel; Rowstron, Antony (1 January 2004). "Should we build Gnutella on a structured overlay?" (PDF). ACM SIGCOMM Computer Communication Review. 34 (1): 131. CiteSeerX 10.1.1.221.7892. doi:10.1145/972374.972397. S2CID 6587291. Archived (PDF) from the original on 14 February 2021. Retrieved 25 September 2019.

citeseer.ist.psu.edu

Gurmeet Singh Manku, Moni Naor, and Udi Wieder. "Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks" Archived 2008-04-20 at the Wayback Machine. Proc. STOC, 2004.

semanticscholar.org

api.semanticscholar.org

Liz, Crowcroft; et al. (2005). "A survey and comparison of peer-to-peer overlay network schemes" (PDF). IEEE Communications Surveys & Tutorials. 7 (2): 72–93. CiteSeerX 10.1.1.109.6124. doi:10.1109/COMST.2005.1610546. S2CID 7971188. Archived (PDF) from the original on 2023-10-05. Retrieved 2019-09-24.
Girdzijauskas, Šarūnas; Datta, Anwitaman; Aberer, Karl (2010-02-01). "Structured overlay for heterogeneous environments". ACM Transactions on Autonomous and Adaptive Systems. 5 (1): 1–25. doi:10.1145/1671948.1671950. ISSN 1556-4665. S2CID 13218263. Archived from the original on 2020-07-12. Retrieved 2020-03-12.
Forestiero, Agostino; Leonardi, Emilio; Mastroianni, Carlo; Meo, Michela (October 2010). "Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems". IEEE/ACM Transactions on Networking. 18 (5): 1651–1664. doi:10.1109/TNET.2010.2046745. S2CID 14797120. Archived from the original on 2012-07-01. Retrieved 2019-07-28.
Castro, Miguel; Costa, Manuel; Rowstron, Antony (1 January 2004). "Should we build Gnutella on a structured overlay?" (PDF). ACM SIGCOMM Computer Communication Review. 34 (1): 131. CiteSeerX 10.1.1.221.7892. doi:10.1145/972374.972397. S2CID 6587291. Archived (PDF) from the original on 14 February 2021. Retrieved 25 September 2019.

sics.se

Ali Ghodsi (22 May 2007). "Distributed k-ary System: Algorithms for Distributed Hash Tables". Archived from the original on 22 May 2007.. KTH-Royal Institute of Technology, 2006.

sourceforge.net

retroshare.sourceforge.net

Retroshare FAQ Archived 2013-07-17 at the Wayback Machine retrieved December 2011

springer.com

Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman (2019). Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox. Springer International Publishing. ISBN 978-3-030-25208-3. Archived from the original on 2021-08-17. Retrieved 2020-01-22.

stanford.edu

scs.stanford.edu

"Democratizing content publication with Coral" (PDF). NSDI. 4. 2004. Retrieved 2024-05-01.

www-db.stanford.edu

Gurmeet Singh Manku. Dipsea: A Modular Distributed Hash Table Archived 2004-09-10 at the Wayback Machine. Ph. D. Thesis (Stanford University), August 2004.

tribler.org

Tribler wiki Archived December 4, 2010, at the Wayback Machine retrieved January 2010.

upc.es

maite71.upc.es

The (Degree, Diameter) Problem for Graphs, Maite71.upc.es, archived from the original on 2012-02-17, retrieved 2012-01-10

web.archive.org

Stoica, I.; Morris, R.; Karger, D.; Kaashoek, M. F.; Balakrishnan, H. (2001). "Chord: A scalable peer-to-peer lookup service for internet applications" (PDF). ACM SIGCOMM Computer Communication Review. 31 (4): 149. doi:10.1145/964723.383071. Archived (PDF) from the original on 2023-07-07. Retrieved 2018-09-18. A value can be an address, a document, or an arbitrary data item.
Liz, Crowcroft; et al. (2005). "A survey and comparison of peer-to-peer overlay network schemes" (PDF). IEEE Communications Surveys & Tutorials. 7 (2): 72–93. CiteSeerX 10.1.1.109.6124. doi:10.1109/COMST.2005.1610546. S2CID 7971188. Archived (PDF) from the original on 2023-10-05. Retrieved 2019-09-24.
Searching in a Small World Chapters 1 & 2 (PDF), archived from the original (PDF) on 2012-03-16, retrieved 2012-01-10
"Section 5.2.2" (PDF), A Distributed Decentralized Information Storage and Retrieval System, archived from the original (PDF) on 2012-03-16, retrieved 2012-01-10
Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Looking up data in P2P systems Archived 2016-05-19 at the Wayback Machine. In Communications of the ACM, February 2003.
David Cohen (October 1, 2002). "New P2P network funded by US government". New Scientist. Archived from the original on April 6, 2008. Retrieved November 10, 2013.
"MIT, Berkeley, ICSI, NYU, and Rice Launch the IRIS Project". Press release. MIT. September 25, 2002. Archived from the original on September 26, 2015. Retrieved November 10, 2013.
R Mokadem, A Hameurlain and AM Tjoa. Resource discovery service while minimizing maintenance overhead in hierarchical DHT systems Archived 2022-08-09 at the Wayback Machine. Proc. iiWas, 2010
Guido Urdaneta, Guillaume Pierre and Maarten van Steen. A Survey of DHT Security Techniques Archived 2023-06-01 at the Wayback Machine. ACM Computing Surveys 43(2), January 2011.
Moni Naor and Udi Wieder. Novel Architectures for P2P Applications: the Continuous-Discrete Approach Archived 2019-12-09 at the Wayback Machine. Proc. SPAA, 2003.
Gurmeet Singh Manku. Dipsea: A Modular Distributed Hash Table Archived 2004-09-10 at the Wayback Machine. Ph. D. Thesis (Stanford University), August 2004.
Girdzijauskas, Šarūnas; Datta, Anwitaman; Aberer, Karl (2010-02-01). "Structured overlay for heterogeneous environments". ACM Transactions on Autonomous and Adaptive Systems. 5 (1): 1–25. doi:10.1145/1671948.1671950. ISSN 1556-4665. S2CID 13218263. Archived from the original on 2020-07-12. Retrieved 2020-03-12.
Forestiero, Agostino; Leonardi, Emilio; Mastroianni, Carlo; Meo, Michela (October 2010). "Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems". IEEE/ACM Transactions on Networking. 18 (5): 1651–1664. doi:10.1109/TNET.2010.2046745. S2CID 14797120. Archived from the original on 2012-07-01. Retrieved 2019-07-28.
Girdzijauskas, Sarunas (2009). Designing peer-to-peer overlays a small-world perspective. epfl.ch (Thesis). EPFL. doi:10.5075/epfl-thesis-4327. Archived from the original on 2020-03-03. Retrieved 2019-11-11.
The (Degree, Diameter) Problem for Graphs, Maite71.upc.es, archived from the original on 2012-02-17, retrieved 2012-01-10
Gurmeet Singh Manku, Moni Naor, and Udi Wieder. "Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks" Archived 2008-04-20 at the Wayback Machine. Proc. STOC, 2004.
Ali Ghodsi (22 May 2007). "Distributed k-ary System: Algorithms for Distributed Hash Tables". Archived from the original on 22 May 2007.. KTH-Royal Institute of Technology, 2006.
Castro, Miguel; Costa, Manuel; Rowstron, Antony (1 January 2004). "Should we build Gnutella on a structured overlay?" (PDF). ACM SIGCOMM Computer Communication Review. 34 (1): 131. CiteSeerX 10.1.1.221.7892. doi:10.1145/972374.972397. S2CID 6587291. Archived (PDF) from the original on 14 February 2021. Retrieved 25 September 2019.
Maxwell Young; Aniket Kate; Ian Goldberg; Martin Karsten. "Practical Robust Communication in DHTs Tolerating a Byzantine Adversary" Archived 2016-07-22 at the Wayback Machine.
Whanau: A Sybil-proof Distributed Hash Table https://pdos.csail.mit.edu/papers/whanau-nsdi10.pdf Archived 2022-01-25 at the Wayback Machine
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman (2019). Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox. Springer International Publishing. ISBN 978-3-030-25208-3. Archived from the original on 2021-08-17. Retrieved 2020-01-22.
Tribler wiki Archived December 4, 2010, at the Wayback Machine retrieved January 2010.
Retroshare FAQ Archived 2013-07-17 at the Wayback Machine retrieved December 2011

weizmann.ac.il

wisdom.weizmann.ac.il

Moni Naor and Udi Wieder. Novel Architectures for P2P Applications: the Continuous-Discrete Approach Archived 2019-12-09 at the Wayback Machine. Proc. SPAA, 2003.

worldcat.org

search.worldcat.org

Ratnasamy, Sylvia; Francis, Paul; Handley, Mark; Karp, Richard; Shenker, Scott (2001-08-27). "A scalable content-addressable network". SIGCOMM Comput. Commun. Rev. 31 (4): 161–172. doi:10.1145/964723.383072. ISSN 0146-4833.
Girdzijauskas, Šarūnas; Datta, Anwitaman; Aberer, Karl (2010-02-01). "Structured overlay for heterogeneous environments". ACM Transactions on Autonomous and Adaptive Systems. 5 (1): 1–25. doi:10.1145/1671948.1671950. ISSN 1556-4665. S2CID 13218263. Archived from the original on 2020-07-12. Retrieved 2020-03-12.
Kelner, Jonathan; Maymounkov, Petar (2011-07-22). "Electric routing and concurrent flow cutting". Theoretical Computer Science. Algorithms and Computation. 412 (32): 4123–4135. doi:10.1016/j.tcs.2010.06.013. hdl:1721.1/71604. ISSN 0304-3975.