애스크로AIPublic Preview
← 학술논문 검색
학술논문KSII Transactions on Internet and Information Systems2019.05 발행

A Bankruptcy Game for Optimize Caching Resource Allocation in Small Cell Networks

A Bankruptcy Game for Optimize Caching Resource Allocation in Small Cell Networks

Liying Zhang(Beihang University); Gang Wang(Beihang University); Fuxiang Wang(Beihang University)

13권 5호, 2319~2337쪽

초록

In this paper, we study the distributed cooperative caching for Internet content providers in a small cell of heterogeneous network (HetNet). A general framework based on bankruptcy game model is put forth for finding the optimal caching policy. In this framework, the small cell and different content providers are modeled as bankrupt company and players, respectively. By introducing strategic decisions into the bankruptcy game, we propose a caching value assessment algorithm based on analytic hierarchy process in the framework of bankruptcy game theory to optimize the caching strategy and increase cache hit ratio. Our analysis shows that resource utilization can be improved through cooperative sharing while considering content providers’ satisfaction. When the cache value is measured by multiple factors, not just popularity, the cache hit rate for user access is also increased. Simulation results show that our approach can improve the cache hit rate while ensuring the fairness of the distribution.

Abstract

In this paper, we study the distributed cooperative caching for Internet content providers in a small cell of heterogeneous network (HetNet). A general framework based on bankruptcy game model is put forth for finding the optimal caching policy. In this framework, the small cell and different content providers are modeled as bankrupt company and players, respectively. By introducing strategic decisions into the bankruptcy game, we propose a caching value assessment algorithm based on analytic hierarchy process in the framework of bankruptcy game theory to optimize the caching strategy and increase cache hit ratio. Our analysis shows that resource utilization can be improved through cooperative sharing while considering content providers’ satisfaction. When the cache value is measured by multiple factors, not just popularity, the cache hit rate for user access is also increased. Simulation results show that our approach can improve the cache hit rate while ensuring the fairness of the distribution.

발행기관:
한국인터넷정보학회
DOI:
http://dx.doi.org/10.3837/tiis.2019.05.005
분류:
컴퓨터학

AI 법률 상담

이 논문의 주제에 대해 더 알고 싶으신가요?

460만+ 법률 자료에서 관련 판례·법령·해석례를 찾아 답변합니다

AI 상담 시작
A Bankruptcy Game for Optimize Caching Resource Allocation in Small Cell Networks | KSII Transactions on Internet and Information Systems 2019 | AskLaw | 애스크로 AI