多节点通信网络中基于流言的搜索
Gossip-based Search in Multipeer Communication Networks
摘要：
研究了一种基于流言的多节点通信网络数据对象搜索算法。网络中的所有节点都能够相互通信。存在发起者节点，该发起者节点通过随机地向其邻居中的一个或多个查询期望的对象来开始一轮搜索。被查询的节点也可以被激活并查找对象。我们研究了几个行为模式的节点，他们愿意合作的搜索。我们推导出数学模型的搜索过程的基础上的球和箱子模型，以及已知的近似的谣言传播问题。所有的模型都进行了仿真验证。我们还评估了算法的性能，并检查搜索参数的影响。
英文摘要：
We study a gossip-based algorithm for searching data objects in a multipeer communication network. All of the nodes in the network are able to communicate with each other. There exists an initiator node that starts a round of searches by randomly querying one or more of its neighbors for a desired object. The queried nodes can also be activated and look for the object. We examine several behavioural patterns of nodes with respect to their willingness to cooperate in the search. We derive mathematical models for the search process based on the balls and bins model, as well as known approximations for the rumour-spreading problem. All models are validated with simulations. We also evaluate the performance of the algorithm and examine the impact of search parameters.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
