Gossiping for Threshold Detection
2009 (English)In: 2009 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2009) VOLS 1 AND 2, NEW YORK: IEEE , 2009, 259-266 p.Conference paper (Refereed)
We investigate the use of gossip protocols to detect threshold crossings of network-wide aggregates. Aggregates are computed from local device variables using functions such as SUM, AVERAGE, COUNT, MAX and MIN. The process of aggregation and detection is performed using a standard gossiping scheme. A key design element is to let nodes dynamically adjust their neighbor interaction rates according to the distance between the nodes' local estimate of the global aggregate and the threshold itself. We show that this allows considerable savings in communication overhead. In particular, the overhead becomes negligible when the aggregate is sufficiently far above or far below the threshold. We present evaluation results from simulation studies regarding protocol efficiency, quality of threshold detection, scalability, and controllability.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 259-266 p.
Communication overheads, Design elements, Evaluation results, Gossip protocols, Interaction rate, Protocol efficiency, Simulation studies, Threshold detection, Threshold-crossing
Telecommunications Computer Systems Communication Systems
IdentifiersURN: urn:nbn:se:kth:diva-30194DOI: 10.1109/INM.2009.5188818ISI: 000274304300039ScopusID: 2-s2.0-70449407884ISBN: 978-142443487-9OAI: oai:DiVA.org:kth-30194DiVA: diva2:400753
IFIP/IEEE International Symposium on Integrated Network Management (IM 2009) New York, NY, JUN 01-05, 2009
© 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
QC 201202172012-02-172011-02-212012-02-17Bibliographically approved