大学サイト   学部サイト   学科サイト   EnglishPages
 
旧尾家・塚本研究室です.尾家祐二 現・九州工業大学学長の情報は こちら.
   
研究業績


Query-trail-mediated Cooperative Behaviors of Peers in Unstructured P2P File Sharing Networks
著者
  Kei Ohnishi, Hiroshi Yamamoto, Masato Uchida, and Yuji Oie
 
雑誌名/会議名
  IEICE Transactions on Information and System, Vol.E94-D, No.10, pp.1966-1980 2011 年 10 月
 
アブストラクト
  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.
 
キーワード
  ptop
 
記述言語
  English
 
 

web_admin [ at ] infonet.cse.kyutech.ac.jp /  Copyright (c) 2016 Oie & Tsukamoto Laboratory, All Right Reserved.