Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Gossiping for Threshold Detection
KTH, School of Electrical Engineering (EES), Communication Networks.
KTH, School of Electrical Engineering (EES), Communication Networks.
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-5432-6442
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, Published paper (Refereed)
Abstract [en]

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.
Keyword [en]
Communication overheads, Design elements, Evaluation results, Gossip protocols, Interaction rate, Protocol efficiency, Simulation studies, Threshold detection, Threshold-crossing
National Category
Telecommunications Computer Systems Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-30194DOI: 10.1109/INM.2009.5188818ISI: 000274304300039Scopus ID: 2-s2.0-70449407884ISBN: 978-142443487-9 (print)OAI: oai:DiVA.org:kth-30194DiVA: diva2:400753
Conference
IFIP/IEEE International Symposium on Integrated Network Management (IM 2009) New York, NY, JUN 01-05, 2009
Note
© 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 20120217Available from: 2012-02-17 Created: 2011-02-21 Last updated: 2012-02-17Bibliographically approved

Open Access in DiVA

fulltext(224 kB)310 downloads
File information
File name FULLTEXT01.pdfFile size 224 kBChecksum SHA-512
c69346cd5b5f75b89810d381699c2f70955e4eb5b895977a039984ad548835fb646966d743f3abd77a56e0d912a3579df09d051b9f8aeaa5d4bc8b7259503514
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Authority records BETA

Dam, Mads

Search in DiVA

By author/editor
Wuhib, FetahiStadler, RolfDam, Mads
By organisation
Communication NetworksTheoretical Computer Science, TCS
TelecommunicationsComputer SystemsCommunication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 310 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 64 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf