User Allocation in Multi-System, Multi-Service Scenarios: Upper and Lower Performance Bound of Polynomial Time Assignment Algorithms

In this paper we cover the problem of how users of different service classes should be assigned to a set of radio access technologies (RAT). All RAT have overlapping coverage and the aim is to maximize a weighted sum of assignable users. Under the constraint that users cannot be split between multip...

Full description

Saved in:
Bibliographic Details
Published in2007 41st Annual Conference on Information Sciences and Systems pp. 41 - 46
Main Authors Blau, I., Wunder, G.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2007
Subjects
Bandwidth
Cost function
Downlink
Interference
Lagrangian functions
Mobile communication
Multiaccess communication
Performance loss
Polynomials
Upper bound
Online AccessGet full text

Cover

More Information
Summary:In this paper we cover the problem of how users of different service classes should be assigned to a set of radio access technologies (RAT). All RAT have overlapping coverage and the aim is to maximize a weighted sum of assignable users. Under the constraint that users cannot be split between multiple air-interfaces the problem is identified as NP-complete. In the first part of the paper we derive upper and lower bounds of polynomial assignment algorithms. Using Lagrangian theory and continuous relaxation we show for polynomial assignments that in scenarios with M air-interfaces there are at most M users less assigned than in the optimum solution. In the second part we present an algorithm and compare its performance to standard load-balancing strategies.
DOI:10.1109/CISS.2007.4298270