Unstructured Peer-to-Peer Systems: Towards Swift Routing
Keywords:Peer-to-Peer (P2P), Resource discovery, Routing, Simulation, Unstructured P2P system
In this paper, we contribute to the enhancement of routing in unstructured Peer-to-Peer (P2P) systems. Our contribution aims to propose an alternative to the repetitive interactions between peers in discovery which waste considerable time. We propose a methodology that seeks effectiveness and swiftness. Contrary to classic and heuristic-based routing strategies, the main goal of our proposition is that every peer prepares a database at the integration phase. The database includes information about peers, locations, routes to every destination, etc. Every peer possesses its own database and is able to update it whenever a change occurs in the system. Changes refer to the integration of new peers and the dissociation of existing ones. Theoretically, the communication between peers will become significantly quicker since every peer knows enough information about the other peers forming the system. The application of our strategy demonstrates its fitness to the proposed system model in addition to its celerity and relevance.
 Shah V, De Veciana G & Kesidis G (2016), â€œA Stable Approach for Routing Queries in Unstructured P2P Networksâ€, IEEE/ACM Transactions on Networking, vol. 24, no. 5, pp. 136â€“147.
 Ishak I and Salim N (2008), â€œA Similarity and Feedback Based Query Routing Across Unstructured Peer-to-Peer Networksâ€, International Conference on Advanced Computer Theory and Engineering, p. 60.
 Kumar A & Zegara EW (2005), â€œEfficient and Scalable Query Routing for Unstructured Peer-to-Peer Networksâ€, 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 1162-1173.
 Vu QH, Lupu M & Ooi BC (2009), â€œPeer-to-peer Computing: Principles and Applicationsâ€, Springer.
 Gaeta R & Sereno M (2011), â€œGeneralized Probabilistic Flooding in Unstructured Peer-to-Peer Networksâ€, IEEE Transactions on Parallel and Distributed Systems, vol. 22, pp. 2055-2062.
 Boukerche A, Zarrad A & Araujo R (2010), â€œA Cross-Layer Approach-Based Gnutella for Collaborative Virtual Environments over Mobile Ad hoc Networksâ€, IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 7, pp. 911-924.
 Bundy A & Wallen L (1984), â€œBreadth-First Searchâ€, Catalogue of Artificial Intelligence Tools, Springer Berlin Heidelberg.
 Awerbuch B (1985), â€œA New Distributed Depth-First-Search Algorithmâ€, Information Processing Letters, vol. 20, no. 3, pp. 147-150.
 Korf RE (1985), â€œDepth-First Iterative-Deepening: An Optimal Admissible Tree Searchâ€, Artificial Intelligence, vol. 27, pp. 97-109.
 Yang B & Garcia-Molina H (2002), â€œImproving Search in Peer-to-Peer Networksâ€, 22nd International Conference on Distributed Computing Systems, p. 5.
 Kalogeraki V, Gunopulos D & Zeinalipour-Yazti D (2002), â€œA Local Search Mechanism for Peer-to-Peer Networksâ€, Proceedings of the Eleventh International Conference on Information and Knowledge Management, p. 300.
 Zhaoqing J, Jinyuan Y, Ruonan R & al. (2006), â€œRandom Walk Search in Unstructured P2Pâ€, Journal of Systems Engineering and Electronics, vol. 17, no. 3, pp. 648-653.
 Tsoumakos D & Roussopoulos N (2003), â€œAdaptive Probabilistic Search for Peer-to-Peer Networksâ€, Third International Conference on Peer-to-Peer Computing, p. 102.
 Sripanidkulchai K, Maggs B & Zhang H (2003), â€œEfficient Content Location Using Interest-Based Locality in Peer-to-Peer Systemsâ€, Twenty-Second Annual Joint Conference of the IEEE Computer and Communications (INFOCOM), p. 2166.
 Yang M & Fei Z (2009), â€œA novel approach to improving search efficiency in unstructured peer-to-peer networksâ€, Journal of Parallel and Distributed Computing, Vol. 69, No. 11, pp. 877-884.
 Shah B, Iqbal F and Khattak AM (2016), â€œFuzzy query routing in unstructured mobile peer-to-peer networksâ€, IEEE Tenth International Conference on Semantic Computing (ICSC), p. 154.
 ValÃªncio CR, Neto PS, Costa LR & al. (2011), â€œArchitecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic supportâ€, IEEE 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, p. 263.
 Armetta F & al. (2010), â€œSelf-organized routing for unstructured peer-to-peer networksâ€, IEEE 4th International Conference on Self-Adaptive and Self-Organizing Systems (SASO, p. 273.
 Ed-daoui I, Mazri T & Hmina N (2016), â€œSecurity Enhancement Architectural Model for IMS based Networksâ€, Indian Journal of Science and Technology, Vol. 9, No. 46.
 Kamesh DBK, Sumadhuri DSK, Sahithi MSV & Sastry JKR (2017), â€œAn Efficient Architectural Model for Building Cognitive Expert System Related to Traffic Management in Smart Citiesâ€, Journal of Engineering and Applied Sciences, Vol. 12, No. 9, pp. 2437-2445.
 Ed-daoui I, Mazri T & Hmina N (2017), Towards Reliable IMS-based Networks, LAP LAMBERT Academic Publishing.