Unstructured Peer-to-Peer Systems: Towards Swift Routing

  • Authors

    • Ilyas Ed-daoui
    • Abdelkhalak El Hami
    • Mhamed Itmi
    • Nabil Hmina
    • Tomader Mazri
    2018-03-08
    https://doi.org/10.14419/ijet.v7i2.3.9963
  • 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.

  • References

    1. [1] 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.

      [2] 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.

      [3] 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.

      [4] Vu QH, Lupu M & Ooi BC (2009), “Peer-to-peer Computing: Principles and Applicationsâ€, Springer.

      [5] 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.

      [6] 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.

      [7] Bundy A & Wallen L (1984), “Breadth-First Searchâ€, Catalogue of Artificial Intelligence Tools, Springer Berlin Heidelberg.

      [8] Awerbuch B (1985), “A New Distributed Depth-First-Search Algorithmâ€, Information Processing Letters, vol. 20, no. 3, pp. 147-150.

      [9] Korf RE (1985), “Depth-First Iterative-Deepening: An Optimal Admissible Tree Searchâ€, Artificial Intelligence, vol. 27, pp. 97-109.

      [10] Yang B & Garcia-Molina H (2002), “Improving Search in Peer-to-Peer Networksâ€, 22nd International Conference on Distributed Computing Systems, p. 5.

      [11] 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.

      [12] 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.

      [13] Tsoumakos D & Roussopoulos N (2003), “Adaptive Probabilistic Search for Peer-to-Peer Networksâ€, Third International Conference on Peer-to-Peer Computing, p. 102.

      [14] 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.

      [15] 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.

      [16] 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.

      [17] 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.

      [18] 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.

      [19] 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.

      [20] 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.

      [21] Ed-daoui I, Mazri T & Hmina N (2017), Towards Reliable IMS-based Networks, LAP LAMBERT Academic Publishing.

  • Downloads

  • How to Cite

    Ed-daoui, I., El Hami, A., Itmi, M., Hmina, N., & Mazri, T. (2018). Unstructured Peer-to-Peer Systems: Towards Swift Routing. International Journal of Engineering & Technology, 7(2.3), 33-36. https://doi.org/10.14419/ijet.v7i2.3.9963