Distributed Caching Based on Matching Game in LEO Satellite Constellation Networks
Distributed Caching Based on Matching Game in LEO Satellite Constellation Networks
复制标题
LEO卫星星座网络中基于匹配博弈的分布式缓存
DOI：
10.1109/lcomm.2017.2771434
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Weidong Wang
中科院分区：
文献类型：
--
作者：
Shuaijun Liu;Xin Hu;Yipeng Wang;Gaofeng Cui;Weidong Wang
With the rapid development of low earth orbit (LEO) constellation satellite networks and on-board processing (OBP), in-network content caching becomes feasible which can further improve system performance. In order to minimize user terminals content access delay, a novel caching algorithm by optimizing content placement in LEO satellite constellation networks is proposed in this letter. The formulated problem is proved to be NP-Complete (NPC) by reducing it to the 2-Disjoint Set Cover (2DSC) problem which is a known NPC problem. This paper considers the interactions among distributed satellites for making individual content decisions. Then, this paper adopts an exchange-stable matching (ESM) algorithm based on many-to-many matching game with externalities. Simulation results show ESM algorithm can improve the system performance in terms of content access delay.
