Analysis of the flooding search algorithm with OPNET
Arkadiusz Biernacki
TL;DR
This paper evaluates the flooding search algorithm in peer-to-peer networks using the OPNET simulator, analyzing how replicas and TTL affect performance, and demonstrating the simulator's effectiveness for such studies.
Contribution
It introduces a framework for analyzing P2P search algorithms with OPNET and provides insights into flooding algorithm performance based on network parameters.
Findings
Number of replicas influences search efficiency
TTL impacts search success rate
OPNET effectively simulates P2P network behavior
Abstract
In this work, we consider the popular OPNET simulator as a tool for performance evaluation of algorithms operating in peer-to-peer (P2P) networks. We created simple framework and used it to analyse the flooding search algorithm which is a popular technique for searching files in an unstructured P2P network. We investigated the influence of the number of replicas and time to live (TTL) of search queries on the algorithm performance. Preparing the simulation we did not reported the problems which are commonly encountered in P2P dedicated simulators although the size of simulated network was limited.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.