arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.10092cs.NIcs.DC
收藏

基于评估结果选择中继节点以提升P2P广播效率

Selecting Relay Nodes Based on Evaluation Results to Enhance P2P Broadcasting Efficiency

Chunlin Huang

AI总结:

针对现有基于DHT的P2P广播算法无法评估邻居质量、洪泛算法资源消耗高的问题,提出基于邻居评估贡献选择中继节点的机制,可显著优化广播延迟与覆盖率。

摘要:

分布式系统中节点故障的存在是不可避免的,因此许多P2P广播网络采用鲁棒性极强的基于洪泛(Flooding)的广播算法。高冗余度不可避免地导致较高的网络资源消耗,还可能制约网络的数据传输速率。为解决网络资源消耗过高的问题,已有诸多研究探索了结构化P2P覆盖网络中的广播机制。然而,现有基于DHT的算法无法评估邻居节点的质量,而这一点对广播效率至关重要。本文引入邻居评估(Neighbor Evaluation)机制,根据节点的评估贡献选择中继节点。实验结果表明,邻居评估机制对广播延迟和覆盖率均有显著效果。

英文摘要:

The existence of node failures is inevitable in distributed systems, thus many P2P broadcasting networks adopt highly robust Flooding-based broadcast algorithms. High redundancy inevitably leads to high network resource consumption, and it may constrain the data transmission rate of the network. To address excessive network resource consumption, many studies have explored broadcasting mechanisms in structured P2P overlay networks. However, existing DHT-based algorithms cannot assess the quality of neighbors, which is crucial for broadcast efficiency. In this paper, we introduce the Neighbor Evaluation mechanism to select relay nodes based on their evaluated contributions. According to experimental results, the Neighbor Evaluation mechanism has a significant effect on both broadcast latency and coverage rate.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑