Robust monitoring of network-wide aggregates through gossiping

IEEE Transactions on Network and Service Management

Volumn 6, Issue 2, 2009, Pages 95-109

  Wuhib, Fetahi ^a   Dam, Mads ^a   Stadler, Rolf ^a   Clem, Alexander ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b CISCO SYSTEMS   (United States)

Author keywords

Gossip protocol, epidemic protocol, aggregation, real time monitoring

Indexed keywords

COMPARATIVE ASSESSMENT; CONTINUOUS MONITORING; CRASH FAILURES; DESIGN GOAL; EPIDEMIC PROTOCOLS; FORMAL PROOFS; GOSSIP PROTOCOLS; LARGE NETWORKS; LOCAL MANAGEMENT; MASS LOSS; NEIGHBORING NODES; NODE FAILURE; PROTOCOL OVERHEAD; REAL TIME MONITORING; REAL TRACE; ROBUST MONITORING; SHORT PERIODS; SIMULATION RESULT; TREE-BASED;

AGGREGATES; CONNECTORS (STRUCTURAL); MOBILE TELECOMMUNICATION SYSTEMS; MONITORING;

NETWORK PROTOCOLS;

EID: 75149131585     PISSN: 19324537     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNSM.2009.090603     Document Type: Article

References (34)

1. S Voulgaris, D Gavidia, and M Van Steen, "Cyclon: Inexpensive membership management for unstructured p2p overlays," J. Network Syst. Manage., vol.13, no.2, p. 197, 2005.
2. M. Jelasity, A. Montresor, and O. Babaoglu, "Gossip-based aggregation in large dynamic networks," ACM Trans. Computer Syst., vol.23, no.3, pp. 219-252, Aug. 2005.
3. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. 44th Annual IEEE Symposium Foundations Computer Science (FOCS), Oct. 2003.
4. M. Dam and R. Stadler, "A generic protocol for network state aggregation," in Proc. Radiovetenskap och Kommunikation (RVK), June 2005.
5. K. S. Lim and R. Stadler, "SIMPSON - A simple pattern simulator for networks," Aug. 2006 [Online]. Available: http://www.s3.kth.se/lcn/ software/simpson.htm
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE/ACM Trans. Networking, vol. 14, no. SI, pp. 2508-2530, June 2006.
7. R. van Renesse, K. Birman, and W. Vogels, "Astrolabe: A robust and scalable technology for distributed system monitoring," ACM Trans. Computer Syst., vol 21, no.2, pp. 164-206, May 2003.
8. D. Kostoulas, D. Psaltoulis, I. Gupta, K. Birman, and A. Demers, "Decentralized schemes for size estimation in large and dynamic groups," in Proc. 4th IEEE International Symposium Network Computing Applications (NCA), July 2005.
9. A. Demers, D. Green, C. Hauser, W. Irish, and J. Larson, "Epidemic algorithms for replicated database maintenance," in Proc. 6th Annual ACM Symposium Principles Distributed Computing, Aug. 1987.
10. University of Twente - Traffic Measurement Data Repository, Aug. 2006 [Online]. Available: http://m2c-a.cs.utwente.nl/repository/
11. A. Deligiannakis, Y. Kotidis, and N. Roussopoulos, "Hierarchical innetwork data aggregation with quality guarantees," in Proc. 9th International Conf. Extending Database Technology (EDBT), Mar. 2004.
12. S. Madden, M. Franklin, J. Hellerstein, and W. Hong, "TAG: A tiny aggregation service for ad-hoc sensor networks," in Proc. 5th Symposium Operating Systems Design Implementation (USENIX - OSDI ), Dec. 2002.
13. M. A. Sharaf, J. Beaver, A. Labrinidis, and P. K. Chrysanthis, "Balancing energy efficiency and quality of aggregate data in sensor networks," International J. Very Large Data Bases, vol.13, no.4, pp. 384-403, Dec. 2004.
14. K. S. Lim and R. Stadler, "Real-time views of network traffic using decentralized management," in Proc. 9th IFIP/IEEE International Symposium Integrated Network Management (IM), May 2005.
15. P. C. Roth, D. C. Arnold, and B. P. Miller, "MRNet: A software-based multicast/reduction network for scalable tools," in Proc ACM/IEEE Conf. Supercomputing (SC), Nov. 2003.
16. F. Wuhib, A. Clemm, M. Dam, and R. Stadler, "Decentralized computation of threshold crossing slerts," in Proc 16th IFIP/IEEE Distributed Systems Operations Manage. (DSOM), Oct. 2005.
17. C. Tang and C. Ward, "GoCast: Gossip-enhanced overlay multicast for fast and dependable group communication," in Proc. International Conf. Dependable Systems Networks (DSN), June-July 2005.
18. A. G. Prieto and R.Stadler "Adaptive distributed monitoring with accuracy objectives," to be published.
19. F. Wuhib, M. Dam, R. Stadler, and A. Clemm, "Robust monitoring of network-wide aggregates through gossiping," in Proc. Integrated Manage. (IM), 2007, pp. 226-235. [Online]. Available: http://www.ee.kth.se/php /index.php?action=publications
20. M. Mehyar, D. Spanos, J. Pongsajapan, S. Low, and R. Murray, "Asynchronous sistributed averaging on communication networks," IEEE/ACM Trans. Networking, Aug. 2007.
21. F. Cristian, R. de Beijer, and S. Mishra, "A performance comparison of asynchronous atomic broadcast protocols," Distributed Syst. Engineering, pp. 177-201, 1994.
22. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.
23. A. Olshevsky and J. N. Tsitsiklis, "Convergence rates in distributed consensus averaging," in Proc. 45th IEEE Conf. Decision Control (CDC), Dec. 2006.
24. J. N. Tsitsiklis, "Problems in decentralized decision making and computation," Ph.D. diss., Dept. of Electrical Enginering and Computer Science, Mass. Institute of Technology, Cambridge, MA, 1984.
25. C. C. Moallemi and B. Van Roy, "Consensus propagation," IEEE Trans. Inform. Theory, vol.52, no.11, pp. 4753-4766, 2006.
26. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, "Randomized rumor spreading," in Proc. 41st Annual Symposium Foundations Computer Science (FOCS), Nov. 2000.
27. D. Kempe and J. Kleinberg, "Protocols and impossibility results for gossip-based communication mechanisms," in Proc. 43rd Annual IEEE Symposium Foundations Computer Science (FOCS), Nov. 2002, p. 471.
28. K. Birman, "The promise, and limitations, of gossip protocols," ACM SIGOPS Operating Syst. Review Archive, vol.41 , no.5, Oct. 2007.
29. F. Wuhib and R. Stadler, "Adaptive real-time monitoring in mobile wireless networks," KTH Technical Report TRITA-EE-2008:005, Jan 2008.
30. J. S. Yedidia,W. T. Freeman, and Y. Weiss, "Understanding belief propagation and its generalizations," Exploring Artificial Intelligence in the New Millennium, Chap. 8, pp. 239-269. Morgan Kaufman Publishers Inc., Jan. 2003.
31. D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in Proc. 25th Annual ACM Symposium Principles Distributed Computing (PODC ), July 2006.
32. D. Kempe and F. McSherry, "A decentralized algorithm for spectral analysis," in Proc. 36th Annual ACM Symposium Theory Computing (STOC), June 2004.
33. B. Lahiri and S. Tirthapura, "Computing frequent elements using gossip," in Proc. 15th International Colloquium Structural Inform. Commun. Complexity (SIROCCO), June 2008.
34. I. Gupta, R. V. Renesse, and K. P. Birman, "Scalable fault-tolerant aggregation in large process groups," in Proc. International Conf. Dependable Syst. Networks (DSN), July 2001.