How to assign votes in a distributed system
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion
Theoretical Computer Science
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Information and Computation
Quorum-Based Algorithms for Group Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Evaluating GUESS and Non-Forwarding Peer-to-Peer Search
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An adaptive randomized search protocol in peer-to-peer systems
Proceedings of the 2007 ACM symposium on Applied computing
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Accessing probabilistic quorums in dynamic networks
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Bio-inspired replica density control in dynamic networks
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
Core persistence in peer-to-peer systems: relating size to lifetime
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Info-based approach in distributed mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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 \rho=n^\prime /n is known in advance, where n^\primeis a lower bound of the number of peers that hold original or replica for any object type and n 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 0