On Distributed Cardinality Estimation: Random Arcs Recycled

Marcin Kardas, Mirosław Kutyłowski, Jakub Lemiesz
{"title":"On Distributed Cardinality Estimation: Random Arcs Recycled","authors":"Marcin Kardas, Mirosław Kutyłowski, Jakub Lemiesz","doi":"10.1137/1.9781611973761.12","DOIUrl":null,"url":null,"abstract":"We introduce and analyze a distributed cardinality estimation algorithm for a network consisted of not synchronized nodes. Our solution can be regarded as a generalization of the classic approximate counting algorithm based on the balls and bins model and is connected to the well studied process of covering the circle with random arcs. Although the algorithm is presented in the context of a radio network, the basic idea is applicable to any system in which many uncoordinated nodes communicate over a shared medium. In the paper we prove the correctness of the algorithm and by the methods of complex analysis we carefully examine the accuracy and precision of the estimator we have proposed. We also show that the construction of the proposed algorithm is a backbone for simple distributed summation.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611973761.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We introduce and analyze a distributed cardinality estimation algorithm for a network consisted of not synchronized nodes. Our solution can be regarded as a generalization of the classic approximate counting algorithm based on the balls and bins model and is connected to the well studied process of covering the circle with random arcs. Although the algorithm is presented in the context of a radio network, the basic idea is applicable to any system in which many uncoordinated nodes communicate over a shared medium. In the paper we prove the correctness of the algorithm and by the methods of complex analysis we carefully examine the accuracy and precision of the estimator we have proposed. We also show that the construction of the proposed algorithm is a backbone for simple distributed summation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于分布式基数估计:随机弧循环
介绍并分析了一种由非同步节点组成的网络的分布式基数估计算法。我们的解可以看作是基于球箱模型的经典近似计数算法的推广,并与研究得很好的用随机弧线覆盖圆的过程有关。虽然该算法是在无线网络的环境中提出的,但其基本思想适用于任何在共享介质上许多不协调节点通信的系统。在本文中,我们证明了算法的正确性,并通过复分析的方法仔细检验了我们所提出的估计量的准确性和精密度。我们还证明了该算法的构造是简单分布式求和的主干。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Protection Number of Recursive Trees Ranked Schröder Trees QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract) Subcritical random hypergraphs, high-order components, and hypertrees Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1