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

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

refsWebsite
Global rank Persian rank
2nd place
2nd place
1st place
1st place
415th place
696th place
207th place
287th place
low place
low place
580th place
676th place
670th place
767th place
774th place
628th place
low place
low place
low place
low place
4,983rd place
low place
179th place
181st place
4,521st place
5,600th place
5th place
12th place
low place
low place
low place
low place
low place
low place
low place
low place
6th place
9th place
69th place
253rd place
18th place
50th place
low place
low place
1,669th place
3,407th place

archive.org

arxiv.org

berkeley.edu

eecs.berkeley.edu

cs.berkeley.edu

cam.ac.uk

cl.cam.ac.uk

cypherpunks.ca

doi.org

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 (به انگلیسی), 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

infoscience.epfl.ch

freenetproject.org

globule.org

harvard.edu

ui.adsabs.harvard.edu

irit.fr

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. 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}}: Cite journal requires |journal= (help)

iris.pdos.csail.mit.edu

nms.lcs.mit.edu

newscientist.com

polito.it

porto.polito.it

psu.edu

citeseerx.ist.psu.edu

citeseer.ist.psu.edu

sics.se

sourceforge.net

retroshare.sourceforge.net

stanford.edu

www-db.stanford.edu

tribler.org

upc.es

maite71.upc.es

web.archive.org

weizmann.ac.il

wisdom.weizmann.ac.il

worldcat.org