From: Dynamic C-RAN resource sharing scheme based on a hierarchical game approach
Application type | Applications | Resource type | Minimum resource requirement | Maximum resource requirement |
---|---|---|---|---|
 I | Voice telephony | CPU | 30 MHz | 60 MHz |
Memory | 12Â Mbyte | 24Â Mbyte | ||
Storage | 4Â Gbyte | 8Â Gbyte | ||
Bandwidth | 128Â K | 512Â K | ||
 II | Video phone | CPU | 60 MHz | 120 MHz |
Memory | 24Â Mbyte | 48Â Mbyte | ||
Storage | 8Â Gbyte | 16Â Gbyte | ||
Bandwidth | 256Â K | 640Â K | ||
 III | Remote login | CPU | 15 MHz | 40 MHz |
Memory | 6Â Mbyte | 12Â Mbyte | ||
Storage | 2Â Gbyte | 4Â Gbyte | ||
Bandwidth | 64Â K | 384Â K | ||
 IV | Tele-conference | CPU | 60 MHz | 150 MHz |
Memory | 24Â Mbyte | 96Â Mbyte | ||
Storage | 8Â Gbyte | 32Â Gbyte | ||
Bandwidth | 256Â K | 896Â K | ||
Parameter | Value | Description | ||
  n | 10 | The number of SBSs | ||
  m | 10 | The number of MUs in each SBS | ||
  l | 4 | The number of resources | ||
  mp , Mp | 0.5 , 2 | The pre-defined minimum and maximum price boundaries | ||
  ω 1,ω 2,ω 3,ω 4 | 1.5, 1.2, 1, 1.5 | Willingness to pay the price for each resource | ||
  ε | 0.3 | The pre-defined bound for strategy stability | ||
Parameter | Initial | Description | Values | |
  \( U\_\mathcal{P} \) | 1 | The unit price for each resource | Dynamically adjustable |