无线移动网络中基于数据访问分布的合作缓存研究

项目名称： 无线移动网络中基于数据访问分布的合作缓存研究

项目编号： No.61202416

项目类型： 青年科学基金项目

立项/批准年度： 2013

项目学科： 计算机科学学科

项目作者： 范小朋

作者单位： 中国科学院深圳先进技术研究院

项目金额： 23万元

中文摘要： 随着移动互联网和云计算的兴起，移动用户通过无线多跳网络可以随时随地的访问Internet。但是，无线网络在带宽和移动设备在存储空间等方面的资源有限，无法满足大量用户同时访问数据的需求，也不可能在本地缓存大量的数据。移动用户的移动性也会导致无线链接的经常性断开，网络分裂后部分数据无法访问。这些问题都可以通过合作缓存的技术得到解决，利用移动结点之间的合作将数据分散的放置在缓存结点上，在有限的存储空间上实现数据访问总开销的最小化（即缓存放置问题，NP-hard难度）。本项目考虑到无线通信共享介质的特点，从实用性角度考虑了无线信道竞争对于缓存放置问题的影响，同时从新颖性的角度考虑了移动结点的自私性和利他性，通过对数据访问分布和数据内在关系的分析，将提出合理分配缓存空间以达到数据访问总开销的最小化。本项目关键技术的突破，将会带来移动互联网中用户访问数据质的提升，为云服务的普及提供关键技术支撑。

中文关键词： 合作缓存；缓存放置；数据访问分布；无线移动网络；

英文摘要： With the rapid development of mobile internet and cloud computing, mobile users can access the Internet by a wireless multi-hop network. However, due to the limited bandwidth of wireless network and the small storage on mobile devices, it is not possible for a lot of mobile users to access data simultaneously. Moreover, the frequently disconnection of a wireless network also results in network partitions so that part of the data cannot be accessed by mobile users. These problems can be dealt with by cooperative caching. A typical strategy in cooperative caching works as follows. Data sources transfer some data copies to some nodes called cache nodes. Other nodes may access data items from the cache nodes nearby, instead of data sources. Consequently, total access cost can be reduced because of the service provided by these cache nodes. However, due to the limited cache space, not all the data items can be cached locally. It is required to consider what data items should be selected at which mobile node to minimize total access cost. The cache placement problem is the key problem in cooperative caching and its complexity is proved NP-hard. It is referred to as to let each mobile node select a subset of data items to cache cooperatively in its limited cache so that total access cost is minimized. In this project,

英文关键词： Cooperative Caching；Cache Placement；Data Access Distribution；Mobile Wireless Network；