On the Performance of P2P Network: An Assortment Method
Yuqing Zhou

TL;DR
This paper proposes new methods to enhance P2P network performance, focusing on routing, search efficiency, and ranking algorithms, demonstrating improved system efficiency and reduced traffic.
Contribution
It introduces three novel techniques for improving P2P network performance, including sandwich routing, super peer search, and knowledge-based ranking.
Findings
Improved routing efficiency with sandwich technique.
Enhanced search performance via super peer integration.
Reduced network traffic through optimized algorithms.
Abstract
P2P systems have grown dramatically in recent years. The most popular type of P2P systems are file sharing networks, which are used to share various types of content over the Internet. Due to the increase in popularity of P2P systems, the network performance of these systems has become a very important issue in the design and realization of these networks. Hence, the performance of the P2P has been improved. This paper will suggest the following methods for the improvement of the P2P systems: Method-1: Improve the P2P routing by using a sandwich technique. Method-2: Improve the search performance by introducing a new search based on the super peer. Method-3: Improving the search by introducing a ranking algorithm based on the knowledge database. The system demonstrates that the methods introduced here have the improved efficiency compared to the previous methodologies. So, the results…
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.
Taxonomy
TopicsPeer-to-Peer Network Technologies · Caching and Content Delivery · Recommender Systems and Techniques
