Query-Trail-Mediated Cooperative Behaviors of Peers in Unstructured P2P File Sharing Networks

• Published in: IEICE Transactions on Information and Systems Vol. E94.D; no. 10; pp. 1966 - 1980
• Main Authors: OHNISHI, Kei, YAMAMOTO, Hiroshi, UCHIDA, Masato, OIE, Yuji
• Format: Journal Article
• Language: English
• Published: Oxford The Institute of Electronics, Information and Communication Engineers 2011; Oxford University Press
• Subjects: Applied sciences; cooperative behaviors; Exact sciences and technology; file replication; P2P file sharing; query-trail; storage load balancing; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Valuation and optimization of characteristics. Simulation; Performance evaluation; File query; Positioning; Peer to peer; Query; storage load balancing; file replication; Resource sharing; P2P file sharing; Degradation; Computer network; Simulation; Replication; Load balancing; Localization; query-trail; cooperative behaviors; Damaging
• ISSN: 0916-8532; 1745-1361
• DOI: 10.1587/transinf.E94.D.1966

We propose two types of autonomic and distributed cooperative behaviors of peers for peer-to-peer (P2P) file-sharing networks. Cooperative behaviors of peers are mediated by query trails, and allows the exploration of better trade-off points between file search and storage load balancing performance. Query trails represent previous successful search paths and indicate which peers contributed to previous file searches and were at the same time exposed to the storage load. The first type of cooperative behavior is to determine the locations of replicas of files through the medium of query trails. Placement of replicas of files on strong query trails contributes to improvement of search performance, but a heavy load is generated due to writing files in storage to peers on the strong query trails. Therefore, we attempt to achieve storage load balancing between peers, while avoiding significant degradation of the search performance by creating replicas of files in peers adjacent to peers on strong query trails. The second type of cooperative behavior is to determine whether peers provide requested files through the medium of query trails. Provision of files by peers holding requested files on strong query trails contributes to better search performance, but such provision of files generates a heavy load for reading files from storage to peers on the strong query trails. Therefore, we attempt to achieve storage load balancing while making only small sacrifices in search performance by having peers on strong query trails refuse to provide files. Simulation results show that the first type of cooperative behavior provides equal or improved ability to explore trade-off points between storage load balancing and search performance in a static and nearly homogeneous P2P environment, without the need for fine tuning parameter values, compared to replication methods that require fine tuning of their parameters values. In addition, the combination of the second type and the first type of cooperative behavior yields better storage load balancing performance with little degradation of search performance. Moreover, even in a dynamic and heterogeneous P2P environment, the two types of cooperative behaviors yield good ability to explore trade-off points between storage load balancing and search performance.