首页> 外文会议>International Conference on Networked Systems >New Competition-Based Approach for Caching Popular Content in ICN
【24h】

New Competition-Based Approach for Caching Popular Content in ICN

机译:基于新的竞争对手ICN缓存流行内容的方法

获取原文
获取外文期刊封面目录资料

摘要

Improving the performance of the Internet, as part of the new generations networks, requires support for caching and multicast content delivery on each network cable. This new concept is called Information Centric Networking (ICN). In present paper, we consider a duopoly model of rational internet Service providers competing in ICN model where each ISP is motivated to cache content. Using a generalized Zipf distribution to model content popularity, we devise a game theoretic approach to determine caching and pricing strategies for each ISP. In turn, the subscribers' demand for the service of an ISP depends not only on the price and QoS of that ISP but also upon those proposed by all of its competitors. Through rigorous mathematical analysis, we prove existence and uniqueness of the Nash equilibrium. An iterative and distributed algorithm based on best response dynamics are proposed to achieve the equilibrium point. Finally, extensive simulations show convergence of a proposed scheme to the Nash equilibrium and give some insights on how the game parameters may vary the price and QoS at Nash equilibrium.
机译:作为新一代网络的一部分,提高互联网的性能需要支持在每个网络电缆上的缓存和多播内容传送。这个新概念被称为信息中心网络(ICN)。在本文中,我们考虑在ICN模型中竞争的Rational Internet服务提供商的双级模型,其中每个ISP都有动力缓存内容。使用广义的Zipf分布来模拟内容流行度,我们设计了一种游戏理论方法来确定每个ISP的缓存和定价策略。反过来,订阅者对ISP服务的需求不仅取决于该ISP的价格和QoS,而且还取决于所有竞争对手提出的价格和QoS。通过严格的数学分析,我们证明了纳什均衡的存在和唯一性。提出了一种基于最佳响应动态的迭代和分布式算法来实现均衡点。最后,广泛的模拟显示了纳什均衡的提出方案的融合,并对游戏参数如何在纳什均衡时提供一些洞察。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号