無線網路環境下即時合作式內容暫存之研究

Abstract

在本篇論文中，我們研究了在無線網絡中，基站（BS）具有有限緩存空間以及未知的內容熱門程度的延遲感知合作線上內容緩存機制。我們提出了一種在不需要知道內容熱門程度的多BS合作系統中進行合作緩存的線上演算法。當來自用戶的新請求到達BS時，如果所請求的內容已經被BS緩存在其存儲空間中，則BS通過直接傳送來滿足此請求;否則，BS向移動性管理實體（MME）發送訊息以啟動線上內容緩存機制，於是所提出的合作線上內容緩存演算法（COCA）決定在哪個BS中應該緩存所請求的內容，考慮三個重要的因素：每個BS中的殘餘緩存存儲空間、每個BS連接其他BS的數量、以及每個BS中服務用戶的數量。另外，由於BS中的儲存空間有限，所提出的COCA演算法必須消除最近最少使用的（LRU）內容來釋放其空間。

我們透過模擬比較了所提出的COCA演算法與離線合作緩存模式的延遲表現。模擬結果顯示，COCA演算法具有比離線模式更好的延遲表現。

In this thesis, we study a delay-aware cooperative online content caching mechanism in wireless networks with limited caching space in each base station (BS) and unknown popularity of the contents. An online algorithm is proposed for cooperative caching in multi-BS coordinated systems that does not require any knowledge of the contents popularities. When a new request from a user arrives at a BS, the BS responds the request by direct delivery if the requested content is currently cached in its storage space; otherwise, the BS sends a message to the Mobility Management Entity (MME) to initiate the online content caching mechanism. The proposed cooperative online content caching algorithm (COCA) then decides in which BS the requested content should be cached with considerations of three important factors: the residual cache storage space in each BS, the number of coordinated connections each BS is involved with other BSs, and the number of served users in each BS. In addition, due to limited storage space in the cache, the proposed COCA algorithm eliminates the least recently used (LRU) contents to free up the space.