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
Robust Monitoring of Network-wide Aggregates through Gossiping
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-5432-6442
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
2007 (English)In: IFIP/IEEE International Symposium on Integrated Network Management (IM 2009): VOLS 1 AND 2, New York: IEEE , 2007, 226-235 p.Conference paper, Published paper (Refereed)
Abstract [en]

We examine the use of gossip protocols for continuous monitoring of network-wide aggregates. Aggregates are computed from local management variables using functions such as AVERAGE, MIN, MAX, or SUM. A particular challenge is to develop a gossip-based aggregation protocol that is robust against node failures. In this paper, we present G-GAP, a gossip protocol for continuous monitoring of aggregates, which is robust against discontiguous failures (i.e., under the constraint that neighboring nodes do not fail within a short period of each other). We formally prove this property, and we evaluate the protocol through simulation using real traces. The simulation results suggest that the design goals for this protocol have been met. For instance, the tradeoff between estimation accuracy and protocol overhead can be controlled, and a high estimation accuracy (below some 5% error in our measurements) is achieved by the protocol, even for large networks and frequent node failures. Further, we perform a comparative assessment of G-GAP against a tree-based aggregation protocol using simulation. Surprisingly, we find that the tree-based aggregation protocol consistently outperforms the gossip protocol for comparative overhead, both in terms of accuracy and robustness.

Place, publisher, year, edition, pages
New York: IEEE , 2007. 226-235 p.
Keyword [en]
Access protocols, Aggregates, Condition monitoring, Counting circuits, Error correction, Fault tolerant systems, Real time systems, Robustness, Surveillance, Traffic control
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-26201DOI: 10.1109/INM.2007.374787ISI: 000250405400024Scopus ID: 2-s2.0-34748835423ISBN: 978-1-4244-0798-9 (print)OAI: oai:DiVA.org:kth-26201DiVA: diva2:371513
Conference
10th IFIP/IEEE International Symposium on Integrated Network Management Munich, GERMANY, MAY 21-25, 2007
Note
Book Group Author(s): IEEEAvailable from: 2010-11-21 Created: 2010-11-21 Last updated: 2011-09-12Bibliographically approved
In thesis
1. Real-Time Monitoring of Global Variables in Large-Scale Dynamic Systems
Open this publication in new window or tab >>Real-Time Monitoring of Global Variables in Large-Scale Dynamic Systems
2007 (English)Licentiate thesis, comprehensive summary (Other scientific)
Abstract [en]

Large-scale dynamic systems, such as the Internet, as well as emerging peer-to-peer networks and computational grids, require a high level of awareness of the system state in real-time for proper and reliable operation. A key challenge is to develop monitoring functions that are efficient, scalable, robust and controllable. The thesis addresses this challenge by focusing on engineering protocols for distributed monitoring of global state variables. The global variables are network-wide aggregates, computed from local device variables using aggregation functions such as SUM, MAX, AVERAGE, etc. Furthermore, it addresses the problem of detecting threshold crossing of such aggregates. The design goals for the protocols are efficiency, quality, scalability, robustness and controllability. The work presented in this thesis has resulted in two novel protocols: a gossip-based protocol for continuous monitoring of aggregates called G-GAP, and a tree-based protocol for detecting thresh old crossings of aggregates called TCA-GAP. The protocols have been evaluated against the design goals through three complementing evaluation methods: theoretical analysis, simulation study and testbed implementation.

Place, publisher, year, edition, pages
Stockholm: KTH, 2007. 107 p.
Series
Trita-EE, ISSN 1653-5146 ; 2007:065
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-4646 (URN)978-91-7178-774-3 (ISBN)
Presentation
2007-12-04, Q22, KTH, Osquldas väg 6, Stockholm, 10:00
Opponent
Supervisors
Note
QC 20101122Available from: 2008-02-27 Created: 2008-02-27 Last updated: 2010-11-22Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Dam, Mads

Search in DiVA

By author/editor
Wuhib, Fetahi ZebenigusDam, MadsStadler, Rolf
By organisation
Communication NetworksACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 46 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