The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2012 vol.23)
pp: 2330-2337
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
ABSTRACT
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.
INDEX TERMS
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
CITATION
C.-H. Philip Yuen, S.-H. Gary Chan, "Scalable Real-Time Monitoring for Distributed Applications", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 12, pp. 2330-2337, Dec. 2012, doi:10.1109/TPDS.2012.60
REFERENCES
[1] B. Yu, J. Li, and Y. Li, "Distributed Data Aggregation Scheduling in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2009.
[2] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "TAG: A Tiny AGgregation Service for Ad-Hoc Sensor Networks," ACM SIGOPS Operating Systems Rev., vol. 36, no. SI, pp. 131-146, 2002.
[3] R.V. Renesse, K.P. Birman, and W. Vogels, "Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining," ACM Trans. Computer Systems, vol. 21, no. 2, pp. 164-206, 2003.
[4] P. Yalagandula and M. Dahlin, "A Scalable Distributed Information Management System," Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 379-390, 2004.
[5] I.A. Dahlia, I. Abraham, D. Malkhi, and O. Dobzinski, "LAND: Locality Aware Networks for Distributed Hash Tables," Technical Report 2003-75, Leibnitz Center of the School of Computer Science and Eng., the Hebrew Univ. of Jerusalem, 2003.
[6] W.-P.K. Yiu, X. Jin, and S.-H.G. Chan, "VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming," IEEE J. Selected Areas in Comm., special issue on advances in peer-to-peer streaming systems, vol. 25, no. 9, pp. 1717-1731, Dec. 2007.
[7] K.H. Vik, C. Griwodz, and P. Halvorsen, "Constructing Low-Latency Overlay Networks: Tree Vs. Mesh Algorithms," Proc. IEEE 33rd Conf. Local Computer Networks (LCN '08), pp. 36-43, 2008.
[8] E. Brosh, A. Levin, and Y. Shavitt, "Approximation and Heuristic Algorithms for Minimum-Delay Application-Layer Multicast Trees," IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 473-484, Apr. 2007.
[9] S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, "OMNI: An Efficient Overlay Multicast Infrastructure for Real-Time Applications," Computer Networks, vol. 50, no. 6, pp. 826-841, 2006.
[10] T.M. Baduge, A. Hiromori, H. Yamaguchi, and T. Higashino, "A Distributed Algorithm for Constructing Minimum Delay Spanning Trees under Bandwidth Constraints on Overlay Networks," Systems and Computers in Japan, vol. 37, no. 14, pp. 15-24, 2006.
[11] S.-H. G. Chan and F. Tobagi, "Distributed Servers Architecture for Networked Video Services," IEEE/ACM Trans. Networking, vol. 9, no. 2, pp. 125-136, Apr. 2001.
[12] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "Splitstream: High-Bandwidth Multicast in Cooperative Environments," SIGOPS Operating Systems Rev., vol. 37, pp. 298-313, Oct. 2003.
[13] Y. Chen, D. Bindel, H.H. Song, and R.H. Katz, "Algebra-Based Scalable Overlay Network Monitoring: Algorithms, Evaluation, and Applications," IEEE/ACM Trans. Networking, vol. 15, no. 5, pp. 1084-1097, Oct. 2007.
[14] M. Coates, Y. Pointurier, and M. Rabbat, "Compressed Network Monitoring for IP and All-Optical Networks," Proc. Seventh ACM SIGCOMM Conf. Internet Measurement (IMC '07), pp. 241-252, 2007.
[15] A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: Universal Topology Generation from A User's Perspective," Proc. MASCOTS '01, Jan. 2001.
[16] L. Kleinrock, Queueing Systems: Theory, vol. 1. John Wiley & Sons, 1976.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool