软件学报
軟件學報
연건학보
JOURNAL OF SOFTWARE
2013年
8期
1947-1962
,共16页
刘外喜%余顺争%蔡君%高鹰
劉外喜%餘順爭%蔡君%高鷹
류외희%여순쟁%채군%고응
ICN(information-centric networking)%内容放置%内容替换%承诺时间%差异化缓存
ICN(information-centric networking)%內容放置%內容替換%承諾時間%差異化緩存
ICN(information-centric networking)%내용방치%내용체환%승낙시간%차이화완존
information-centric networking%content placement%content replacement%commitment time%differentiated caching
为了克服现有 Internet 架构存在的众所周知的缺点,未来网络的研究成为热点.ICN(information-centric networking)在众多新架构中正逐渐被公认为最有前途的方案.它把传输的内容缓存到沿途的节点.高效的缓存机制是它的一个重要研究方面.为此,提出了一种在分布式缓存机制中嵌入中心式缓存决策的机制(content-aware placement,discovery and replacement,简称APDR),它把内容的放置、发现、替换统一起来考虑,实现内容的有序缓存,提高网络的性能.APDR的主要思想是:Interest报文除了携带对内容的请求以外,还收集沿途各节点对该内容的潜在需求、空闲缓存等信息,使得Interest的汇聚点和目的地节点可以据此计算出一个缓存方案,并把该方案附加在Data报文上,通知返程途中的某些节点缓存该内容并设置指定的缓存时间.在多种实验条件下对APDR进行了仿真验证,结果表明,APDR 可以改善网络性能,包括缓存命中率、接入代价、替换数量、转发效率以及缓存鲁棒性等;而且APDR的额外开销也不大.
為瞭剋服現有 Internet 架構存在的衆所週知的缺點,未來網絡的研究成為熱點.ICN(information-centric networking)在衆多新架構中正逐漸被公認為最有前途的方案.它把傳輸的內容緩存到沿途的節點.高效的緩存機製是它的一箇重要研究方麵.為此,提齣瞭一種在分佈式緩存機製中嵌入中心式緩存決策的機製(content-aware placement,discovery and replacement,簡稱APDR),它把內容的放置、髮現、替換統一起來攷慮,實現內容的有序緩存,提高網絡的性能.APDR的主要思想是:Interest報文除瞭攜帶對內容的請求以外,還收集沿途各節點對該內容的潛在需求、空閒緩存等信息,使得Interest的彙聚點和目的地節點可以據此計算齣一箇緩存方案,併把該方案附加在Data報文上,通知返程途中的某些節點緩存該內容併設置指定的緩存時間.在多種實驗條件下對APDR進行瞭倣真驗證,結果錶明,APDR 可以改善網絡性能,包括緩存命中率、接入代價、替換數量、轉髮效率以及緩存魯棒性等;而且APDR的額外開銷也不大.
위료극복현유 Internet 가구존재적음소주지적결점,미래망락적연구성위열점.ICN(information-centric networking)재음다신가구중정축점피공인위최유전도적방안.타파전수적내용완존도연도적절점.고효적완존궤제시타적일개중요연구방면.위차,제출료일충재분포식완존궤제중감입중심식완존결책적궤제(content-aware placement,discovery and replacement,간칭APDR),타파내용적방치、발현、체환통일기래고필,실현내용적유서완존,제고망락적성능.APDR적주요사상시:Interest보문제료휴대대내용적청구이외,환수집연도각절점대해내용적잠재수구、공한완존등신식,사득Interest적회취점화목적지절점가이거차계산출일개완존방안,병파해방안부가재Data보문상,통지반정도중적모사절점완존해내용병설치지정적완존시간.재다충실험조건하대APDR진행료방진험증,결과표명,APDR 가이개선망락성능,포괄완존명중솔、접입대개、체환수량、전발효솔이급완존로봉성등;이차APDR적액외개소야불대.
With the emergence of information-centric networking (ICN) in which in-networking caching distinguishes it from other Internet architecture, efficient caching becomes increasingly attractive, but remains of great challenge as current Web caching. This paper proposes a distributed scheme that is embedded with a locally central model, called APDR (i.e., content-aware placement, discovery and replacement). In APDR, according to the information carried on Interest message, the destination of the Interest makes caching decision for the nodes along the path, including different time that the requested content will be cached in different nodes. Finally, the study evaluates the proposed scheme through extensive simulation experiments in terms of a wide range of performance metrics. The experiment results show that the scheme can yield a significant performance improvement over diverse operating environments, such as,cache hit ratio, average access cost, number of replacement, forwarding efficiency and cache robustness etc. At the same time, additional overhead of APDR is small.