提前适应趋势:利用被动传播实现信息传播的自我稳定

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Distributed Computing Pub Date : 2024-02-22 DOI:10.1007/s00446-024-00462-8
Amos Korman, Robin Vacus
{"title":"提前适应趋势:利用被动传播实现信息传播的自我稳定","authors":"Amos Korman, Robin Vacus","doi":"10.1007/s00446-024-00462-8","DOIUrl":null,"url":null,"abstract":"<p>How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several works focused on identifying the minimal communication resources necessary to spread information under faulty conditions. Here we study the self-stabilizing <i>bit-dissemination</i> problem, introduced by Boczkowski, Korman, and Natale in [SODA 2017]. The problem considers a fully-connected network of <i>n</i> <i>agents</i>, with a binary world of <i>opinions</i>, one of which is called <i>correct</i>. At any given time, each agent holds an opinion bit as its public output. The population contains a <i>source</i> agent which knows which opinion is correct. This agent adopts the correct opinion and remains with it throughout the execution. We consider the basic <span>\\(\\mathcal {PULL}\\)</span> model of communication, in which each agent observes relatively few randomly chosen agents in each round. The goal of the non-source agents is to quickly converge on the correct opinion, despite having an arbitrary initial configuration, i.e., in a self-stabilizing manner. Once the population converges on the correct opinion, it should remain with it forever. Motivated by biological scenarios in which animals observe and react to the behavior of others, we focus on the extremely constrained model of <i>passive communication</i>, which assumes that when observing another agent the only information that can be extracted is the opinion bit of that agent. We prove that this problem can be solved in a poly-logarithmic in <i>n</i> number of rounds with high probability, while sampling a logarithmic number of agents at each round. Previous works solved this problem faster and using fewer samples, but they did that by decoupling the messages sent by agents from their output opinion, and hence do not fit the framework of passive communication. Moreover, these works use complex recursive algorithms with refined clocks that are unlikely to be used by biological entities. In contrast, our proposed algorithm has a natural appeal as it is based on letting agents estimate the current tendency direction of the dynamics, and then adapt to the emerging trend.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Early adapting to trends: self-stabilizing information spread using passive communication\",\"authors\":\"Amos Korman, Robin Vacus\",\"doi\":\"10.1007/s00446-024-00462-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several works focused on identifying the minimal communication resources necessary to spread information under faulty conditions. Here we study the self-stabilizing <i>bit-dissemination</i> problem, introduced by Boczkowski, Korman, and Natale in [SODA 2017]. The problem considers a fully-connected network of <i>n</i> <i>agents</i>, with a binary world of <i>opinions</i>, one of which is called <i>correct</i>. At any given time, each agent holds an opinion bit as its public output. The population contains a <i>source</i> agent which knows which opinion is correct. This agent adopts the correct opinion and remains with it throughout the execution. We consider the basic <span>\\\\(\\\\mathcal {PULL}\\\\)</span> model of communication, in which each agent observes relatively few randomly chosen agents in each round. The goal of the non-source agents is to quickly converge on the correct opinion, despite having an arbitrary initial configuration, i.e., in a self-stabilizing manner. Once the population converges on the correct opinion, it should remain with it forever. Motivated by biological scenarios in which animals observe and react to the behavior of others, we focus on the extremely constrained model of <i>passive communication</i>, which assumes that when observing another agent the only information that can be extracted is the opinion bit of that agent. We prove that this problem can be solved in a poly-logarithmic in <i>n</i> number of rounds with high probability, while sampling a logarithmic number of agents at each round. Previous works solved this problem faster and using fewer samples, but they did that by decoupling the messages sent by agents from their output opinion, and hence do not fit the framework of passive communication. Moreover, these works use complex recursive algorithms with refined clocks that are unlikely to be used by biological entities. In contrast, our proposed algorithm has a natural appeal as it is based on letting agents estimate the current tendency direction of the dynamics, and then adapt to the emerging trend.</p>\",\"PeriodicalId\":50569,\"journal\":{\"name\":\"Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Distributed Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00446-024-00462-8\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00446-024-00462-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

如何在系统中高效可靠地传播信息是分布式计算中最基本的问题之一。最近,受生物场景的启发,有几项研究集中于确定在故障条件下传播信息所需的最小通信资源。在此,我们研究 Boczkowski、Korman 和 Natale 在 [SODA 2017] 中提出的自稳定比特传播问题。该问题考虑了一个由 n 个代理组成的全连接网络,该网络具有二元意见世界,其中一种意见被称为正确意见。在任何给定时间,每个代理都持有一个意见位作为其公共输出。群体中包含一个源代理,它知道哪种观点是正确的。该代理采用正确的观点,并在整个执行过程中保持不变。我们考虑基本的通信模型,即每个代理在每一轮中观察相对较少的随机选择的代理。非源代理的目标是,尽管有一个任意的初始配置,也就是以自稳定的方式,快速收敛到正确的意见上。一旦群体趋同于正确的观点,就应该永远保持下去。受动物观察并对他人行为做出反应的生物场景的启发,我们重点研究了极其受限的被动交流模型,该模型假定当观察另一个代理时,唯一能提取的信息就是该代理的意见位。我们证明,这个问题可以在 n 个回合内以高概率的多对数方式解决,同时在每个回合中对数数量的代理进行采样。以前的研究能以更快的速度和更少的样本解决这个问题,但它们是通过将代理发送的信息与其输出意见解耦来实现的,因此不符合被动通信的框架。此外,这些研究还使用了复杂的递归算法和精制时钟,而生物实体不太可能使用这些算法。相比之下,我们提出的算法则具有天然的吸引力,因为它是基于让代理估计当前的动态趋势方向,然后适应新出现的趋势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Early adapting to trends: self-stabilizing information spread using passive communication

How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several works focused on identifying the minimal communication resources necessary to spread information under faulty conditions. Here we study the self-stabilizing bit-dissemination problem, introduced by Boczkowski, Korman, and Natale in [SODA 2017]. The problem considers a fully-connected network of n agents, with a binary world of opinions, one of which is called correct. At any given time, each agent holds an opinion bit as its public output. The population contains a source agent which knows which opinion is correct. This agent adopts the correct opinion and remains with it throughout the execution. We consider the basic \(\mathcal {PULL}\) model of communication, in which each agent observes relatively few randomly chosen agents in each round. The goal of the non-source agents is to quickly converge on the correct opinion, despite having an arbitrary initial configuration, i.e., in a self-stabilizing manner. Once the population converges on the correct opinion, it should remain with it forever. Motivated by biological scenarios in which animals observe and react to the behavior of others, we focus on the extremely constrained model of passive communication, which assumes that when observing another agent the only information that can be extracted is the opinion bit of that agent. We prove that this problem can be solved in a poly-logarithmic in n number of rounds with high probability, while sampling a logarithmic number of agents at each round. Previous works solved this problem faster and using fewer samples, but they did that by decoupling the messages sent by agents from their output opinion, and hence do not fit the framework of passive communication. Moreover, these works use complex recursive algorithms with refined clocks that are unlikely to be used by biological entities. In contrast, our proposed algorithm has a natural appeal as it is based on letting agents estimate the current tendency direction of the dynamics, and then adapt to the emerging trend.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Distributed Computing
Distributed Computing 工程技术-计算机:理论方法
CiteScore
3.20
自引率
0.00%
发文量
24
审稿时长
>12 weeks
期刊介绍: The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multi-core architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. By virtue of submitting a manuscript to the journal, the authors attest that it has not been published or submitted simultaneously for publication elsewhere. However, papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.
期刊最新文献
A wait-free queue with polylogarithmic step complexity Deterministic near-optimal distributed listing of cliques On implementing SWMR registers from SWSR registers in systems with Byzantine failures Asymmetric distributed trust Iterative approximate Byzantine consensus in arbitrary directed graphs
×
引用
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