Newscast Computing

作者:

J MarkK WojtekMV Steen

展开

摘要:

Monitoring large computer networks often involves aggregation of various sorts of data that are distributed across network components. Finding extreme values, counting discrete observations or computing an average or a sum of some parameter values are typical examples of such "background" activities that provide input to monitoring systems. Another aspect of network management is fast and reliable information dissemination, like propagation of alarm signals. We present a novel approach to information aggregation and dissemination. It is based on a concept of a highly distributed, anonymous, democratic and non-deterministic form of collab- orative information processing: newscast computing. The main properties of this approach are scalability, robustness, adaptivity, and speed. The underlying protocol is very simple and can be implemented and run on huge networks of small computing devices, such as mobile phones, PDA's, sensors, etc. The usefulness of the newscast approach is illustrated by two algorithms for finding the maximum and the average of values that are distributed along the nodes of a network. The algorithms are formally proven to converge exponentially fast and numerous simulation experiments provide additional insights into their behavior. Finally, we demonstrate their applicability to several network monitoring tasks: finding the size of a network, counting nodes that left or joined the network, system load estimation, and fast propagation of alarms.

展开

被引量:

106

年份:

2003

通过文献互助平台发起求助,成功后即可免费获取论文全文。

相似文献

参考文献

引证文献

引用走势

2008
被引量:15

站内活动

辅助模式

0

引用

文献可以批量引用啦~
欢迎点我试用!

关于我们

百度学术集成海量学术资源,融合人工智能、深度学习、大数据分析等技术,为科研工作者提供全面快捷的学术服务。在这里我们保持学习的态度,不忘初心,砥砺前行。
了解更多>>

友情链接

百度云百度翻译

联系我们

合作与服务

期刊合作 图书馆合作 下载产品手册

©2025 Baidu 百度学术声明 使用百度前必读

引用