首页> 外文会议>Active media technology >A Case for Content Distribution in Peer-to-Peer Networks
【24h】

A Case for Content Distribution in Peer-to-Peer Networks

机译:对等网络中内容分发的案例

获取原文
获取原文并翻译 | 示例

摘要

In large scale peer-to-peer networks, it is impossible to perform a query request by visiting all peers. There are some works that try to find the location of resources probabilistically (i.e. non-deterministically). They all have used inefficient protocols for finding the probable location of peers who manage the resources. This paper presents a more efficient protocol that is proximity-aware in the sense that it is able to cache and replicate the popular queries proportional to distance latency. The protocol dictates that the farther the resources are located from the origin of a query, the more should be the probability of their replication in the caches of intermediate peers. We have validated the proposed distributed caching scheme by running it on a simulated peer-to-peer network using the well-known Gnutella system parameters. The simulation results show that the proximity-aware distributed caching can improve the efficiency of peer-to-peer resource location services.
机译:在大型对等网络中,不可能通过访问所有对等来执行查询请求。有一些工作试图概率性地(即不确定地)找到资源的位置。他们都使用低效的协议来查找管理资源的对等方的可能位置。本文提出了一种更有效的协议,该协议可以感知和感知与距离延迟成正比的流行查询,从而可以感知邻近。该协议规定,资源离查询源的位置越远,在中间节点的缓存中复制资源的可能性就越大。通过使用众所周知的Gnutella系统参数在模拟的对等网络上运行该分布式缓存方案,我们已经验证了该提议。仿真结果表明,邻近感知分布式缓存可以提高对等资源定位服务的效率。

著录项

  • 来源
    《Active media technology》|2010年|p.6-17|共12页
  • 会议地点 Toronto(CA);Toronto(CA)
  • 作者单位

    Department of Computer Engineering, Iran University of Science and Technology (IUST) 16846-13114, Hengam Street, Resalat Square, Narmak, Tehran, Iran;

    Department of Computer Engineering, Iran University of Science and Technology (IUST) 16846-13114, Hengam Street, Resalat Square, Narmak, Tehran, Iran;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 多媒体技术与多媒体计算机;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号