LAAPS: an efficient file-based search in unstructured peer-to-peer networks using reinforcement algorithm

References

• Giordanelli R, Mastroianni C, Meo M. Bio-inspired P2P systems: the case of multidimensional overlay. ACM Trans Auton Adapt Syst. 2012;7(4) 1–28. doi: 10.1145/2382570.2382571
   Web of Science ®Google Scholar
• Tigelaar AS, Hiemstra D, Trieschnigg D. Peer-to-peer information retrieval: an overview. ACM Trans Inf Syst. 2012;30(2):1–34. Doi:10.1145/2180868.2180871.
   Web of Science ®Google Scholar
• Tsoumakos D, Roussopoulos N. Adaptive probabilistic search in peer-to-peer networks. Technical Report, CS-TR-4451, 2003.
   Google Scholar
• Chawathe Y, Ratnasamy S, Breslau L, et al. Making Gnutella-like P2P systems scalable. ACM SIGCOMM '03; 2003. p. 407–418. Doi:10.1145/863955.864000.
   Google Scholar
• Loo BT, Huebsch R, Stoica I, et al. The case for a hybrid P2P search infrastructure. In: Voelker GM, Shenker S, editors. Peer-to-Peer Systems III, LNCS, Vol. 3279. Berlin: Springer; 2005. p. 141–150. Doi:10.1007/978-3-540-30183-7-14.
   Google Scholar
• Liang J, Kumar R, Xi Y, et al. Pollution in P2P file sharing systems. IEEE INFOCOM, vol. 2; 2005. p. 1174–1185.
   Google Scholar
• Gkantsidis C, Mihail M, Saberi A. Random walks in peer-to-peer networks. IEEE INFOCOM, vol. 1; 2004. p. 120–130.
   Google Scholar
• Yang B, Garcia-Molina H. Improving search in peer-to-peer network's. 22nd IEEE International Conference on Distributed Computing (IEEE ICDCS'02); 2002. p. 5–14.
   Google Scholar
• Lv C, Cao P, Cohen E, et al. Search and replication in unstructured peer-to-peer networks. ACM International Conference on Supercomputing (ICS); 2002. p. 84–95.
   Google Scholar
• Cohen E, Kaplan H, Fiat A. Associative search in peer-to-peer networks: harnessing latent semantics. IEEE INFOCOM; April 2003. p. 1261–1271.
   Google Scholar
• Yang C, Li X. Dominating-set-based searching in peer-to-peer networks. Int J High Perform Comput Netw. 2005;3(4):205–210. doi: 10.1504/IJHPCN.2005.008562
   Google Scholar
• Shojafar M, Abawajy JH, Delkhah Z, et al. An efficient and distributed file search in unstructured peer-to-peer networks. Peer-to-Peer Netw Appl. 2015;8(1):120–136. doi: 10.1007/s12083-013-0236-0
   Web of Science ®Google Scholar
• http://www.gnutella.com.
   Google Scholar
• Morselli R, Bhattacharjee B, Marsh MA, et al. Efficient lookup on unstructured topologies. IEEE J Sel Areas Commun. 2007;15(1):2–72.
   Google Scholar
• Merugu S, Srinivasan S, Zegura E. Adding structure to unstructured peer-to-peer networks: the role of overlay topology. Networked Group Communication (NGC), vol. 2816; 2003. p. 83–94.
   Google Scholar
• Ghorbani M, Meybodi MR, Saghiri AM, et al. A new version of K-random walks algorithm in peer-to-peer networks utilizing learning automata. Fifth Conference on Information and Knowledge Technology (IKT); 2013. p. 1–6.
   Google Scholar
• Shojafar M, Pooranian Z, Naranjo PGV, et al. FLAPS: bandwidth and delay-efficient distributed data searching in Fog-supported P2P content delivery networks. J Supercomput. 2017;73(12):5239–5260. doi: 10.1007/s11227-017-2082-y
   Web of Science ®Google Scholar
• Thampi SM, Sekaran KC. Autonomous data replication using Q-learning for unstructured P2P networks. Sixth IEEE International Symposium on Network Computing and Applications (NCA); 2007. p. 311–317.
   Google Scholar
• Tsoumakos D, Roussopoulos N. Adaptive probabilistic search for peer-to-peer networks. Third International Conference on Peer-to-Peer Computing (P2P 2003); 2003. p. 102–109.
   Google Scholar
• Mellor J, Aranzulla P. Using an S-model response environment with learning automata based routing schemes for IP networks. Eighth IFIP Workshop on Performance Modelling and Evaluation of ATM and IP Networks; UK, 2000. p. 56/1–56/12.
   Google Scholar
• Boppana R, Halldorsson MM. Approximating maximum independent sets by excluding subgraphs. BIT Numer Math. 1992;32(2):180–196. doi: 10.1007/BF01994876
   Google Scholar
• Bui TN, Eppley PH. A hybrid genetic algorithm for the maximum clique problem. Sixth International Conference on Genetic Algorithms; 1995. p. 478–484.
   Google Scholar
• Narendra KS, Thathachar MAL. Learning automata: an introduction. Englewood Cliffs (NJ): Prentice-Hall; 1989.
   Google Scholar
• Poznyak AS, Najim K. Learning automata and stochastic optimization. Berlin, Heidelberg, New York (NY): Springer-Verlag; 1997. ISBN 3-540-76154-3.
   Google Scholar
• Sayyad A, Shojafar M, Delkhah Z, et al. Region directed diffusion in sensor network using learning automata: RDDLA. J Adv Comput Res. 2011;71–83.
   Google Scholar
• Rhea SC, Kubiatowicz J. Probabilistic location and routing. 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'02), vol. 3; 2002. p. 1248–1257.
   Google Scholar
• Shojafar M, Cordeschi N, Baccarelli E. Energy-efficient adaptive resource management for real-time vehicular cloud services. IEEE Trans Cloud Comput. 2016;PP(99):1–14.
   Google Scholar
• http://peersim.sourceforge.net/.
   Google Scholar
• Jawhar I, Wu J. A two-level random walk search protocol for peer-to-peer networks. Eighth World Multi-Conference on Systemic, Cybernetics and Informatics; 2004. p. 1–5.
   Google Scholar
• Marti S, Ganesan P, Molina HG. DHT routing using social links. Third International Workshop on Peer-to-Peer Systems (IPTPS'04); 2004. p. 100–111.
   Google Scholar
• Ripeanu M, Foster I, Iamnitchi A. Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design. IEEE Int Comput J. 2002;6(1):50–57. doi: 10.1109/4236.978369
   Web of Science ®Google Scholar