A Dynamic Cache Replacement and Proportional Fair Scheduling Algorithm in Fog Radio Access Networks

Fog radio access networks (F-RANs) are considered promising paradigms for minimizing the latency and improving the overall throughput of the system. The fronthaul burden can be diminished by utilizing the storage and signal processing capabilities of the fog RANs. To minimize the delay for the delay sensitive applications F-RANs consists of fog access points (FAPs) with local cache memory. However, the shared spectrum is used among the FAPs and limited contents can be stored in the cache memory. Thus, efficient cache allocation algorithm is required that would update the contents according to the priority requests of the users. As, FAP mode is the desired mode of communication for all the users, a fair and efficient scheduling algorithm is required. Thus, we propose a dynamic cache utility based replacement and proportional fair scheduling algorithm (DCR-PFS) for fog RANs to provide fairness and maximize the throughput while considering the content requests of the users.