The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
Toronto, Canada
June 25, 2007 to June 27, 2007
ISBN: 0-7695-2837-3
pp: 55
Ramses Morales , University of Illinois at Urbana-Champaign
Indranil Gupta , University of Illinois at Urbana-Champaign
This paper addresses the problem of selection and discovery of a consistent availability monitoring overlay for computer hosts in a large-scale distributed application, where hosts may be selfish or colluding. We motivate six significant goals for the problem - consistency, verifiability, and randomness, in selecting the availability monitors of nodes, as well as discoverability, load-balancing, and scalability in finding these monitors. We then present a new system, called AVMON, that is the first to satisfy these six requirements. The core algorithmic contribution of this paper is a protocol for discovering the availability monitoring overlay in a scalable and efficient manner, given any arbitrary monitor selection scheme that is consistent and verifiable. We mathematically analyze the performance of AVMON?s discovery protocols, and derive an optimal variant that minimizes memory, bandwidth, computation, and discovery time of monitors. Our experimental evaluations of AVMON use three types of availability traces - synthetic, from PlanetLab, and from a peer-to-peer system (Overnet) - and demonstrate that AVMON works well in a variety of distributed systems.
Churn, Availability, Monitoring, Overlay, Consistency, Scalability, Optimality.
Ramses Morales, Indranil Gupta, "AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 55, 2007, doi:10.1109/ICDCS.2007.87
103 ms
(Ver 3.3 (11022016))