...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Circuits and systems >Highly Available Hypercube Tokenized Sequential Matrix Partitioned Data Sharing in Large P2P Networks
【24h】

Highly Available Hypercube Tokenized Sequential Matrix Partitioned Data Sharing in Large P2P Networks

机译：大型P2P网络中高度可用的Hypercube令牌化顺序矩阵分区数据共享

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

摘要

Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simuIator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.
机译：对等（P2P）网络是一种分布式体系结构，用于在对等节点之间划分任务或数据。本文提出了一种有效的超立方体顺序矩阵分区（HS-MP），用于使用令牌化方法在P2P网络中进行有效的数据共享，以解决较大的P2P网络的问题。数据的可用性首先由令牌化程序使用Dynamic Hypercube Organization进行度量。通过应用动态超立方体组织，它可以有效地协调和协助P2P网络中的对等节点，从而确保许多位置的数据可用性。然后，令牌化器使用顺序自组织（SSO）ID生成模型为同级中的每个数据分配有效ID。这样可以确保在最小的时间间隔内与大型P2P网络中的其他节点共享数据，这是通过接近数据可用性而获得的。为了验证框架HS-MP，使用从数据共享应用程序收集的流量跟踪评估性能。使用Network simuIator-2进行的仿真表明，所提出的框架优于传统的流模型。相对于对等节点的数量，数据大小，共享的数据量和执行时间，使用能耗，平均等待时间和平均数据可用性速率来分析所提出系统的性能。所提出的方法将能源消耗减少了43.35％（用于转置流量），35.29％（至bitrev流量）和25％（至bitcomp流量模式）。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号