In this paper, we present low-complexity algorithms for cache placement problem in software-defined radio access networks. Our key design target is that the packet delay from any cache to its associated users is below a threshold. This feature is a significant improvement compared to conventional approaches relying on the average hop count. We introduce a traffic engineering solution for joint multiserver selection and rate allocation. This algorithm is used to minimize the cache placement cost function, such as delivery cost per bit. Our cache placement method allows prediction of user throughput and thus the network throughput. Extensive simulation results verify that our method can give optimal or near optimal network throughput while guaranteeing packet delay performance.
Cache Placement Solutions in Software-Defined Radio Access Networks
2017-09-01
492362 byte
Conference paper
Electronic Resource
English
Multi-Radio Access Software-Defined Vehicular Network
IEEE | 2022
|Software Defined Radio - Überblick/Einsatzzweck
Tema Archive | 2007
|