检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京邮电大学网络与交换技术国家重点实验室,北京100876
出 处:《电子与信息学报》2017年第11期2741-2747,共7页Journal of Electronics & Information Technology
基 金:国家自然科学基金(61302078;61372108);国家863计划项目(2011AA01A102);国家科技重大专项(2011ZX03005-004-02)~~
摘 要:网内缓存技术一直是信息中心网络(Information-Centric Networking,ICN)研究中的核心问题。传统缓存方案通常为网络内的单一全局协作策略,然而不同网络区域的缓存目标不同,导致传统方案的性能优化程度有限,可扩展性不强。同时协同缓存放置和请求路由,相较于纯缓存方案有效性更高。该文提出并评估了一种新型面向分域的协作混合缓存放置和路由请求机制,该机制将缓存网络区分核心网络和边缘网络,在核心网络中采用非沿路的HASH协作机制,边缘网络采用沿路的回退协作机制,创建二元组标签保存缓存放置的信息并作用于后续的请求转发。通过仿真对比表明,该文提出的协作混合缓存机制相较于传统策略可以更好地平衡网络资源利用和用户体验,并在大型ISPs中拓展性更好。In-network caching is always a hot topic in the research of Information-Centric Networking(ICN). Most of traditional caching coordination research use uniform caching policies within the same cache network, but the aim of different network part is quite various, thus the existed schemes are hard to achieve a comprehensive performance optimization or hard to scale. Additionally, most work fail to adapt to the on-path coupling effect content caching and request routing. This paper proposes and evaluates novel domain-orientated coordinated hybrid content caching and request search in ICN, which fully exploit content-space partitioning and divide the cache network into a core area and several edge areas. The off-path HASH-based coordination scheme is applied to core area and on-path reversion scheme is deployed in edge areas. The binary tuple is created to record the information of content placement and guides the request routing. Through simulation and comparison, it is found that the proposed policies yield better tradeoff between network-centric and user-centric performance than traditional schemes, and are scalable to be used in large ISPs.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70