动态网络中树型计数的精度
The Accuracy of Tree-based Counting in Dynamic Networks
摘要:
基于树的协议在分布式系统中普遍存在。它们是灵活的,它们通常表现良好,并且在静态条件下,它们的分析大多很简单。然而,在客户流失的情况下,节点连接和失败可能会对树覆盖产生复杂的全局影响,这使得分析变得非常微妙。据我们所知,很少有以前的分析结果,基于树的协议下流失的性能估计。我们研究了一个简单的Bellman-Ford协议,该协议在树形覆盖上进行网络规模估计。一个连续时间马尔可夫模型的构建,它允许关键的协议特性进行估计,包括在一个给定的(感知)距离的根节点的预期数量,并为每个这样的节点,预期(感知)的大小的子网络植根于该节点。我们通过仿真验证模型,使用一系列的网络规模,节点度,和流失到协议率,具有令人信服的结果。
英文摘要:
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn, however, node joins and failures can have complex global effects on the tree overlays, making analysis surprisingly subtle. To our knowledge, few prior analytic results for performance estimation of tree based protocols under churn are currently known. We study a simple Bellman-Ford-like protocol which performs network size estimation over a tree-shaped overlay. A continuous time Markov model is constructed which allows key protocol characteristics to be estimated, including the expected number of nodes at a given (perceived) distance to the root and, for each such node, the expected (perceived) size of the subnetwork rooted at that node. We validate the model by simulation, using a range of network sizes, node degrees, and churn-to-protocol rates, with convincing results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。