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

A Near-Optimal Algorithm Attacking the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

机译：一种非结构化点对点网络中拓扑不匹配问题的近似最优算法

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

摘要

In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology mismatch problem in the literature either have no performance guarantees or are far from the optimum. In this paper, we propose a novel topology matching algorithm based on the Metropolis-Hastings method. Our proposal is guided by our insight analytical model and is close to the optimal design. Specifically, we show that our proposal constructs an unstructured P2P network in which a broadcast message, originated by any node v, reaches any other node u by taking approximately the only physical end-to-end delay between v and u. In addition, our design guarantees the exponential broadcast scope. We verify our solution through extensive simulations and show that our proposal considerably outperforms state-of-the-art solutions.
机译：在非结构化对等（P2P）网络（例如Gnutella）中，参与的对等方随机选择其邻居，以使最终的P2P网络与其基础物理网络不匹配，从而导致对等方之间的冗长通信和在其中生成的冗余网络流量基础网络。文献中对拓扑不匹配问题的先前解决方案要么没有性能保证，要么远非最优。本文提出了一种基于Metropolis-Hastings方法的拓扑匹配算法。我们的建议以我们的洞察力分析模型为指导，并且接近最佳设计。具体而言，我们表明，我们的建议构建了一个非结构化的P2P网络，其中，由任何节点v发出的广播消息都将大约采用v和u之间唯一的物理端到端延迟来到达任何其他节点u。另外，我们的设计保证了指数级的广播范围。我们通过广泛的仿真验证了我们的解决方案，并表明我们的提案大大优于最新的解决方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号