Skip to main content

In-Network Monitoring

  • Chapter
  • First Online:
Book cover Algorithms for Next Generation Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

Monitoring, i.e., the process of acquiring state information from a network or networked system, is fundamental to system operation. In traditional network and systems management, monitoring is performed on a per-device basis, whereby a centralized management entity polls the devices in its domain for information, which is then analyzed and acted upon. In this chapter, we describe several monitoring algorithms that utilize a new monitoring paradigm called In-network Monitoring. This paradigm is designed to address the above shortcomings, and we demonstrate how it can be applied to managing highly dynamic networked systems. The main idea of In-network Monitoring is to introduce a small management entity inside each network device, which, in addition to monitoring local parameters, can also perform limited management functions and communicate with peering entities in its proximity. The collection of these entities creates a monitoring layer inside the network, which can perform monitoring and control tasks without involving the centralized entity. We demonstrate how In-network monitoring can help building better and more efficient systems. We start with a general description of network monitoring techniques, and then describe two specific cases in which this paradigm generates provably efficient solutions. The first one is in the area of traffic engineering, where there is a need to monitor the aggregated delay of packets along a given network path. The second case deals with the problem of monitoring general aggregated values over the network, with emphasis on computing the values in a distributed way inside the monitoring layer. All together, we believe that this new paradigm presents a promising direction to address the challenges of cost-effective management of future networked systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Sometimes called the Bandwidth Broker.

References

  1. WARD Partners. The EU 7th framework project 4WARD. http://www.4ward-project.eu/.

  2. W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In Proceedings of the 32nd Annual Symposium on Theory of Computing, pages 171–180, 2000.

    Google Scholar 

  3. C. Aurrecoechea, A. T. Campbell, and L. Hauw. A survey of QoS architectures. Multimedia Systems, 6(3):138–151, 1998.

    Article  Google Scholar 

  4. K. Birman. The promise, and limitations, of gossip protocols. ACM SIGOPS Operating Systems Review, 41(5):8–13, October 2007.

    Article  Google Scholar 

  5. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services, RFC 2475, 1998.

    Google Scholar 

  6. B. Bollobas. Random Graphs. Academic Press, Inc., Orlando, Florida, 1985.

    MATH  Google Scholar 

  7. D. Breitgand, D. Dolev, and D. Raz. Accounting mechanism for membership size-dependent pricing of multicast traffic. In NGC ’03: Networked Group Communication, pages 276–286, 2003.

    Google Scholar 

  8. T. Chen-Khong and J. Ko. Monitoring QoS distribution in multimedia networks. International journal of network management, 10:75–90, 2000.

    Article  Google Scholar 

  9. M. Dam and R. Stadler. A generic protocol for network state aggregation. In RVK 05, Linkping, Sweden, June 14–16, 2005.

    Google Scholar 

  10. A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. Hierarchical in-network data aggregation with quality guarantees. In In Proc. 9th International Conference on Extending Database Technology (EDBT04), Heraklion Crete, Greece, March 14–18, 2004.

    Google Scholar 

  11. M. Dilman and D. Raz. Efficient reactive monitoring. IEEE Journal on Selected Areas in Communications (JSAC), 20(4):668, 2002.

    Article  Google Scholar 

  12. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3–16, 1993.

    Article  Google Scholar 

  13. C. Elster, D. Raz, and R. Wolff. Autonomous end to end qos monitoring. In Workshop on End-to-End Monitoring Techniques and Services, 2005., pages 1–16, May 2005.

    Google Scholar 

  14. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251–262, 1999.

    Google Scholar 

  15. L. Huang, M. Garofalakis, J. Hellerstein, A. Joseph, and N. Taft. Toward sophisticated detection with distributed triggers. In MineNet ’06: Proceedings of the 2006 SIGCOMM workshop on Mining network data, pages 311–316. ACM Press, 2006.

    Google Scholar 

  16. M. Jelasity, A. Montresor, and O. Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems, 23(3):219–252, August 2005.

    Article  Google Scholar 

  17. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS03), Cambridge, MA, USA, October 11–14, 2003.

    Google Scholar 

  18. R. Keralapura, G. Cormode, and J. Ramamirtham. Communication-efficient distributed monitoring of thresholded counts. In SIGMOD ’06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pages 289–300. ACM Press, 2006.

    Google Scholar 

  19. A.A. Lazar. Programming telecommunication networks. Network, IEEE, 11(5):8–18, Sep/Oct 1997.

    Article  Google Scholar 

  20. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. TAG: a tiny aggregation service for ad-hoc sensor networks. In Fifth Symposium on Operating Systems Design and Implementation (USENIX - OSDI ’02), Boston, MA, USA, December 9–12, 2002.

    Google Scholar 

  21. J. Martin-Flatin, S. Znaty, and J. Hubaux. A survey of distributed enterprise network andsystems management paradigms. J. Netw. Syst. Manage., 7(1):9–26, 1999.

    Article  MATH  Google Scholar 

  22. C. Olston, J. Jiang, and J. Widom. Adaptive filters for continuous queries over distributed data streams. In SIGMOD ’03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 563–574, New York, NY, USA, 2003. ACM.

    Chapter  Google Scholar 

  23. C. Olston, B. T. Loo, and J. Widom. Adaptive precision setting for cached approximate values. SIGMOD Rec., 30(2):355–366, 2001.

    Article  Google Scholar 

  24. G. Pavlou. On the evolution of management approaches, frameworks and protocols: A historical perspective. J. Netw. Syst. Manage., 15(4):425–445, 2007.

    Article  Google Scholar 

  25. A. Gonzalez Prieto and R. Stadler. Monitoring flow aggregates with controllable accuracy. In 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 Scholar 

  26. A.G. Prieto and R. Stadler. A-gap: An adaptive protocol for continuous network monitoring with accuracy objectives. Network and Service Management, IEEE Transactions on, 4(1): 2–12, June 2007.

    Article  Google Scholar 

  27. D. Raz and Y. Shavitt. Active networks for efficient distributed network management. Communications Magazine, IEEE, 38(3):138–143, Mar 2000.

    Article  Google Scholar 

  28. K. Salamatian and S. Fdida. Measurement based modeling of quality of service in the internet: A methodological approach. In IWDC ’01: Proceedings of the Thyrrhenian International Workshop on Digital Communications, pages 158–174, London, UK, 2001. Springer-Verlag.

    Google Scholar 

  29. H. Schulzrinne, A. Rao, and R. Lanphier. Real time streaming protocol (RTSP), RFC 2326, 1998.

    Google Scholar 

  30. M. A. Sharaf, J. Beaver, A. Labrinidis, and P. K. Chrysanthis. Balancing energy efficiency and quality of aggregate data in sensor networks. ACM International Journal on Very Large Data Bases, 13(4):384–403, 2004.

    Article  Google Scholar 

  31. Izchak Sharfman, Assaf Schuster, and Daniel Keren. A geometric approach to monitoring threshold functions over distributed data streams. In SIGMOD ’06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pages 301–312. ACM Press, 2006.

    Google Scholar 

  32. N. Spring, R. Mahajan, and D. Wetherall. Rocketfuel maps and data. http://www.cs.washington.edu/research/networking/rocketfuel/.

  33. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with rocketfuel. In Proceedings of ACM/SIGCOMM ’02, August 2002.

    Google Scholar 

  34. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs structural. In ACM SIGCOMM, August, 2002.

    Google Scholar 

  35. David L. Tennenhouse and David J. Wetherall. Towards an active network architecture. SIGCOMM Comput. Commun. Rev., 26(2):5–17, 1996.

    Article  Google Scholar 

  36. B. M. Waxman. Routing of multipoint connections. IEEE Journal of Selected Areas in Communications, 6(9):1617–1622, December 1988.

    Article  Google Scholar 

  37. F. Wuhib, M. Dam, R. Stadler, and A. Clemm. Robust monitoring of network-wide aggregates through gossiping. In IEEE Transactions on Network and Service Management (TNSM), 6(2), June 2009.

    Google Scholar 

  38. F. Wuhib, M. Dam, and R. Stadler. Decentralized detection of global threshold crossings using aggregation trees. Computer Networks, 52(9):1745–1761, February 2008.

    Article  MATH  Google Scholar 

  39. X. Xiao and L. M. Ni. Internet QoS: A big picture. IEEE Network, 13(2):8–18, March 1999.

    Article  Google Scholar 

Download references

Acknowledgements

This work has been conducted as part of the EU FP7 Project 4WARD on Future Internet design [1].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Danny Raz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Raz, D., Stadler, R., Elster, C., Dam, M. (2010). In-Network Monitoring. In: Cormode, G., Thottan, M. (eds) Algorithms for Next Generation Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-765-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-765-3_13

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-764-6

  • Online ISBN: 978-1-84882-765-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics