loading...
Performance Analysis of the Superpeer-based Two-layer P2P Overlay Network with the CBF Strategy
Toronto, Canada June 22-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2007.6327th International Conference on Dist ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Kenichi Watanabe, Tokyo Denki University, Japan
Naohiro Hayashibara, Tokyo Denki University, Japan
Makoto Takizawa, Tokyo Denki University, Japan
Peer-to-peer (P2P) systems are widely used in various types of applications. In this paper, we evaluate the superpeer-based two-layer (SBTL) P2P overlay network with the charge-based flooding (CBF) algorithm to detect target peers which have target files, proposed as our previous work. The SBTL P2P overlay network is composed of two layers, normal peer and superpeer layers which include normal peers and superpeers, respectively. Multiple normal peers with some common properties, e.g. peers which have replicas of a file, are interconnected with a superpeer. A collection of a superpeer and normal peers is referred to as a cluster. In a cluster, a normal peer tries to find a target peer which has a target file by itself without help of its superpeer. If no target peer is detected in the cluster, the normal peer asks the super-peer to find the target peer. Then, the superpeer forwards the request message to other superpeers by using a type of flooding algorithm named the CBF algorithm at the super-peer layer. We evaluate the SBTL P2P model in terms of the number of messages exchanged among peers and communication load compared with other models.
Citation:
Kenichi Watanabe, Naohiro Hayashibara, Makoto Takizawa, "Performance Analysis of the Superpeer-based Two-layer P2P Overlay Network with the CBF Strategy," icdcsw, pp.32, 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.