• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Quasi-Kautz Digraphs for Peer-to-Peer Networks
【24h】

Quasi-Kautz Digraphs for Peer-to-Peer Networks

机译：对等网络的拟Kautz有向图

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

摘要

The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several nonconstant and constant degree interconnection networks have been used as topologies of many peer-to-peer networks. The Kautz digraph is one of these topologies that have many desirable properties. Unlike interconnection networks, peer-to-peer networks need a topology with an arbitrary order and degree, but the Kautz digraph does not possess these properties. In this paper, we propose MOORE: the first effective and practical peer-to-peer network based on the quasi-Kautz digraph with O(log_d n) diameter and constant degree under a dynamic environment. The diameter and average routing path length, respectively, are shorter than that of CAN, butterfly, and cube-connected cycle, and are close to that of the de Bruijn and Kautz digraphs. The message cost of node joining and departing operations are at most 2.5dlog_d n and (2.5d+1)log_d n, and only d and 2d nodes need to update their routing tables. MOORE can achieve optimal diameter, high performance, good connectivity, and low congestion, evaluated by formal proofs and simulations.
机译：对等覆盖网络的拓扑属性是决定这些系统性能的关键因素。几种非恒定和恒定度的互连网络已用作许多对等网络的拓扑。 Kautz有向图是具有许多理想属性的这些拓扑之一。与互连网络不同，对等网络需要具有任意顺序和程度的拓扑，但是Kautz有向图不具备这些属性。在本文中，我们提出了MOORE：第一个有效且实用的基于对等网络的，在动态环境下具有O（log_d n）直径和恒定度的拟Kautz有向图。直径和平均路由路径长度分别短于CAN，蝶形和立方体连接循环的直径，并且接近de Bruijn和Kautz图的直径。节点加入和离开操作的消息成本最多为2.5dlog_d n和（2.5d + 1）log_d n，只有d和2d节点需要更新其路由表。通过正式的证明和模拟评估，MOORE可以达到最佳直径，高性能，良好的连通性和低拥塞。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号