Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Robust Monitoring of Network-wide Aggregates through Gossiping
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-5432-6442
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-6039-8493
2007 (engelsk)Inngår i: IFIP/IEEE International Symposium on Integrated Network Management (IM 2009): VOLS 1 AND 2, New York: IEEE , 2007, s. 226-235Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
New York: IEEE , 2007. s. 226-235
Emneord [en]
Access protocols, Aggregates, Condition monitoring, Counting circuits, Error correction, Fault tolerant systems, Real time systems, Robustness, Surveillance, Traffic control
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-26201DOI: 10.1109/INM.2007.374787ISI: 000250405400024Scopus ID: 2-s2.0-34748835423ISBN: 978-1-4244-0798-9 (tryckt)OAI: oai:DiVA.org:kth-26201DiVA, id: diva2:371513
Konferanse
10th IFIP/IEEE International Symposium on Integrated Network Management Munich, GERMANY, MAY 21-25, 2007
Merknad
Book Group Author(s): IEEETilgjengelig fra: 2010-11-21 Laget: 2010-11-21 Sist oppdatert: 2022-09-13bibliografisk kontrollert
Inngår i avhandling
1. Real-Time Monitoring of Global Variables in Large-Scale Dynamic Systems
Åpne denne publikasjonen i ny fane eller vindu >>Real-Time Monitoring of Global Variables in Large-Scale Dynamic Systems
2007 (engelsk)Licentiatavhandling, med artikler (Annet vitenskapelig)
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.

sted, utgiver, år, opplag, sider
Stockholm: KTH, 2007. s. 107
Serie
Trita-EE, ISSN 1653-5146 ; 2007:065
HSV kategori
Identifikatorer
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
Veileder
Merknad
QC 20101122Tilgjengelig fra: 2008-02-27 Laget: 2008-02-27 Sist oppdatert: 2022-09-13bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Dam, Mads

Søk i DiVA

Av forfatter/redaktør
Wuhib, Fetahi ZebenigusDam, MadsStadler, Rolf
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 80 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf