جدول درهم‌سازی توزیع‌شده (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "جدول درهم‌سازی توزیع‌شده" in Persian language version.

Last modified: 12:23:23, 29 August 2024 (UTC)

Ref.Un. Ref.Website

Global rank Persian rank

99doi.org

2^nd place

88web.archive.org

1^st place

55mit.edu

476^th place

411^th place

33psu.edu

299^th place

277^th place

22freenetproject.org

low place

22berkeley.edu

621^st place

567^th place

11cam.ac.uk

569^th place

760^th place

11newscientist.com

1,041^st place

685^th place

11irit.fr

low place

11globule.org

low place

11weizmann.ac.il

6,932^nd place

low place

11stanford.edu

194^th place

171^st place

11epfl.ch

3,783^rd place

3,705^th place

11worldcat.org

4^th place

7^th place

11polito.it

low place

5,341^st place

11upc.es

low place

11sics.se

low place

11cypherpunks.ca

low place

11archive.org

6^th place

4^th place

11arxiv.org

49^th place

105^th place

11adsabs.harvard.edu

14^th place

38^th place

11tribler.org

low place

11sourceforge.net

1,842^nd place

2,564^th place

adsabs.harvard.edu (Global: 14^th place; Persian: 38^th place)

ui.adsabs.harvard.edu

Jonathan Kelner, Petar Maymounkov (2009). "Electric routing and concurrent flow cutting". arXiv:0909.2859. Bibcode:2009arXiv0909.2859K. {{cite journal}}: یادکرد journal نیازمند |journal= است (کمک)

archive.org (Global: 6^th place; Persian: 4^th place)

Jonathan Kelner, Petar Maymounkov (2009). "Electric routing and concurrent flow cutting". arXiv:0909.2859. Bibcode:2009arXiv0909.2859K. {{cite journal}}: یادکرد journal نیازمند |journal= است (کمک)

arxiv.org (Global: 49^th place; Persian: 105^th place)

Jonathan Kelner, Petar Maymounkov (2009). "Electric routing and concurrent flow cutting". arXiv:0909.2859. Bibcode:2009arXiv0909.2859K. {{cite journal}}: یادکرد journal نیازمند |journal= است (کمک)

berkeley.edu (Global: 621^st place; Persian: 567^th place)

eecs.berkeley.edu

Ratnasamy; et al. (2001). "A Scalable Content-Addressable Network" (PDF). In Proceedings of ACM SIGCOMM 2001. Retrieved 2013-05-20. {{cite journal}}: یادکرد journal نیازمند |journal= است (کمک)

cs.berkeley.edu

Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Looking up data in P2P systems. In Communications of the ACM, February 2003.

cam.ac.uk (Global: 569^th place; Persian: 760^th place)

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.

cypherpunks.ca (Global: low place; Persian: low place)

Maxwell Young; Aniket Kate; Ian Goldberg; Martin Karsten. "Practical Robust Communication in DHTs Tolerating a Byzantine Adversary".

doi.org (Global: 2^nd place; Persian: 2^nd place)

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. 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.
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.
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.
Galuba, Wojciech; Girdzijauskas, Sarunas (2009), LIU, LING; ÖZSU, M. TAMER (eds.), "Peer to Peer Overlay Networks: Structure, Routing and Maintenance", Encyclopedia of Database Systems (in English), Springer US: 2056–2061, doi:10.1007/978-0-387-39940-9_1215, ISBN 9780387399409{{یادکرد}}: نگهداری یادکرد:پارامتر اثر با شابک (رده)
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.
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.

dx.doi.org

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

epfl.ch (Global: 3,783^rd place; Persian: 3,705^th place)

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.

freenetproject.org (Global: low place; Persian: low place)

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

globule.org (Global: low place; Persian: low place)

Guido Urdaneta, Guillaume Pierre and Maarten van Steen. A Survey of DHT Security Techniques. ACM Computing Surveys 43(2), January 2011.

irit.fr (Global: low place; Persian: low place)

R Mokadem, A Hameurlain and AM Tjoa. Resource discovery service while minimizing maintenance overhead in hierarchical DHT systems. Proc. iiWas, 2010

mit.edu (Global: 476^th place; Persian: 411^th place)

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. 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
Chris Lesniewski-Laas. "A Sybil-proof one-hop DHT" (PDF): 20. {{cite journal}}: یادکرد journal نیازمند |journal= است (کمک)

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.

newscientist.com (Global: 1,041^st place; Persian: 685^th place)

David Cohen (October 1, 2002). "New P2P network funded by US government". New Scientist. Retrieved November 10, 2013.

polito.it (Global: low place; Persian: 5,341^st place)

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.

psu.edu (Global: 299^th place; Persian: 277^th place)

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.
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.

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". Proc. STOC, 2004.

sics.se (Global: low place; Persian: low place)

Ali Ghodsi (22 May 2007). "Distributed k-ary System: Algorithms for Distributed Hash Tables". Archived from the original on 4 January 2007. {{cite web}}: ناسازگاری برچسب زمان |archive-date= و |archive-url=؛ 22 مه 2007 پیشنهاد می‌شود (کمک). KTH-Royal Institute of Technology, 2006.

sourceforge.net (Global: 1,842^nd place; Persian: 2,564^th place)

retroshare.sourceforge.net

Retroshare FAQ بایگانی‌شده در ۱۷ ژوئیه ۲۰۱۳ توسط Wayback Machine retrieved December 2011

stanford.edu (Global: 194^th place; Persian: 171^st place)

www-db.stanford.edu

Gurmeet Singh Manku. Dipsea: A Modular Distributed Hash Table بایگانی‌شده در ۲۰۰۴-۰۹-۱۰ توسط Wayback Machine. Ph. D. Thesis (Stanford University), August 2004.

tribler.org (Global: low place; Persian: low place)

Tribler wiki بایگانی‌شده در دسامبر ۴, ۲۰۱۰ توسط Wayback Machine retrieved January 2010.

upc.es (Global: low place; Persian: low place)

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 (Global: 1^st place; Persian: 1^st place)

Searching in a Small World Chapters 1 & 2 (PDF), archived from the original (PDF) on 16 مارس 2012, retrieved 2012-01-10
"Section 5.2.2" (PDF), A Distributed Decentralized Information Storage and Retrieval System, archived from the original (PDF) on 16 مارس 2012, retrieved 2012-01-10
"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.
Gurmeet Singh Manku. Dipsea: A Modular Distributed Hash Table بایگانی‌شده در ۲۰۰۴-۰۹-۱۰ توسط Wayback Machine. Ph. D. Thesis (Stanford University), August 2004.
The (Degree,Diameter) Problem for Graphs, Maite71.upc.es, archived from the original on 2012-02-17, retrieved 2012-01-10
Ali Ghodsi (22 May 2007). "Distributed k-ary System: Algorithms for Distributed Hash Tables". Archived from the original on 4 January 2007. {{cite web}}: ناسازگاری برچسب زمان |archive-date= و |archive-url=؛ 22 مه 2007 پیشنهاد می‌شود (کمک). KTH-Royal Institute of Technology, 2006.
Tribler wiki بایگانی‌شده در دسامبر ۴, ۲۰۱۰ توسط Wayback Machine retrieved January 2010.
Retroshare FAQ بایگانی‌شده در ۱۷ ژوئیه ۲۰۱۳ توسط Wayback Machine retrieved December 2011

weizmann.ac.il (Global: 6,932^nd place; Persian: low place)

wisdom.weizmann.ac.il

Moni Naor and Udi Wieder. Novel Architectures for P2P Applications: the Continuous-Discrete Approach. Proc. SPAA, 2003.

worldcat.org (Global: 4^th place; Persian: 7^th place)

search.worldcat.org

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.

جدول درهم‌سازی توزیع‌شده (Persian Wikipedia)

adsabs.harvard.edu (Global: 14th place; Persian: 38th place)

ui.adsabs.harvard.edu

archive.org (Global: 6th place; Persian: 4th place)

arxiv.org (Global: 49th place; Persian: 105th place)

berkeley.edu (Global: 621st place; Persian: 567th place)

eecs.berkeley.edu

cs.berkeley.edu

cam.ac.uk (Global: 569th place; Persian: 760th place)

cl.cam.ac.uk

cypherpunks.ca (Global: low place; Persian: low place)

doi.org (Global: 2nd place; Persian: 2nd place)

doi.org

dx.doi.org

epfl.ch (Global: 3,783rd place; Persian: 3,705th place)

infoscience.epfl.ch

freenetproject.org (Global: low place; Persian: low place)

globule.org (Global: low place; Persian: low place)

irit.fr (Global: low place; Persian: low place)

mit.edu (Global: 476th place; Persian: 411th place)

pdos.csail.mit.edu

iris.pdos.csail.mit.edu

nms.lcs.mit.edu

newscientist.com (Global: 1,041st place; Persian: 685th place)

polito.it (Global: low place; Persian: 5,341st place)

porto.polito.it

psu.edu (Global: 299th place; Persian: 277th place)

citeseerx.ist.psu.edu

citeseer.ist.psu.edu

sics.se (Global: low place; Persian: low place)

sourceforge.net (Global: 1,842nd place; Persian: 2,564th place)

retroshare.sourceforge.net

stanford.edu (Global: 194th place; Persian: 171st place)

www-db.stanford.edu

tribler.org (Global: low place; Persian: low place)

upc.es (Global: low place; Persian: low place)

maite71.upc.es

web.archive.org (Global: 1st place; Persian: 1st place)

weizmann.ac.il (Global: 6,932nd place; Persian: low place)

wisdom.weizmann.ac.il

worldcat.org (Global: 4th place; Persian: 7th place)

search.worldcat.org

adsabs.harvard.edu (Global: 14^th place; Persian: 38^th place)

archive.org (Global: 6^th place; Persian: 4^th place)

arxiv.org (Global: 49^th place; Persian: 105^th place)

berkeley.edu (Global: 621^st place; Persian: 567^th place)

cam.ac.uk (Global: 569^th place; Persian: 760^th place)

doi.org (Global: 2^nd place; Persian: 2^nd place)

epfl.ch (Global: 3,783^rd place; Persian: 3,705^th place)

mit.edu (Global: 476^th place; Persian: 411^th place)

newscientist.com (Global: 1,041^st place; Persian: 685^th place)

polito.it (Global: low place; Persian: 5,341^st place)

psu.edu (Global: 299^th place; Persian: 277^th place)

sourceforge.net (Global: 1,842^nd place; Persian: 2,564^th place)

stanford.edu (Global: 194^th place; Persian: 171^st place)

web.archive.org (Global: 1^st place; Persian: 1^st place)

weizmann.ac.il (Global: 6,932^nd place; Persian: low place)

worldcat.org (Global: 4^th place; Persian: 7^th place)