Continuous Gossip-Based Aggregation through Dynamic Information Aging
Continuous Gossip-Based Aggregation through Dynamic Information Aging
复制标题
通过动态信息老化进行连续的基于八卦的聚合
DOI：
10.1109/icccn.2013.6614118
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Kalman Graffi
中科院分区：
文献类型：
--
作者：
Vitaliy Rapp;Kalman Graffi
对等网络中基于流言的聚合的现有解决方案使用历元来从局部值的初始静态集合计算全局估计。一旦估计在系统范围内收敛，就以新的初始值开始新的时期。长时期导致基于旧测量的精确估计，而短时期导致不精确的聚合估计。相反，这种方法，我们在本文中提出了一个连续的，无时代的方法，认为新鲜的本地值在每一轮的八卦为基础的聚合。通过使用动态信息老化的方法，不准确的值和来自左对等体的值从聚合存储器中消失。评估表明，所提出的方法在对等系统中的连续信息聚合监测系统的性能准确，适应变化，是轻量级的操作。
Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system- wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate.