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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Cache Placement Solutions in Software-Defined Radio Access Networks


    Contributors:


    Publication date :

    2017-09-01


    Size :

    492362 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Multi-Radio Access Software-Defined Vehicular Network

    Altahrawi, Mohammed A. / Abdullah, Nor Fadzilah / Nordin, Rosdiadee et al. | IEEE | 2022




    Software Defined Radio - Überblick/Einsatzzweck

    Metzner, Andreas | Tema Archive | 2007


    Multi-controller Placement in Software Defined Satellite Networks: A Meta-heuristic Approach

    Jiang, Wei wei / Han, Haoyu / Zhang, Yang et al. | IEEE | 2024