• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Information Networking: Advances in Data Communications and Wireless Networks; Lecture Notes in Computer Science; 3961 >Heterogeneity Aware P2P Algorithm by Using Mobile nodeID
【24h】

Heterogeneity Aware P2P Algorithm by Using Mobile nodeID

机译：使用移动节点ID的异构感知P2P算法

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

摘要

The peer-to-peer systems have become an extremely popular platform for large-scale content sharing. A lot of research papers discussed the Distributed Hash Table (DHT) based p2p algorithms to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and for nodes which join/leave the system frequently, the system will generate a lot of information maintenance traffic such as routing information update traffic and data copy traffic to keep the efficiency of the DHT based p2p algorithms.rnIn this paper, we suggest the mobile nodeID based p2p algorithm to reduce the overhead by exploiting the heterogeneity of participant nodes efficiently. Unlike the DHT based p2p algorithms, the nodeID of a node changes according to its characteristic to support the p2p system efficiency and each nodes takes the different responsibility in accordance with its nodeID. We classify nodes into the two types according to the characteristics of nodes : the reliable nodes and the leaf nodes. The reliable node which is the more stable and more reliable node acts as the more important role of the routing and the replication. The leaf node which joins/leaves very frequently acts as the simple role to minimize the information maintenance traffic. The reliable node has the load-balanced ID to balance the loads and the leaf node has the load-free ID to reduce the responsibility.rnWe examine the efficiency of our p2p algorithm via a event driven simulation and show that the information maintenance traffic reduces and the routing process is more efficient.
机译：对等系统已成为用于大规模内容共享的极为流行的平台。许多研究论文讨论了基于分布式哈希表（DHT）的p2p算法，以保证可以有效地收集空闲资源。但是，p2p系统由具有高度异构可用性的组件组成，并且对于频繁加入/离开系统的节点，系统将产生大量的信息维护流量，例如路由信息更新流量和数据复制流量，以保持DHT的效率。在本文中，我们建议基于移动节点ID的p2p算法通过有效利用参与者节点的异构性来减少开销。与基于DHT的p2p算法不同，节点的nodeID根据其特性而变化以支持p2p系统效率，并且每个节点根据其nodeID承担不同的责任。我们根据节点的特性将节点分为两类：可靠节点和叶节点。可靠节点是更稳定，更可靠的节点，它在路由和复制中扮演着更重要的角色。频繁加入/离开的叶节点充当简单的角色，以最大程度地减少信息维护流量。可靠节点具有负载均衡的ID以平衡负载，叶节点具有空闲的ID以减少责任。我们通过事件驱动的仿真检查了p2p算法的效率，并表明信息维护流量减少了，并且路由过程效率更高。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号