期刊文献+

面向网络行为的CDN缓存分配策略 被引量:1

Network Behavior-oriented CDN Cache Allocation Strategy
下载PDF
导出
摘要 撒谎行为的存在会破坏CDN缓存分配的公平性。使用博弈论对服务器在缓存分配过程中的自私撒谎行为进行了研究。经分析发现,服务器撒谎行为的本质就是当缓存不足时,额外多申请一定量缓存;而当缓存充足时,则诚实地申请所需缓存量。针对这种撒谎行为,提出了一种公平分配算法,在计算服务器的缓存申请量时,考虑其历史缓存申请量,并根据不同阶段申请量的有效性不同引入年龄因子,(重新)计算得到服务器的当前有效缓存申请量,使得撒谎的服务器与诚实的服务器相比受到更多损失,以此来促使其停止撒谎行为。同时,公平算法还保证了系统的最大吞吐量,并引入了价格机制来保证诚实的服务器得到更高的需求满足度。仿真实验结果表明,公平算法对于上述撒谎行为有很好的改善效果。 Lying behavior may destroy the fairness of CDN cache allocation.The selfish lying behavior of servers during CDN cache allocation with the game theory was studied.The essence of lying behavior is that servers will apply more cache when the total cache is not enough,otherwise honestly apply requisite cache volume when the total cache is enough.We proposed fairness algorithm to deal with lying behaviors.We considered the historical application volume while calculating the new one.In addition,we introduced the age factor to calculate the application's effectiveness in different phase.In this way,we could urge the lying servers to stop lying by making them lose more than the honest servers.At the same time,we guaranteed the optimal throughput of system and introduced price mechanism to make honest servers to be more demand-satisfying.The experiment shows the fairness algorithm has a good improvement for lying behavior.
出处 《计算机科学》 CSCD 北大核心 2015年第7期156-161,共6页 Computer Science
基金 国家自然科学基金(60905043 61073107 61173048) 上海市教育委员会科研创新项目 中央高校基本科研业务费资助
关键词 撒谎行为 CDN缓存分配 年龄因子 价格机制 Lying behavior CDN cache allocation Age factor Price mechanism
  • 相关文献

参考文献11

  • 1Wang Zhan, Jiang Hai, Sun Yi, et aL A k-coordinated decentra- lized replica placement algorithm for the ring-based CDN-P2P architecture[C]// 2010 IEEE Symposium on Computers and Communications (ISCC). 2010 : 811-816.
  • 2Chen Jian-bo, Chen Chu-chuan. Using Particle Swarm Optimiza- tion Algorithm in Multimedia CDN Content placement[C]// 2012 Fifth International Symposium on Parallel Architectures, Algorithms and Prolramming(PAAP). 2012:45-51.
  • 3冯翔,刘智满,帅典勋.内容分布网络缓存资源并行分配的博弈粒子场方法[J].计算机学报,2007,30(3):368-379. 被引量:5
  • 4乐光学,李仁发,陈志,周旭.P2P网络中搭便车行为分析与抑制机制建模[J].计算机研究与发展,2011,48(3):382-397. 被引量:14
  • 5Tang Ping-zhong, Yoav Shoham, Lin Fang-zhen. Designing com- petitions between teams of individuals rJ']. Artificial Intelli- gence, 2010,174 (11) : 749-766.
  • 6Meir R,Procaccia A D,Rosenschein J S. Algorithm for strategy- proof classificationrJ]. Artificial Intelligence, 2012,186 : 123-156.
  • 7Teacy W T L, Luck M, Rogers A, et al. An efficient and versa- tile approach to trust and reputation using hierarchical Bayesian modelling[J]. Aritificial Intelligence, 2012,193 (6) : 149-185.
  • 8Guo Ming-yu,Conitzer V. Optimal-in-expectation redistribution mechanisms[J]. Artificial Intelligence, 2010,174 (5/6) : 363-381.
  • 9Kaizoji T. Multiple equilibria and chaos in a discrete tatonne- ment process[J]. Journal of Economic Behavior & Organiza- tion, 2010,76 (3) : 597-599.
  • 10Kitti M. Convergence of iterative tatonnement without price normalization[J]. Journal of Economic Dynamics & Control, 2010, 34 (6) : 1077-1091.

二级参考文献54

  • 1Manoj Parameswaran, Anjana Susarla, Andrew B. et al. P2P networking: An information-sharing alternative [J]. Computing Practices, 2001, 34(7): 31-38.
  • 2Farag Ahmed Azzedin. Classifying and tracking free riders in multimedia-based systems [J]. Journal of Universal Computer Science, 2010, 16(10) : 1368-1387.
  • 3Schollmeier R, Schollmeier G. Why Peer-to-Peer(P2P) does scale: Analysis of P2P traffic patterns [C] //Proc of IEEE Int Conf on P2P Computing 2002. Piscataway, NJ: IEEE, 2002, 112-119.
  • 4Dejan S Milojicic, Vana Kalogerraki, Rajan Lukose, et al. Peer-to-Peer Computing [EB/OL]. [ 2009-12-05 ]. http:// www. hpl. hp. com/techreports/2002/HPL-2002-57R1, pdf.
  • 5Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to-peer lookup service for Internet applications [EB/OL]. [2009-12-05]. http://pdos, csail, mit. edu/papers/chord: sigcomm01/chord_sigcomm. pdf.
  • 6Ben Y Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry: A resilient global-scale overlay for service deployment [J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41-53.
  • 7Huu Tran, Hitchens M, Varadharajan V, et al. A trust based access control framework for P2P file sharing systems[EB/OL]. [2009-12-05]. http://csdl2, computer, org/comp/ proceedings[hicss]2005/ 2268/09/22680302c. pdf.
  • 8Brighten Godfrey P, Scott Shenker, Ion Stoica. Minimizing churn in distributed systems [EB/OL]. [-2009-12-05 ]. http://www, eecs. berkeley, edu/Pubs/TechRpts/2006/EECS- 2006-25. pdf.
  • 9Kempe D, Kleinberg J, Demers A. Spatial gossip and resource location protocols [EB/OL]. [2009-12-05]. http:// www. cs. cornell, edu/home/kleinber/stoc01-gossip, pdf.
  • 10Kim Kwang Hoon, Kim Hak Sung. A peer-to-peer workflow model for distributing large-scale workfiow data onto grid/ P2P [J]. Journal of Digital Information Management, 2005, 3(2) : 64-70.

共引文献17

同被引文献2

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部