{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:23Z","timestamp":1740123503478,"version":"3.37.3"},"reference-count":95,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:00:00Z","timestamp":1578700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:00:00Z","timestamp":1578700800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"crossref","award":["MOST 108-2410-H-009-057"],"award-info":[{"award-number":["MOST 108-2410-H-009-057"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ministry of Science and Technology","award":["MOST 106-2410-H-009-063-MY2"],"award-info":[{"award-number":["MOST 106-2410-H-009-063-MY2"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s11227-020-03146-9","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T06:02:42Z","timestamp":1578722562000},"page":"7107-7139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["TCR: a trustworthy and churn-resilient academic distribution and retrieval system in P2P networks"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5164-9171","authenticated-orcid":false,"given":"Yung-Ting","family":"Chuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,11]]},"reference":[{"key":"3146_CR1","unstructured":"Afergan MM, Leighton FT, Parikh JG (2012) Hybrid content delivery network (CDN) and peer-to-peer (P2P) network, December\u00a011 2012. US Patent 8,332,484"},{"key":"3146_CR2","doi-asserted-by":"crossref","first-page":"55074","DOI":"10.1109\/ACCESS.2018.2872568","volume":"6","author":"I Ali","year":"2018","unstructured":"Ali I, Chang RY, Hsu C-H (2018) Soqas: distributively finding high-quality answerers in dynamic social networks. IEEE Access 6:55074\u201355089","journal-title":"IEEE Access"},{"key":"3146_CR3","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for near neighbor problem in high dimensions. In: Proceedings of the Symposium on the Foundations of Computer Science, pp 459\u2013468"},{"issue":"1","key":"3146_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun ACM 51(1):117","journal-title":"Commun ACM"},{"key":"3146_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s12599-017-0505-1","volume":"59","author":"R Beck","year":"2017","unstructured":"Beck R, Avital M, Rossi M, Thatcher JB (2017) Blockchain technology in business and information systems research. Bus Inf Syst Eng 59:381. https:\/\/doi.org\/10.1007\/s12599-017-0505-1","journal-title":"Bus Inf Syst Eng"},{"key":"3146_CR6","doi-asserted-by":"crossref","unstructured":"Bianchi S, Felber P, Gradinariu M (2007) Content-based publish\/subscribe using distributed r-trees. In: Proceedings of Euro-Par, pp 537\u2013548, Rennes, France, August 2007","DOI":"10.1007\/978-3-540-74466-5_57"},{"issue":"2","key":"3146_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J Buhler","year":"2002","unstructured":"Buhler J, Tompa M (2002) Finding motifs using random projections. J Comput Biol 9(2):225\u2013242","journal-title":"J Comput Biol"},{"issue":"1","key":"3146_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10723-019-09475-1","volume":"17","author":"Z Cai","year":"2019","unstructured":"Cai Z, Lee I, Chu S-C, Huang X (2019) SimSim: a service discovery method preserving content similarity and spatial similarity in P2P mobile cloud. J Grid Comput 17(1):79\u201395","journal-title":"J Grid Comput"},{"key":"3146_CR9","doi-asserted-by":"crossref","first-page":"101801","DOI":"10.1016\/j.adhoc.2018.10.027","volume":"92","author":"M Cebe","year":"2019","unstructured":"Cebe M, Akkaya K (2019) Efficient certificate revocation management schemes for iot-based advanced metering infrastructures in smart cities. Ad Hoc Netw 92:101801","journal-title":"Ad Hoc Netw"},{"key":"3146_CR10","unstructured":"Choffnes DR, Bustamante FE (2008) Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems. In: ACM SIGCOMM Computer Communication Review, vol\u00a038. ACM, pp 363\u2013374"},{"key":"3146_CR11","doi-asserted-by":"crossref","unstructured":"Clarke I, Sandberg O, Wiley B, Hong T (2001) Freenet: a distributed anonymous information storage and retrieval system. In: Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, pp 46\u201366, Berkeley, CA, July 2001","DOI":"10.1007\/3-540-44702-4_4"},{"key":"3146_CR12","doi-asserted-by":"crossref","unstructured":"Clayton R, Murdoch SJ, Watson RNM (2006) Ignoring the great firewall of china. In: International Workshop on Privacy Enhancing Technologies. Springer, pp 20\u201335","DOI":"10.1007\/11957454_2"},{"issue":"1","key":"3146_CR13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E Cohen","year":"2001","unstructured":"Cohen E, Datar M, Fujiwara S, Gionis A, Indyk P, Motwani R, Ullman JD, Yang C (2001) Finding interesting associations without support pruning. IEEE Trans Knowl Data Eng 13(1):64\u201378","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3146_CR14","doi-asserted-by":"crossref","unstructured":"Disterhoft A, Graffi K (2015) Protected chords in the web: secure P2P framework for decentralized online social networks. In: 2015 IEEE International Conference on Peer-to-Peer Computing (P2P). IEEE, pp 1\u20135","DOI":"10.1109\/P2P.2015.7328520"},{"issue":"6","key":"3146_CR15","doi-asserted-by":"crossref","first-page":"1354","DOI":"10.1007\/s12083-016-0539-z","volume":"10","author":"Q Du","year":"2017","unstructured":"Du Q, Liu M, Xu Q, Song H, Sun L, Ren P (2017) Interference-constrained routing over P2P-share enabled multi-hop D2D networks. Peer-to-Peer Netw Appl 10(6):1354\u20131370","journal-title":"Peer-to-Peer Netw Appl"},{"key":"3146_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.patrec.2019.09.025","volume":"128","author":"O Durmaz","year":"2019","unstructured":"Durmaz O, Bilge HS (2019) Fast image similarity search by distributed locality sensitive hashing. Pattern Recognit Lett 128:361\u2013369","journal-title":"Pattern Recognit Lett"},{"issue":"2","key":"3146_CR17","first-page":"57","volume":"5","author":"G Ekbatanifard","year":"2019","unstructured":"Ekbatanifard G, Yousefi O (2019) A novel trust management model in the social internet of things. J Adv Comput Eng Technol 5(2):57\u201370","journal-title":"J Adv Comput Eng Technol"},{"key":"3146_CR18","doi-asserted-by":"crossref","unstructured":"Ferreira RA, Ramanathan MK, Awan A, Grama A, Jagannathan S (2005) Search with probabilistic guarantees in unstructured peer-to-peer networks. In: Proceedings of 5th IEEE International Conference on Peer-to-Peer Computing, pp 165\u2013172, Konstanz, Germany, August 2005","DOI":"10.1109\/P2P.2005.33"},{"key":"3146_CR19","unstructured":"Fiat A, Saia J (2002) Censorship resistant peer-to-peer content addressable networks. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp 94\u2013103"},{"key":"3146_CR20","doi-asserted-by":"crossref","unstructured":"Georgescu B, Shimshoni I, Meer P (2003) Mean shift based clustering in high dimensions: a texture classification example. In: ICCV, vol 3, p 456","DOI":"10.1109\/ICCV.2003.1238382"},{"issue":"10","key":"3146_CR21","doi-asserted-by":"crossref","first-page":"150","DOI":"10.3390\/a11100150","volume":"11","author":"M Gharib","year":"2018","unstructured":"Gharib M, Malekimajd M, Movaghar A (2018) Slopcloud: an efficient solution for locality problem in peer-to-peer cloud systems. Algorithms 11(10):150","journal-title":"Algorithms"},{"issue":"2","key":"3146_CR22","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1007\/s10115-018-1295-6","volume":"61","author":"MS Gibson","year":"2019","unstructured":"Gibson MS, Vasconcelos WW (2019) A knowledge-based approach to multiplayer games in peer-to-peer networks. Knowl Inf Syst 61(2):1091\u20131121","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"3146_CR23","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.peva.2005.01.002","volume":"63","author":"C Gkantsidis","year":"2006","unstructured":"Gkantsidis C, Mihail M, Saberi A (2006) Random walks in peer-to-peer networks: algorithms and evaluation. Perform Eval 63(3):241\u2013263","journal-title":"Perform Eval"},{"key":"3146_CR24","doi-asserted-by":"crossref","unstructured":"Gupta A, Sahin O, Agrawal D, El Abbadi A (2004) Meghdoot: content-based publish\/subscribe over P2P networks. In: Proceedings of the 5th ACM\/IFIP\/USENIX International Conference on Middleware, pp 254\u2013273, Toronto, Canada, October 2004","DOI":"10.1007\/978-3-540-30229-2_14"},{"key":"3146_CR25","unstructured":"Haveliwala T, Gionis A, Indyk P (2000) Scalable techniques for clustering the web (extended abstract). In: Third international workshop on the web and databases (WebDB 2000), May 18\u201319, 2000, Dallas, Texas"},{"issue":"1","key":"3146_CR26","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1109\/TII.2019.2939797","volume":"16","author":"S He","year":"2020","unstructured":"He S, Tang Q, Wu CQ, Shen X (2020) Decentralizing IoT management systems using blockchain for censorship resistance. IEEE Trans Ind Inform 16(1):715\u2013727. https:\/\/doi.org\/10.1109\/TII.2019.2939797","journal-title":"IEEE Trans Ind Inform"},{"key":"3146_CR27","doi-asserted-by":"crossref","unstructured":"Herrera O, Znati T (2007) Modeling churn in P2P networks. In: 40th Annual Simulation Symposium (ANSS\u201907). IEEE, pp 33\u201340","DOI":"10.1109\/ANSS.2007.28"},{"key":"3146_CR28","doi-asserted-by":"crossref","unstructured":"Herrmann M, Zhang R, Ning K-C, Diaz C, Preneel B (2014) Censorship-resistant and privacy-preserving distributed web search. In: 14-th IEEE International Conference on Peer-to-Peer Computing. IEEE, pp 1\u201310","DOI":"10.1109\/P2P.2014.6934312"},{"key":"3146_CR29","unstructured":"Ho JC, Zhang Q, Lee C-S (2011) Google\u2019s retreat from china: two competing theories. In: 2011 Proceedings of PICMET\u201911: Technology Management in the Energy Smart World (PICMET). IEEE, pp 1\u20138"},{"key":"3146_CR30","unstructured":"Hunt A, Pon D, Kiernan C, Adams B, Edgeworth J, Manousos E, Linn J (2016) Using hash signatures of DOM objects to identify website similarity, July\u00a05 2016. US Patent 9,386,037"},{"key":"3146_CR31","doi-asserted-by":"crossref","unstructured":"Isdal T, Piatek M, Krishnamurthy A, Anderson T (2010) Privacy preserving P2P data sharing with OneSwarm. In: Proceedings of the ACM SIGCOMM Conference, pp 111\u2013122, New Delhi, India, September 2010","DOI":"10.1145\/1851182.1851198"},{"key":"3146_CR32","doi-asserted-by":"publisher","first-page":"3725898","DOI":"10.1155\/2017\/3725898","volume":"2017","author":"S Jia","year":"2017","unstructured":"Jia S, Zhang R, Jiang S, Zhang M (2017) A novel video sharing solution based on demand-aware resource caching optimization in wireless mobile networks. Mob Inf Syst 2017:3725898. https:\/\/doi.org\/10.1155\/2017\/3725898","journal-title":"Mob Inf Syst"},{"key":"3146_CR33","doi-asserted-by":"crossref","unstructured":"Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in P2P networks. In: Proceedings of the 12th International Conference on World Wide Web. ACM, pp 640\u2013651","DOI":"10.1145\/775152.775242"},{"key":"3146_CR34","unstructured":"Konforty D, Adam Y, Estrada D, Meredith LG (2015) Synereo: the decentralized and distributed social network"},{"key":"3146_CR35","doi-asserted-by":"crossref","unstructured":"Lei J, Fu X (2009) Interest-based peer-to-peer group management. In: International Workshop on Future Multimedia Networking. Springer, pp 107\u2013118","DOI":"10.1007\/978-3-642-02472-6_10"},{"key":"3146_CR36","doi-asserted-by":"crossref","unstructured":"Li Y, Shou L, Tan K-L (2008) Cyber: a community-based search engine. In: 2008 Eighth International Conference on Peer-to-Peer Computing. IEEE, pp 215\u2013224","DOI":"10.1109\/P2P.2008.24"},{"issue":"9","key":"3146_CR37","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1109\/TPDS.2007.1059","volume":"18","author":"Y Liu","year":"2007","unstructured":"Liu Y, Xiao L, Ni L (2007) Building a scalable bipartite P2P overlay network. IEEE Trans Parallel Distrib Syst 18(9):1296\u20131306","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3146_CR38","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.procs.2016.08.056","volume":"94","author":"K Lu","year":"2016","unstructured":"Lu K, Wang J, Xie L, Zhen Q, Li M (2016) An eigentrust-based hybrid trust model in P2P file sharing networks. Procedia Comput Sci 94:366\u2013371","journal-title":"Procedia Comput Sci"},{"key":"3146_CR39","doi-asserted-by":"crossref","unstructured":"Ma Y, Wang D (2016) A novel trust model for P2P networks. In: 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). IEEE, pp 1969\u20131973","DOI":"10.1109\/FSKD.2016.7603482"},{"key":"3146_CR40","doi-asserted-by":"crossref","unstructured":"Marti S, Ganesan P, Garcia-Molina H (2004) Sprout: P2P routing with social networks. In: International Conference on Extending Database Technology. Springer, pp 425\u2013435","DOI":"10.1007\/978-3-540-30192-9_42"},{"issue":"12","key":"3146_CR41","doi-asserted-by":"crossref","first-page":"101","DOI":"10.14257\/ijdta.2016.9.12.10","volume":"9","author":"A Maurya","year":"2016","unstructured":"Maurya A, Singh MP (2016) Trust evaluation on social media based on different similarity metrics. Int J Database Theory Appl 9(12):101\u2013110","journal-title":"Int J Database Theory Appl"},{"issue":"1","key":"3146_CR42","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s11227-017-2125-4","volume":"74","author":"X Meng","year":"2018","unstructured":"Meng X (2018) A churn-aware durable data storage scheme in hybrid P2P networks. J Supercomput 74(1):183\u2013204","journal-title":"J Supercomput"},{"issue":"6","key":"3146_CR43","doi-asserted-by":"crossref","first-page":"2553","DOI":"10.1007\/s11227-018-2286-9","volume":"74","author":"X Meng","year":"2018","unstructured":"Meng X (2018) Speedtrust: a super peer-guaranteed trust model in hybrid P2P networks. J Supercomput 74(6):2553\u20132580","journal-title":"J Supercomput"},{"issue":"2","key":"3146_CR44","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.compeleceng.2012.11.001","volume":"39","author":"X Meng","year":"2013","unstructured":"Meng X, Chen X, Ding Y (2013) Using the complementary nature of node joining and leaving to handle churn problem in P2P networks. Comput Electr Eng 39(2):326\u2013337","journal-title":"Comput Electr Eng"},{"issue":"1","key":"3146_CR45","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s12083-014-0318-7","volume":"9","author":"X Meng","year":"2016","unstructured":"Meng X, Jin J (2016) A free rider aware topological construction strategy for search in unstructured P2P networks. Peer-to-Peer Netw Appl 9(1):127\u2013141","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"1","key":"3146_CR46","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TDSC.2016.2530720","volume":"15","author":"X Meng","year":"2016","unstructured":"Meng X, Liu D (2016) Getrust: a guarantee-based trust model in chord-based P2P networks. IEEE Trans Dependable Secur Comput 15(1):54\u201368","journal-title":"IEEE Trans Dependable Secur Comput"},{"issue":"1","key":"3146_CR47","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TDSC.2016.2530720","volume":"15","author":"X Meng","year":"2018","unstructured":"Meng X, Liu D (2018) Getrust: a guarantee-based trust model in chord-based P2P networks. IEEE Trans Dependable Secur Comput 15(1):54\u201368","journal-title":"IEEE Trans Dependable Secur Comput"},{"issue":"1","key":"3146_CR48","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MNET.2004.1265831","volume":"18","author":"J Mischke","year":"2004","unstructured":"Mischke J, Stiller B (2004) A methodology for the design of distributed search in P2P middleware. IEEE Netw 18(1):30\u201337","journal-title":"IEEE Netw"},{"issue":"6","key":"3146_CR49","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1007\/s12083-015-0402-7","volume":"9","author":"A Naghizadeh","year":"2016","unstructured":"Naghizadeh A, Razeghi B, Meamari E, Hatamian M, Atani RE (2016) C-trust: a trust management system to improve fairness on circular P2P networks. Peer-to-Peer Netw Appl 9(6):1128\u20131144","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"13","key":"3146_CR50","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1002\/sec.1478","volume":"9","author":"SM Nallakannu","year":"2016","unstructured":"Nallakannu SM, Thiagarajan R (2016) PSO-based optimal peer selection approach for highly secure and trusted P2P system. Secur Commun Netw 9(13):2186\u20132199","journal-title":"Secur Commun Netw"},{"issue":"5","key":"3146_CR51","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1109\/TKDE.2013.105","volume":"26","author":"M Nitti","year":"2014","unstructured":"Nitti M, Girau R, Atzori L (2014) Trustworthiness management in the social internet of things. IEEE Trans Knowl Data Eng 26(5):1253\u20131266","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3146_CR52","unstructured":"Norta A (2016) Designing a smart-contract application layer for transacting decentralized autonomous organizations. In: International Conference on Advances in Computing and Data Sciences. Springer, pp 595\u2013604"},{"key":"3146_CR53","doi-asserted-by":"crossref","unstructured":"Ouyang Z, Memon N, Suel T, Trendafilov D (2002) Cluster-based delta compression of a collection of files. In: Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002. IEEE, pp 257\u2013266","DOI":"10.1109\/WISE.2002.1181662"},{"key":"3146_CR54","unstructured":"Pappu A, Stent A (2017) Location-based recommendations using nearest neighbors in a locality sensitive hashing (LSH) index, May\u00a025 2017. US Patent App. 14\/948,213"},{"key":"3146_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-019-00780-w","author":"S Park","year":"2019","unstructured":"Park S, Cha B, Chung K, Kim J (2019) Mobile IoT device summarizer using P2P web search engine and inherent characteristic of contents. Peer-to-Peer Netw Appl. https:\/\/doi.org\/10.1007\/s12083-019-00780-w","journal-title":"Peer-to-Peer Netw Appl"},{"key":"3146_CR56","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of Massive Datasets","author":"A Rajaraman","year":"2011","unstructured":"Rajaraman A, Ullman JD (2011) Mining of Massive Datasets. Cambridge University Press, USA"},{"key":"3146_CR57","unstructured":"Rhea S, Geels D, Roscoe T, Kubiatowicz J et al (2004) Handling churn in a DHT. In: Proceedings of the USENIX Annual Technical Conference, vol\u00a06. Boston, MA, USA, pp 127\u2013140"},{"issue":"17","key":"3146_CR58","first-page":"3485","volume":"50","author":"J Risson","year":"2006","unstructured":"Risson J, Moors T (2006) Survey of research towards robust peer-to-peer networks: search methods. Comput Netw Int J Comput Telecommun Netw 50(17):3485\u20133521","journal-title":"Comput Netw Int J Comput Telecommun Netw"},{"key":"3146_CR59","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proceedings of the 2001 IFIP\/ACM International Conference on Distributed Systems Platforms, pp 329\u2013350, Heidelberg, Germany, November 2001","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"4","key":"3146_CR60","doi-asserted-by":"crossref","first-page":"639","DOI":"10.2189\/asqu.2010.55.4.639","volume":"55","author":"Z Sasovova","year":"2010","unstructured":"Sasovova Z, Mehra A, Borgatti SP, Schippers MC (2010) Network churn: the effects of self-monitoring personality on brokerage dynamics. Adm Sci Q 55(4):639\u2013670","journal-title":"Adm Sci Q"},{"key":"3146_CR61","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.jnca.2016.03.017","volume":"71","author":"M Seddiki","year":"2016","unstructured":"Seddiki M, Benchaiba M (2016) 2p-lookup: popularity and proximity based P2P lookup mechanism over manets. J Netw Comput Appl 71:181\u2013193","journal-title":"J Netw Comput Appl"},{"issue":"3","key":"3146_CR62","doi-asserted-by":"crossref","first-page":"23","DOI":"10.4018\/IJSIR.2018070102","volume":"9","author":"V \u0160e\u0161um-\u010cavi\u0107","year":"2018","unstructured":"\u0160e\u0161um-\u010cavi\u0107 V, Kuehn E, Zischka S (2018) Swarm-inspired routing algorithms for unstructured P2P networks. Int J Swarm Intell Res 9(3):23\u201363","journal-title":"Int J Swarm Intell Res"},{"issue":"2","key":"3146_CR63","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/s12083-015-0341-3","volume":"9","author":"N Shah","year":"2016","unstructured":"Shah N, Ahmad A, Nazir B, Qian D (2016) A cross-layer approach for partition detection at overlay layer for structured P2P in manets. Peer-to-Peer Netw Appl 9(2):356\u2013371","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"5","key":"3146_CR64","doi-asserted-by":"crossref","first-page":"3136","DOI":"10.1109\/TNET.2015.2509967","volume":"24","author":"V Shah","year":"2016","unstructured":"Shah V, De Veciana G, Kesidis G (2016) A stable approach for routing queries in unstructured P2P networks. IEEE\/ACM Trans Netw TON 24(5):3136\u20133147","journal-title":"IEEE\/ACM Trans Netw TON"},{"issue":"2","key":"3146_CR65","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1080\/19331681.2018.1449700","volume":"15","author":"F Shen","year":"2018","unstructured":"Shen F, Zhang Z (2018) Do circumvention tools promote democratic values? Exploring the correlates of anticensorship technology adoption in China. J Inf Technol Politics 15(2):106\u2013121","journal-title":"J Inf Technol Politics"},{"issue":"10","key":"3146_CR66","doi-asserted-by":"crossref","first-page":"2874","DOI":"10.1109\/TPDS.2014.2359020","volume":"26","author":"H Shen","year":"2015","unstructured":"Shen H, Li Z, Chen K (2015) Social-P2P: an online social network based P2P file sharing system. IEEE Trans Parallel Distrib Syst 26(10):2874\u20132889","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"11","key":"3146_CR67","doi-asserted-by":"crossref","first-page":"3226","DOI":"10.1109\/TPDS.2015.2468227","volume":"27","author":"H Shen","year":"2015","unstructured":"Shen H, Liu AX, Liu G, Zhao L (2015) Freeweb: P2P-assisted collaborative censorship-resistant web browsing. IEEE Trans Parallel Distrib Syst 27(11):3226\u20133241","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"3146_CR68","doi-asserted-by":"crossref","first-page":"296","DOI":"10.3390\/app9020296","volume":"9","author":"SJH Shiau","year":"2019","unstructured":"Shiau SJH, Huang Y-C, Yen C-H, Tsai Y-C, Sun C-K, Juang J-N, Huang C-Y, Huang C-C, Huang S-K (2019) A novel massive deployment solution based on the peer-to-peer protocol. Appl Sci 9(2):296","journal-title":"Appl Sci"},{"key":"3146_CR69","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11277-019-06256-7","volume":"107","author":"SK Singh","year":"2019","unstructured":"Singh SK, Kumar C, Nath P (2019) Local contribution (LC) and trustworthiness factors to induce fairness in P2P networks. Wirel Pers Commun 107:303. https:\/\/doi.org\/10.1007\/s11277-019-06256-7","journal-title":"Wirel Pers Commun"},{"key":"3146_CR70","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, pp 149\u2013160, San Diego, CA, August 2001","DOI":"10.1145\/383059.383071"},{"key":"3146_CR71","doi-asserted-by":"crossref","unstructured":"Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement. ACM, pp 189\u2013202","DOI":"10.1145\/1177080.1177105"},{"issue":"1","key":"3146_CR72","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10586-018-2819-2","volume":"22","author":"SY Sun","year":"2019","unstructured":"Sun SY, Yao WB, Li XY (2019) Sord: a new strategy of online replica deduplication in cloud-P2P. Clust Comput 22(1):1\u201323","journal-title":"Clust Comput"},{"issue":"4","key":"3146_CR73","doi-asserted-by":"crossref","first-page":"2085","DOI":"10.1109\/TCNS.2018.2795704","volume":"5","author":"H Terelius","year":"2018","unstructured":"Terelius H, Johansson KH (2018) Peer-to-peer gradient topologies in networks with churn. IEEE Trans Control Netw Syst 5(4):2085\u20132095","journal-title":"IEEE Trans Control Netw Syst"},{"key":"3146_CR74","doi-asserted-by":"crossref","unstructured":"Terpstra WW, Kangasharju J, Leng C, Buchmann AP (2007) Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, pp 49\u201360, Kyoto, Japan, August 2007","DOI":"10.1145\/1282380.1282387"},{"issue":"11","key":"3146_CR75","first-page":"1739","volume":"52","author":"DA Tran","year":"2010","unstructured":"Tran DA, Pham C (2010) Enabling content-based publish\/subscribe services in cooperative P2P networks. Comput Netw Int J Comput Telecommun Netw 52(11):1739\u20131749","journal-title":"Comput Netw Int J Comput Telecommun Netw"},{"issue":"2","key":"3146_CR76","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/s12083-015-0340-4","volume":"9","author":"Z Trifa","year":"2016","unstructured":"Trifa Z, Khemakhem M (2016) A novel replication technique to attenuate churn effects. Peer-to-Peer Netw Appl 9(2):344\u2013355","journal-title":"Peer-to-Peer Netw Appl"},{"key":"3146_CR77","unstructured":"Tschantz MC, Afroz S, Sajid S, Qazi SA, Javed M, Paxson V (2018) A bestiary of blocking: the motivations and modes behind website unavailability. In: 8th $$\\{$$USENIX$$\\}$$ Workshop on Free and Open Communications on the Internet ($$\\{$$FOCI$$\\}$$ 18)"},{"key":"3146_CR78","unstructured":"Tsoumakos D, Roussopoulos N (2003) A comparison of peer-to-peer search methods. In: Proceedings of the Sixth International Workshop on the Web and Databases, pp 61\u201366, San Diego, CA, June 2003"},{"issue":"4","key":"3146_CR79","first-page":"293","volume":"11","author":"S Vimal","year":"2019","unstructured":"Vimal S, Srivatsa SK (2019) A file sharing system in peer-to-peer network by a nearness-sensible method. Int J Reason Based Intell Syst 11(4):293\u2013299","journal-title":"Int J Reason Based Intell Syst"},{"key":"3146_CR80","unstructured":"Wong B, Guha S (2008) Quasar: a probabilistic publish-subscribe system for social networks. In: Proceedings of the 7th International Workshop on Peer-To-Peer Systems, Tampa Bay, FL, February 2008"},{"key":"3146_CR81","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-03047-6","author":"J Wu","year":"2019","unstructured":"Wu J, Shen L, Liu L (2019) LSH-based distributed similarity indexing with load balancing in high-dimensional space. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-019-03047-6","journal-title":"J Supercomput"},{"issue":"3","key":"3146_CR82","doi-asserted-by":"crossref","first-page":"2850","DOI":"10.1109\/TVT.2019.2894056","volume":"68","author":"Y Xiao","year":"2019","unstructured":"Xiao Y, Liu Y (2019) Bayestrust and vehiclerank: constructing an implicit web of trust in vanet. IEEE Trans Veh Technol 68(3):2850\u20132864","journal-title":"IEEE Trans Veh Technol"},{"issue":"4","key":"3146_CR83","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/1402946.1402999","volume":"38","author":"H Xie","year":"2008","unstructured":"Xie H, Yang YR, Krishnamurthy A, Liu YG, Silberschatz A (2008) P4P: provider portal for applications. ACM SIGCOMM Comput Commun Rev 38(4):351\u2013362","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"7","key":"3146_CR84","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/TKDE.2004.1318566","volume":"16","author":"L Xiong","year":"2004","unstructured":"Xiong L, Liu L (2004) Peertrust: supporting reputation-based trust for peer-to-peer electronic communities. IEEE Trans Knowl Data Eng 16(7):843\u2013857","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3146_CR85","doi-asserted-by":"crossref","unstructured":"Xue H, You J, Wang J (2019) Churn resilience of distributed content service system on smart terminals network. In: 2019 21st International Conference on Advanced Communication Technology (ICACT). IEEE, pp 460\u2013466","DOI":"10.23919\/ICACT.2019.8701903"},{"key":"3146_CR86","doi-asserted-by":"crossref","unstructured":"Yadav TK, Sinha A, Gosain D, Sharma PK, Chakravarty S (2018) Where the light gets in: analyzing web censorship mechanisms in india. In: Proceedings of the Internet Measurement Conference 2018. ACM, pp 252\u2013264","DOI":"10.1145\/3278532.3278555"},{"key":"3146_CR87","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-019-01283-4","author":"B Yan","year":"2019","unstructured":"Yan B, Yu J, Yang M, Jiang H, Wan Z, Ni L (2019) A novel distributed social internet of things service recommendation scheme based on LSH forest. Pers Ubiquitous Comput. https:\/\/doi.org\/10.1007\/s00779-019-01283-4","journal-title":"Pers Ubiquitous Comput"},{"issue":"2","key":"3146_CR88","doi-asserted-by":"crossref","first-page":"20","DOI":"10.4018\/IJIIT.2019040102","volume":"15","author":"Y Yan","year":"2019","unstructured":"Yan Y, Zhang J, Ma X (2019) Modeling of agent-based complex network to detect the trust of investors in P2P platform. Int J Intell Inf Technol 15(2):20\u201331","journal-title":"Int J Intell Inf Technol"},{"key":"3146_CR89","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/j.future.2017.04.022","volume":"86","author":"B Yuan","year":"2018","unstructured":"Yuan B, Liu L, Antonopoulos N (2018) Efficient service discovery in decentralized online social networks. Future Gener Comput Syst 86:775\u2013791","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"3146_CR90","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1186\/s13638-017-0942-z","volume":"2017","author":"M Zghaibeh","year":"2017","unstructured":"Zghaibeh M, Ul Hassan N (2017) Sham: scalable homogeneous addressing mechanism for structured P2P networks. EURASIP J Wirel Commun Netw 2017(1):161","journal-title":"EURASIP J Wirel Commun Netw"},{"key":"3146_CR91","doi-asserted-by":"crossref","first-page":"12483","DOI":"10.1109\/ACCESS.2018.2801259","volume":"6","author":"M Zghaibeh","year":"2018","unstructured":"Zghaibeh M, Ul Hassan N (2018) d-SHAM: a constant degree-scalable homogeneous addressing mechanism for structured P2P networks. IEEE Access 6:12483\u201312492","journal-title":"IEEE Access"},{"issue":"8","key":"3146_CR92","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/TPDS.2007.1035","volume":"18","author":"R Zhang","year":"2007","unstructured":"Zhang R, Charlie Hu Y (2007) Assisted peer-to-peer search with partial indexing. IEEE Trans Parallel Distrib Syst 18(8):1146\u20131158","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"3146_CR93","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"BY Zhao","year":"2004","unstructured":"Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22(1):41\u201353","journal-title":"IEEE J Sel Areas Commun"},{"issue":"9","key":"3146_CR94","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1109\/TKDE.2008.48","volume":"20","author":"R Zhou","year":"2008","unstructured":"Zhou R, Hwang K, Cai M (2008) Gossiptrust for fast reputation aggregation in peer-to-peer networks. IEEE Trans Knowl Data Eng 20(9):1282\u20131295","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3146_CR95","doi-asserted-by":"crossref","unstructured":"Zuo M, Zhang X, Liu Q (2008) The development of search engine in China and its problems revealed in net information retrieval. In: 2008 International Symposiums on Information Processing. IEEE, pp 292\u2013296","DOI":"10.1109\/ISIP.2008.74"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03146-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-020-03146-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03146-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:05:24Z","timestamp":1695600324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-020-03146-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,11]]},"references-count":95,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["3146"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03146-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2020,1,11]]},"assertion":[{"value":"11 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}