From: Dynamic social cloud management scheme based on transformable Stackelberg game
Application type | Total computation requirement (ℳ\( \mathcal{X} \)) | Minimum local computation requirement | Service duration average/second |
---|---|---|---|
I | 1.28 Mbps | 0.64 Mbps | 1,800 s (30 min) |
II | 2.56 Mbps | 1.28 Mbps | 1,800 s (30 min) |
III | 3.84 Mbps | 1.92 Mbps | 600 s (5 min) |
IV | 5.12 Mbps | 2.56 Mbps | 600 s (5 min) |
V | 6.40 Mbps | 3.20 Mbps | 1,800 s (30 min) |
VI | 7.24 Mbps | 3.62 Mbps | 1,800 s (30 min) |
VII | 8.12 Mbps | 4.06 Mbps | 3,000 s (50 min) |
VIII | 9.48 Mbps | 4.74 Mbps | 1,200 s (20 min) |
Parameter | Value | Description | |
n | 30 | The number of mobile devices in SC | |
φ | 0.1, 0.2, 0.3, 0.4 | Altruistic propensity levels for each user | |
λ | 1 | The cost control parameter for a demander | |
\( \left\Vert \mathbb{K}\right\Vert \) | 5 | The number of altruistic propensity levels | |
γ | 0.3 | The egalitarianism factor for learning algorithm | |
Γ Λ | 0.2 ≤ Γ Λ  ≤ 0.8 | A pre-defined maximum relative contribution bound | |
Parameter | Description | ||
Λ i | The contribution level of the player i in the SC community | ||
\( \mathcal{X} \) i | The requested resource amount of the demander i | ||
ζ | A cost control parameter | ||
ℳ\( \mathcal{X} \) | The total resource amount to process the corresponding application | ||
\( \mathcal{Z} \) j | The amount of sharing resource of the supplier j | ||
\( {\displaystyle {\theta}_j^i} \) | The supplier j’s altruistic parameter to the demander i | ||
φ j | The supplier j’s general altruistic propensity |