全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

面向内容网络中基于相关内容聚集的缓存方案

DOI: 10.13190/j.jbupt.2014.04.005, PP. 20-24

Keywords: 面向内容网络,缓存方案,相关内容聚集,路由可扩展性

Full-Text   Cite this paper   Add to My Lib

Abstract:

提出了一种基于相关内容聚集的缓存方案,通过具有相同特征的相关内容的相互吸引,使相关内容在节点上聚集,从而方便对缓存内容进行内容特征抽象,以减少向外通告的路由信息量,提高面向内容网络的路由可扩展能力;同时通过相关内容生存时间相互增强的策略,增强了缓存内容的稳定性,提高了其路由可信度.在此基础上设计了通用的相关内容聚集算法,仿真结果符合预期效果.

References

[1]  Jacobson V, Smetters D K, Thornton J D, et al. Networking named content[J]. Communications of the ACM, 2012, 55(1): 117-124.
[2]  Feldmann A. Internet clean-slate design: what and why?[J]. ACM SIGCOMM Computer Communication Review, 2007, 37(3): 59-64.
[3]  Alduán M, álvarez F, Zahariadis T, et al. Architectures for Future Media Internet[M]. User Centric Media, 2012: 105-112.
[4]  Laoutaris N, Syntila S, Stavrakakis I. Meta algorithms for hierarchical web caches[C]//Performance, Computing, and Communications, 2004 IEEE International Conference on. IEEE, 2004: 445-452.
[5]  Psaras I, Chai W K, Pavlou G. Probabilistic in-network caching for information-centric networks[C]//Proceedings of the second edition of the ICN workshop on Information-centric networking. ACM, 2012: 55-60.
[6]  Li J, Wu H, Liu B, et al. Popularity-driven coordinated caching in named data networking[C]//Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems. ACM, 2012: 15-26.
[7]  叶润生,徐明伟.命名数据网络中的邻居缓存路由策略[J].计算机科学与探索,2012,6(7):593-601.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133