Rolf Stadler
ABSTRACT
The traditional monitoring paradigm of network and systems management, characterized by a central entity polling individual devices, is not adequate for today's large-scale networked systems whose states and configurations are highly dynamic. We outline principles for monitoring such new systems and stress the need for protocols that continuously monitor network-wide aggregates. To keep the overhead at acceptable levels, such protocols must be tunable, e.g., allow controlling the trade-off between accuracy and overhead. We describe and compare two of our efforts in developing protocols for decentralized monitoring of aggregates; one is based on spanning trees, the other on gossiping.
- A Giridhar, PR Kumar: "Towards a Theory of In-Network Computation in Wireless Sensor Networks," IEEE Communication Magazine, April 2006. Google Scholar
Digital Library
- A. Deligiannakis, Y. Kotidis and N. Roussopoulos, "Hierarchical in-Network Data Aggregation with Quality Guarantees,", In Proc. 9th International Conference on Extending Database Technology (EDBT'04), Heraklion -- Crete, Greece, March 14--18, 2004.Google ScholarCross Ref
- A. Gonzalez Prieto and R. Stadler: "Monitoring Flow Aggregates with Controllable Accuracy," 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services (MMNS 2007), San José, California, USA, Oct 31 -- Nov 2, 2007. Google ScholarDigital Library
- A. Gonzalez Prieto, R. Stadler: "A-GAP: An Adaptive Protocol for Continuous Network Monitoring with Accuracy Objectives", IEEE Transactions on Network and Service Management (TNSM), Vol. 4, No. 1, June 2007. Google ScholarDigital Library
- A. Olshevsky, J. N. Tsitsiklis. "Convergence rates in distributed consensus averaging," 45th IEEE Conference on Decision and Control (CDC 06), San Diego, CA, Dec 08.Google Scholar
- C. Olston, B. T. Loo and J. Widom, "Adaptive Precision Setting for Cached Approximate Values", ACM SIGMOD 2001, Santa Barbara, USA, May 2001. Google ScholarDigital Library
- C. Olston, J. Jiang, and J. Widom, "Adaptive filters for continuous queries over distributed data streams", ACM SIGMOD 2003, San Diego, USA, June 2003. Google ScholarDigital Library
- C. Tang, and C. Ward, "GoCast: Gossip-Enhanced Overlay Multicast for Fast and Dependable Group Communication," In Proc. International Conference on Dependable Systems and Networks (DSN'05), Yokohama, Japan, June 28 -- July 1, 2005. Google ScholarDigital Library
- D. Jurca, R. Stadler: "Computing Histograms of Local Variables for Real-Time Monitoring using Aggregation Trees," 11th IFIP/IEEE International Symposium on Integrated Network Management (IM 2009), Long Island, NY, June 1--5, 2009. Google ScholarDigital Library
- D. Kempe, A. Dobra and J. Gehrke, "Gossip-Based Computation of Aggregate Information," In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), Cambridge, MA, USA, October 11--14, 2003. Google ScholarDigital Library
- F. Wuhib, M. Dam, R. Stadler, A. Clemm: "Robust Monitoring of Network-wide Aggregates through Gossiping," 10th IFIP/IEEE International Symposium on Integrated Management (IM 2007), Munich, Germany, May 21--25, 2007.Google Scholar
- F. Wuhib, M. Dam, R. Stadler: "Decentralized Detection of Global Threshold Crossings Using Aggregation Trees," Computer Networks, Vol. 52, No. 9, pp 1745--1761, 2008. Google ScholarDigital Library
- F. Wuhib, M. Dam, R. Stadler: "Gossiping for Threshold Detection," 11th IFIP/IEEE International Symposium on Integrated Network Management (IM 2009), Long Island, NY, June 1--5, 2009. Google ScholarDigital Library
- K. Birman, "The promise, and limitations, of gossip protocols, "ACM SIGOPS Operating Systems Review archive, Volume 41, Issue 5, October 2007. Google ScholarDigital Library
- K. S. Lim and R. Stadler, "Real-time Views of Network Traffic Using Decentralized Management," 9th IFIP/IEEE International Symposium on Integrated Network Management (IM'2005), Nice, France, May 16--19, 2005.Google Scholar
- M. A. Sharaf et al, "Balancing energy efficiency and quality of aggregate data in sensor networks", ACM International Journal on Very Large Data Bases, 13(4):384--403, December 2004. Google ScholarDigital Library
- M. A. Sharaf, J. Beaver, A. Labrinidis and P. K. Chrysanthis, "Balancing energy efficiency and quality of aggregate data in sensor networks," The International Journal on Very Large Data Bases, vol. 13, issue 4, pp. 384--403, December 2004. Google ScholarDigital Library
- M. Dam and R. Stadler: "A generic protocol for network state aggregation," RVK 05, Linköping, Sweden, June 14--16, 2005.Google Scholar
- M. Jelasity, A. Montresor and O. Babaoglu, "Gossip-based aggregation in large dynamic networks," ACM Transactions on Computer Systems, vol. 23, Issue 3, pp. 219--252, August 2005. Google ScholarDigital Library
- M. Mehyar, D. Spanos, J. Pongsajapan, S. Low, R. Murray, "Asynchronous Distributed Averaging on Communication Networks," IEEE/ACM Transactions on Networking, August 2007. Google ScholarDigital Library
- R. van Renesse, K. Birman, and W. Vogels, "Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring," ACM Transactions on Computer Systems, Vol. 21, Issue 2, pp. 164--206, May 2003. Google ScholarDigital Library
- S. Keshav: "Efficient and Decentralized Computation of Approximate Global State," ACM SIGCOMM CCR, Jan 2006. Google ScholarDigital Library
- S. Madden and M. Franklin and J. Hellerstein and W. Hong, "TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks," Fifth Symposium on Operating Systems Design and Implementation (USENIX - OSDI'02), Boston, MA, USA, December 9--12, 2002. Google ScholarDigital Library
Index Terms
- Decentralized real-time monitoring of network-wide aggregates
Recommendations
Robust monitoring of network-wide aggregates through gossiping
We investigate the use of gossip protocols for continuous monitoring of network-wide aggregates under crash failures. Aggregates are computed from local management variables using functions such as SUM, MAX, or AVERAGE. For this type of aggregation, ...
Scalable Real-Time Monitoring for Distributed Applications
In order to assess service quality of a networked application (such as a streaming session), distributed monitoring servers need to continuously collect application-specific performance metrics in real time. Much of the previous work to address this is ...
Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey
MACE '09: Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications EnvironmentsIn large scale decentralized and dynamic networks such as Peer-to-Peer ones, being able to deal with quality of service requires the establishment of a decentralized, autonomous and efficient management strategy. In this context, there is a need to know ...
Comments