期刊文献+

内容中心网络中能耗优化的隐式协作缓存机制 被引量:5

Energy Optimized Implicit Collaborative Caching Scheme for Content Centric Networking
下载PDF
导出
摘要 综合考虑内容中心网络(CCN)的能耗优化及性能提升,该文提出一种内容中心网络中能耗优化的隐式协作缓存机制。缓存决策时,利用缓存节能量作为判决条件优先在用户远端节点缓存,并利用数据包携带最近上游缓存跳数信息进行隐式协作,减轻用户近端节点缓存空间的竞争压力,提高邻近节点缓存的差异性。缓存替换时,选取缓存节能量最小的缓存内容加以替换,达到最优的能耗优化效果。仿真结果表明,该缓存机制在性能上获得较优的缓存命中率及平均路由跳数,同时有效降低了网络能耗。 Taking into account the energy optimization and performance enhancement of the Content Uentrm Networking (CCN) comprehensively, an energy optimized implicit collaborative caching scheme for CCN is proposed. In terms of the caching decision, energy saving account is utilized as the judgement, which is carried out on consumer's remote nodes preferentially, and the data packet is utilized to carry the information of recent upstream caching hops, so as to realize the implicit collaboration, thus reducing the caching space competition pressure of the consumers' near nodes, improving the caching difference between nearby nodes. As for the caching replacement, the caching content with the minimum energy saving account is selected to be replaced, achieving the optimal energy consumption optimization effect. Simulation results show that, the caching scheme achieves better cache hit ratio and average routing hops, meanwhile, it reduces the network energy consumption effectively.
作者 伊鹏 李根 张震 YI Peng;LI Gen;ZHANG Zhen(National Digital Switching System Engineering & Technological Research Center, Zhengzhou 450002, Chin)
出处 《电子与信息学报》 EI CSCD 北大核心 2018年第4期770-777,共8页 Journal of Electronics & Information Technology
基金 国家自然科学基金(61372121 61521003)~~
关键词 内容中心网络 缓存机制 能耗优化 隐式协作 Content Centric Networking (CCN) Caching scheme Energy optimization Implicit collaboration
  • 相关文献

参考文献8

二级参考文献81

  • 1齐庆虎,李津生,洪佩琳,孙卫强.内容寻址网络中内容的有效定位[J].电路与系统学报,2004,9(5):67-71. 被引量:2
  • 2Jordi Pujol Ahullo, Marc Sanchez Artigas, Pedro Garcia Lopez. PlazetSim User and developer tutorial [ EB/ OL]. [2008 - 10 - 20]. http://ants, etse. urv. es/ planetsim.
  • 3RATHASAMY S, FRANCIS P, HANDLEY M, et al. A scalable content-addressable network [ C ]//Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, NY: ACM, 2001:161 -172.
  • 4STOICA l, MORRIS R, KARGER D, et al. Chord: A scalable peer-to-peer lookup service for internet applications[ C]//Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, NY: ACM, 2001 : 149 - 160.
  • 5MAYMOUNKOV P, MAZIERES D. Kademlia: A peer- to-peer infmTnation system based on the XOR metric [ C ]//Revised Papers from the First International Workshop on Peer-to-Peer Systems. London, UK : Springer-Verlag, 2002 : 53 - 65.
  • 6NICHOLAS J A, HARVEY N, JONES M B, et al. SkipNet: A scalable overlay network with practical locality properties [ C ]//Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems. Berkeley, CA: USENIX Association, 2003: 29 - 38.
  • 7REN S S, GUO L, JIANG S, et al. SAT-match: A self- adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks [ C]//Proceedings of the 18th International Parallel and Distributed Processing Symposimn. New York: IEEE Press, 2004 : 83 - 91.
  • 8RATNASAMY S, STOICA I, SHENKER S. Routing algorithms for DHTs : Some open questions [ C ]//Revised Papers from the First International Workshop on Peer-to- Peer Systems. London, UK : Springer-Verlag, 2002 45 - 52.
  • 9ROWSTRON A, DRUSCHEL P. Pastry: Scalable, distributed object location and routing for large scale peer- to-peer systems [ C ]//Proceedings of the 18th IFIP/ ACM International Conference on Distributed System Platforms. New York : IEEE, 2001 : 329 - 350.
  • 10ZHAO B Y, KUBIATOWICZ J D, JOSE A D. Tapestry: An Infrastructure for Fault-tolerant Wide-area Loca- tion and Routing[ D]. Berkeley, CA: University of California at Berkeley, 2001.

共引文献37

同被引文献35

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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