Issue No. 12 - Dec. (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.60
C.-H. Philip Yuen , The Hong Kong University of Science and Technology, Hong Kong
S.-H. Gary Chan , The Hong Kong University of Science and Technology, Hong Kong
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 to use distributed aggregation tree (DAT) rooted at each monitor. However, this approach often leads to high monitoring delay and network stress. In this paper, we study a highly scalable monitoring network for distributed applications. In the network, there are distributed monitors collecting application performance in two steps: first, client applications report their performance to some proxies by means of a client overlay, and then the proxies report the performance to the distributed monitors using another proxy overlay. We first formulate the problem to construct overlays minimizing monitoring delay. The problem is shown to be NP-hard. Then, we present a simple, efficient, and scalable monitoring algorithm called SMon, which continuously reduces network diameter in real time in a distributed manner. Through simulations and actual experimental measurements with implementation, we show that SMon achieves low monitoring delay, network stress, and protocol overhead for distributed applications.
Monitoring, Distributed programming, Peer to peer computing, Real time systems, Scalability, Peer to peer computing, Real-time systems, proxies, Distributed protocol, real-time network monitoring, peer-to-peer network
C.-H. Philip Yuen, S.-H. Gary Chan, "Scalable Real-Time Monitoring for Distributed Applications", IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 2330-2337, Dec. 2012, doi:10.1109/TPDS.2012.60