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
Decentralized computation of threshold crossing alerts
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
KTH, School of Electrical Engineering (EES), Communication Networks.
2005 (English)In: IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, Berlin: Springer-Verlag , 2005, Vol. LNCS 3775, 220-232 p.Conference paper, Published paper (Refereed)
Abstract [en]

Threshold crossing alerts (TCAs) indicate to a management system that a management variable, associated with the state, performance or health of the network, has crossed a certain threshold. The timely detection of TCAs is essential to proactive management. This paper focuses on detecting TCAs for network-level variables, which are computed from device-level variables using aggregation functions, such as SUM, MAX, or AVERAGE. It introduces TCA-GAP, a novel protocol for producing network-wide TCAs in a scalable and robust manner. The protocol maintains a spanning tree and uses local thresholds, which adapt to changes in network state and topology, by allowing nodes to trade unused “threshold space”. Scalability is achieved through computing the thresholds locally and through distributing the aggregation process across all nodes. Faulttolerance is achieved by a mechanism that reconstructs the spanning tree after node addition, removal or failure. Simulation results on an ISP topology show that the protocol successfully concentrates traffic overhead to periods where the aggregate is close to the given threshold.

Place, publisher, year, edition, pages
Berlin: Springer-Verlag , 2005. Vol. LNCS 3775, 220-232 p.
Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 3775
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-26202ISI: 000233789600019Scopus ID: 2-s2.0-33646749501ISBN: 3-540-29388-4 (print)OAI: oai:DiVA.org:kth-26202DiVA: diva2:371514
Conference
16th IFIP/IEEE International Workshop on Distributed Systems - Operations and Management (DSOM) Barcelona, SPAIN, OCT 24-26, 2005
Note
QC 20101122Available from: 2010-11-21 Created: 2010-11-21 Last updated: 2012-01-20Bibliographically 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

Scopus

Authority records BETA

Dam, Mads

Search in DiVA

By author/editor
Wuhib, Fetahi ZebenigusDam, MadsStadler, Rolf
By organisation
Communication NetworksTheoretical Computer Science, TCS
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

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