Investigation of Interconnect Algorithms in a Radio Base Station Environment

Abstract

We investigate the problem of allocating communication paths in the interconnect network within radio base stations (RBS). With the enlargement of RBSs to accommodate the growing capacity requirements there is a need to automate the allocation. The problem is modelled as the Unsplittable Flow Problem and several algorithms described in the literature in the area are evaluated against the specific circumstances. An evaluation framework is designed and a few algorithms including shortest path and branch-and-cut based are implemented. Based on the frame work measurements, one can give some recommendations on when the different algorithms may be appropriate and the strengths and weaknesses for each. Interestingly, our evaluation results do not show improvements in solution quality for the well-known branch-and-cut algorithms. We note that the framework can be easily extended to evaluate many new algorithms and compare the existing algorithms on real and syntactic data.