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

• Published in: 2007 41st Annual Conference on Information Sciences and Systems pp. 41 - 46
• Main Authors: Blau, I., Wunder, G.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.03.2007
• Subjects: Bandwidth; Cost function; Downlink; Interference; Lagrangian functions; Mobile communication; Multiaccess communication; Performance loss; Polynomials; Upper bound

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...