Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Locating mobile agents in a wide distributed system: a dynamic approach
MMACTE'05 Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering
| Hi-index | 0.00 |
Abstract: One approach to distributed mutual exclusion algorithms is the use of quorums. Quorum-based algorithms offer the advantage of protocol symmetry, spreading effort and responsibility uniformly across the distributed system. In this paper, we present an O(logn) algorithm to generate coterie templates of near-optimal O(n/sup 0.63/) size. Coterie templates are generic quorum structures that exhibit several desirable properties such as fault tolerance, symmetry and low storage cost. In addition, coteries can be instantiated from the template to reflect desirable network characteristics.