Abstract
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. Fault-tolerance 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.
Chapter PDF
References
Wuhib, F., Dam, M., Stadler, R., Clemm, A.: Decentralized computation of threshold crossing alerts. Technical report, KTH Royal Institute of Technology (2005)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: A Tiny AGggretation service for ad-hoc sensor networks. In: Proc. 5th Symposium on Operating Systems Design and Implementation, pp. 131–146 (2002)
Dam, M., Stadler, R.: A generic protocol for network state aggregation. In: Proc. Radiovetenskap och Kommunikation (RVK) (2005)
Dilman, M., Raz, D.: Efficient reactive monitoring. IEEE Journal on Selected Areas in Communications (JSAC) 20(4) (2002)
Breitgand, D., Dolev, D., Raz, D.: Accounting mechanism for membership size-dependent pricing of multicast traffic. In: Networked Group Communication, pp. 276–286 (2003)
van Renesse, R.: The importance of aggregation. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol. 2584, pp. 87–92. Springer, Heidelberg (2003)
Gupta, I., van Renesse, R., Birman, K.: Scalable fault-tolerant aggregation in large process groups. In: Proc. Conf. on Dependable Systems and Networks, pp. 433–442 (2001)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: FOCS 2003: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, p. 482. IEEE Computer Society, Los Alamitos (2003)
Sharaf, M.A., Beaver, J., Labrinidis, A., Chrysanthis, P.K.: Tina: a scheme for temporal coherency-aware in-network aggregation. In: MobiDe 2003: Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access, pp. 69–76. ACM Press, New York (2003)
Olston, C., Jiang, J., Widom, J.: Adaptive filters for continuous queries over distributed data streams. In: SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 563–574. ACM Press, New York (2003)
Roussopoulos, N., Deligiannakis, A., Kotidis, Y.: Hierarchical in-network data aggregation with quality guarantees. In: Proc. 9th International Conference on Extending Database Technology (EDBT) (March 2004)
Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network (2003), (Manuscript)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing 7, 3–16 (1993)
ANSI/IEEE Std 802.1D. IEEE, Los Alamitos (1998)
Perlman, R.: Interconnections, 2nd edn. Addison Wesley Longman, Amsterdam (2000)
Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: Proc. ACM/SIGCOMM (2002)
Lim, K.S., Stadler, R.: SIMPSON — a SIMple Pattern Simulator fOr Networks (2005), http://www.comet.columbia.edu/adm/software.htm
Lim, K.S., Stadler, R.: Weaver — realizing a scalable management paradigm on commodity routers. In: Proc. 8th IFIP/IEEE Int. Symp. on Integrated Network Management (IM 2003) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wuhib, F., Dam, M., Stadler, R., Clemm, A. (2005). Decentralized Computation of Threshold Crossing Alerts. In: Schönwälder, J., Serrat, J. (eds) Ambient Networks. DSOM 2005. Lecture Notes in Computer Science, vol 3775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11568285_19
Download citation
DOI: https://doi.org/10.1007/11568285_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29388-0
Online ISBN: 978-3-540-32244-3
eBook Packages: Computer ScienceComputer Science (R0)