期刊文献+

CCN路由的缓存机制研究

Research on Caching Mechanism of CCN Routing
下载PDF
导出
摘要 CCN网络通过待定请求表(Pending Interest Table,PIT)请求源端数据是一个零散的过程,对于首次访问的所有数据必然会带来峰值带宽问题,基于此场景提出一种内容存储(Content Store,CS)数据模型,包括频繁度模型、支持度模型、置信度模型和关联度模型,通过该模型在网络空闲状态下提前在对应路由器设备上来预存储原始数据的关联数据,从而实现精准化预缓存网络数据。仿真实验结果表明,此机制可以实现节省网络带宽,有效降低网络拥塞的目的。 CCN network requests source data through Pending Interest Table is a fragmented process.All data accessed for the first time will inevitably bring peak bandwidth problems.Based on this scenario,a Content Store data model is proposed,including frequency model,support model,confidence model and correlation model,Through this model,the associated data of the original data is pre-stored on the corresponding router device in advance when the network is idle,so as to achieve accurate pre-cache of network data.The simulation experimental results show that this mechanism can achieve the goal of saving network bandwidth and effectively reducing network congestion.
作者 汤红 李涛 宋哲 TANG Hong;LI Tao;SONG Zhe(ZTE Nanjing R&D Center,Nanjing 210012,China;Purple Mountain Laboratories,Nanjing 211111,China;Yancheng Branch of China Mobile Communications Corporation,Yancheng 224399,China)
出处 《现代信息科技》 2023年第12期78-80,84,共4页 Modern Information Technology
关键词 预缓存 置信度模型 缓存老化 关联度模型 precache confidence model cache aging correlation model
  • 相关文献

参考文献6

二级参考文献49

  • 1宋中山,成林辉,吴立峰.一种基于关联规则的增量数据挖掘算法[J].湖北大学学报(自然科学版),2006,28(3):240-243. 被引量:9
  • 2Pei Jian,Han Jiawei.Mining sequential patterns by pattern-growth:the prefix span approach[J].IEEE Transactions on Knowledge and Data Engineering,2004,6(10):1-17.
  • 3宋余庆 朱玉全 孙志辉 陈耿.基于FP—Tree的最大频繁项集挖掘及其更新算法.软件学报,2003,14(9):1586—1592[J].http://wwwjos.org.cn/1000-9825/14/1586.htm,:.
  • 4Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proc. of the 20th Int'l Conf. on VLDB. 1994. 487-499.http://www.almaden.ibm.conVcs/people/srikant/papers/vldb94.pdf.
  • 5Bayardo R. Efficiently mining long patterns from databases. In: Haas LM, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1998. 85-93.
  • 6Burdick D, Calimlim M, Gehrke J. Mafia: A maximal frequent itemset algorithm for transactional databases. In: Proc. of the 17th Int'l Conf. on Data Engineering. 2001. 443-452. http://www.cs.cornell.edu/boom/2001 sp/yiu/mafia-camera.pdf.
  • 7Gouda K, Zaki MJ. Efficiently mining maximal frequent itemsets. In: Proc. of the 1st IEEE Int'l Conf. on Data Mining. 2001.163-170. http ://www.cs .tau. ac .il/-fiat/dmsem03/E fficient%20Mining%20Maxmal%20Frequent%20Itemsets%20-%202001 .pdf.
  • 8Wang H, Li QH. An improved maximal frequent itemset algorithm. In: Wang GY, eds. Proc of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, the 9th Int'l Conf (RSFDGrC 2003). LNCS 2639, Heidelberg: Springer-Verlag, 2003. 484-490.
  • 9Zhou QH, Wesley C, Lu BJ. SmartMiner: A depth 1st algorithm guided by tail information for mining maximal frequent itemsets.In: Proc of the IEEE Int'l Conf on Data Mining (ICDM2002). 2002. 570-577. http://www.serviceware.com/pdffiles/datasheets/ServiceWare-Smartminer-Datasheet.pdf.
  • 10Grahne G, Zhu JF. High performance mining of maximal frequent itemsets. In: Proc of the 6th SIAM Int'l Workshop on High Performance Data Mining (HPDM 2003). 2003. 135-143. http://www.cs.concordia.ca/db/dbdm/hpdm03.pdf.

共引文献98

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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