LISA '07 – Abstract
Pp. 275–289 of the Proceedings
Network Patterns in Cfengine and Scalable Data Aggregation
Mark Burgess and Matt Disney, Oslo University College; Rolf Stadler, KTH Royal Institute of Technology, Stockholm
Network patterns are based on generic algorithms that execute on
tree-based overlays. A set of such patterns has been developed at KTH
to support distributed monitoring in networks with non-trivial
topologies. We consider the use of this approach in logical peer
networks in cfengine as a way of scaling aggregation of data to large
organizations. Use of `deep' network structures can lead to temporal
anomalies. We show how to minimize temporal fragmentation during data
aggregation by using time offsets and what effect these choices might
have on power consumption. We offer proof of concept for this
technology to initiate either multicast or inverse multicast pulses
through sensor networks.
- View the full text of this paper in HTML and PDF.
Listen to the presentation in
Until November 2008, you will need your USENIX membership identification in order to access the full papers.
The Proceedings are published as a collective work, © 2007 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.