• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks
【24h】

Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

机译：解决非结构化对等网络中的拓扑不匹配问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Prior studies show that more than 70 percent of communication paths in a popular unstructured peer-to-peer (P2P) system (i.e., Gnutella) do not exploit the physical network topology, leading to the topology mismatch problem, and thus, lengthen communication between participating peers. While previous efforts in solving overlay topology matching problems do not guarantee the bounds of performance metrics (e.g., the communication delay between any two overlay peers and the broadcasting scope of any participating peer), in this paper, we present a novel topology matching algorithm that has provable performance qualities. In our proposal, each participating node creates and manages a constant number of overlay connections to other peers in a distributed manner. In rigorous performance analysis, we show that 1) the expected overlay communication delay between any two nodes in our P2P network is a constant; 2) in addition, any joining node has the exponential broadcasting scope in expectation; 3) furthermore, a participating node takes a polylogarithmic overhead to exploit the physical network locality and maintain its flooding scope. Together with extensive simulations, we present our proposal that significantly outperforms two recent solutions, i.e., THANCS and mOverlay, in terms of overlay communication latency and/or broadcasting scope.
机译：先前的研究表明，在流行的非结构化对等（P2P）系统（即Gnutella）中，超过70％的通信路径未利用物理网络拓扑，从而导致拓扑不匹配问题，从而延长了两者之间的通信。参与的同行。尽管先前解决覆盖拓扑匹配问题的努力不能保证性能指标的范围（例如，任何两个覆盖对等体之间的通信延迟和任何参与对等体的广播范围），但在本文中，我们还是提出了一种新颖的拓扑匹配算法，该算法可以具有可证明的性能。在我们的建议中，每个参与节点以分布式方式创建和管理与其他对等方的固定数量的覆盖连接。在严格的性能分析中，我们表明：1）P2P网络中任意两个节点之间的预期覆盖通信延迟是恒定的； 2）此外，任何加入节点都具有预期的指数广播范围； 3）此外，参与节点承担了多对数开销，以利用物理网络的本地性并维护其泛洪范围。结合广泛的仿真，我们提出了在覆盖通信延迟和/或广播范围方面明显优于两个最新解决方案的方案，即THANCS和mOverlay。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号