A distributed best-arm identification algorithm for linear bandits enables collaborative service placement at edge servers to minimize total user delay in small cell networks.
Multi-time scale service caching and pricing in MEC systems with dynamic program popularity,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Bandits
A distributed best-arm identification algorithm for linear bandits enables collaborative service placement at edge servers to minimize total user delay in small cell networks.