Change search
ReferencesLink to record
Permanent link

Direct link
Robust Monitoring of Network-wide Aggregates through Gossiping
KTH, School of Electrical Engineering (EES), Communication Networks. (ACCESS Linnaeus Centre)
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS. (ACCESS Linnaeus Centre)ORCID iD: 0000-0001-5432-6442
KTH, School of Electrical Engineering (EES), Communication Networks. (ACCESS Linnaeus Centre)
Cisco Systems, San Jose, CA USA.
2009 (English)In: IEEE Transactions on Network and Service Management, ISSN 1932-4537, Vol. 6, no 2, 95-109 p.Article in journal (Refereed) Published
Abstract [en]

We investigate the use of gossip protocols for continuousmonitoring of network-wide aggregates under crash failures.Aggregates are computed from local management variablesusing functions such as SUM, MAX, or AVERAGE. For this typeof aggregation, crash failures offer a particular challenge dueto the problem of mass loss, namely, how to correctly accountfor contributions from nodes that have failed. In this paper wegive a partial solution. We present G-GAP, a gossip protocolfor continuous monitoring of aggregates, which is robust againstfailures that are discontiguous in the sense that neighboringnodes do not fail within a short period of each other. We giveformal proofs of correctness and convergence, and we evaluatethe protocol through simulation using real traces. The simulationresults suggest that the design goals for this protocol have beenmet. For instance, the tradeoff between estimation accuracyand protocol overhead can be controlled, and a high estimationaccuracy (below some 5% error in our measurements) is achievedby the protocol, even for large networks and frequent nodefailures. Further, we perform a comparative assessment of GGAPagainst a tree-based aggregation protocol using simulation.Surprisingly, we find that the tree-based aggregation protocolconsistently outperforms the gossip protocol for comparativeoverhead, both in terms of accuracy and robustness.

Place, publisher, year, edition, pages
IEEE Communications Society, 2009. Vol. 6, no 2, 95-109 p.
Keyword [en]
Gossip protocol, epidemic protocol, aggregation, real-time monitoring
National Category
Computer Systems Communication Systems Telecommunications
URN: urn:nbn:se:kth:diva-86105DOI: 10.1109/TNSM.2009.090603ScopusID: 2-s2.0-75149131585OAI: diva2:500406

QC 20120215

Available from: 2012-02-15 Created: 2012-02-13 Last updated: 2013-12-02Bibliographically approved

Open Access in DiVA

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

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Fetahi, WuhibDam, MadsStadler, Rolf
By organisation
Communication NetworksTheoretical Computer Science, TCS
In the same journal
IEEE Transactions on Network and Service Management
Computer SystemsCommunication SystemsTelecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 406 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

Altmetric score

Total: 87 hits
ReferencesLink to record
Permanent link

Direct link