Decentralized computation of threshold crossing alerts
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 (Refereed)
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.
, LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 3775
IdentifiersURN: urn:nbn:se:kth:diva-26202ISI: 000233789600019ScopusID: 2-s2.0-33646749501ISBN: 3-540-29388-4OAI: oai:DiVA.org:kth-26202DiVA: diva2:371514
16th IFIP/IEEE International Workshop on Distributed Systems - Operations and Management (DSOM) Barcelona, SPAIN, OCT 24-26, 2005
QC 201011222010-11-212010-11-212012-01-20Bibliographically approved