• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'04) v.2; 20040621-20040624; Las Vegas,NV; US >A Novel Connection Algorithm for P2P Network
【24h】

A Novel Connection Algorithm for P2P Network

机译：一种新的P2P网络连接算法

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

摘要

Connectedness of a peer-to-peer network is always a critical factor determining the capability of a search algorithm. In a companion paper, Sum et al have studied the connectedness property of a Gnutella like network and anticipated that Gnutella might not be a connected network. In view of the important of a connected network in file search, a novel and yet simple peer connection algorithm is proposed in this paper. The essential idea of this algorithm is to allow a new peer node to XTRY two peers instead of one. Then new links are made to them and their neighborhoods. By using Molloy-Reed criteria and a virus outbreak simulation, it is shown that the network being formed by using this new connection algorithm is always a connected network.
机译：对等网络的连接性始终是确定搜索算法功能的关键因素。在陪伴论文中，Sum等人研究了类似Gnutella的网络的连接性，并预计Gnutella可能不是连接的网络。鉴于连接网络在文件搜索中的重要性，提出了一种新颖而又简单的对等连接算法。该算法的基本思想是允许一个新的对等节点XTRY替代两个对等节点。然后将新链接链接到他们及其附近。通过使用Molloy-Reed标准和病毒爆发模拟，可以证明使用此新连接算法形成的网络始终是连接网络。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号