Issue No. 01 - January (2006 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.2
Hirotsugu Kakugawa , IEEE Computer Society
<p><b>Abstract</b>—Peer-to-peer (P2P) system is an overlay network of peer computers without centralized servers, and many applications have been developed for such networks such as file sharing systems. Because a set of peers dynamically changes, design and verification of efficient protocols is a challenging task. In this paper, we consider an object searching problem under a resource model such that there are some replicas in a system and the lower bound of the ratio <tmath>\rho=n^\prime /n</tmath> is known in advance, where <tmath>n^\prime </tmath> is a lower bound of the number of peers that hold original or replica for any object type and <tmath>n</tmath> is the total number of peers. In addition, we consider object searching with probabilistic success, i.e., for each object search, object must be found with at least probability <tmath>0 < \sigma < 1</tmath>. To solve such a problem efficiently, we propose a new communication structure, named <it>probabilistic weak quorum systems (PWQS)</it>, which is an extension of coterie. Then, we propose a fault-tolerant protocol for searching for objects in a P2P system. In our method, each peer does not maintain global information such as the set of all peers and a logical topology with global consistency. In our protocol, each peer communicates only a small part of a peer set and, thus, our protocol is adaptive for huge scale P2P network.</p>
Distributed systems, distributed data structures, reliability and robustness, combinatorial algorithms, distributed file systems.
K. Miura, T. Tagawa and H. Kakugawa, "A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 25-37, 2006.