From: Energy-efficient proactive edge caching with sleep scheduling for green networks
Notation | Description |
---|---|
S t | State at the decision epoch t |
A t | Action chosen at the decision epoch t |
Ï„ | Duration of each decision epoch |
\({\mathbb {S}}\) | State space |
\({\mathbb {P}}\) | State space for denoting the popularity of contents |
\({\mathbb {M}}\) | State space for denoting the mode of SCs |
\({\mathbb {N}}\) | State space for denoting the number of users in SCs |
\({\mathbb {C}_{i}}\) | State space for denoting cached contents in SC i |
N S | Number of SCs |
N C | Number of contents |
M U | Maximum number of users in one SC |
\({\mathbb {A}}\) | Action space |
A M | Action vector for deciding mode |
A C | Action vector for deciding whether each content is cached at SCs |
ξ | Maximum number of contents which can be cached in SCs |
E A | Energy consumption of the active mode during Ï„ |
\(N_{R}^{i,j}\) | Expected number of requests for content j in SC i |
λ | Discount factor |