On Fair Rule Caching in Software Defined Radio Access Networks

Abstract

In software defined radio access networks, base stations (BSs) operate according to commands received from a centralized controller. To avoid asking the controller frequently, BSs store these commands as rules in flow tables with limited size. This limitation necessitates fetching rules of some users from the controller causing longer processing delays. In this letter, we formulate the fair allocation of flow table spaces to the users within a cell as a mixed integer linear program which is an NP-hard problem. Nonetheless, we propose an optimal low-complexity solution. Finally, we show superior performance of this strategy versus other possible schemes.