• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Workshop on Self-Organizing Systems >Cache Capacity Allocation to Overlay Swarms
【24h】

Cache Capacity Allocation to Overlay Swarms

机译：缓存容量分配覆盖群

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Peer-to-peer applications generate huge volumes of Internet traffic, thus leading to higher congestion, as well as higher costs for the ISPs particularly due to inter-domain traffic. The traditional traffic management approaches employed by ISPs (e.g. traffic shaping or even throttling) often lead to a deterioration of users' Quality-of-Experience. Previous works have verified that the insertion of ISP-owned Peers (IoPs) can deal effectively with this situation. The mechanism offers caching while exploiting the self-organizing structure of overlays. Thus, it leads to both improved performance for peers and reduced inter-domain traffic costs for ISPs. In this paper, we study how the available IoP bandwidth capacity should be allocated among the various swarms that it can possibly join. In particular, we identify a variety of factors that influence the effectiveness of Swarm Selection and Bandwidth Allocation, and we investigate their impact on the practically relevant example of BitTorrent, primarily by means of simulations.
机译：点对点应用程序产生巨大的互联网流量，从而导致更高的拥塞，以及域间流量的ISP的成本更高。 ISPS（例如交通塑造甚至节流）采用的传统交通管理方法往往导致用户质量的质量恶化。以前的作品已经验证了ISP拥有的同行（IOPS）的插入可以有效处理这种情况。该机制提供缓存，同时利用覆盖的自组织结构。因此，它导致对等方的性能提高，并降低了ISP的域间交通成本。在本文中，我们研究了如何在可能加入的各种群体中分配可用的IOP带宽容量。特别是，我们确定了影响群体选择和带宽分配的有效性的各种因素，我们主要通过模拟调查它们对实际相关示例的影响。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号