User allocation algorithm with rate guarantees for multi-rate mobile networks with Backhaul Constraints

View/Open
Cita com:
hdl:2117/7904
Document typeConference report
Defense date2009-04
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
The optimization of the base station (BS) assignment problem in mobile access networks is a primary task towards enabling efficient utilization of network resources. So far, this problem has been mainly studied in terms of air interface optimization. In this paper, we present a novel BS assignment strategy that integrates backhaul constraints in the user assignment criterion. The motivation of this strategy is the fact that in some scenarios the backhaul can become the network
bottleneck. The BS assignment problem or user allocation problem is formulated using a utility-based framework. We take into consideration key aspects such as the revenue associated to each type of service along with the resource consumption in
terms of both radio and backhaul resources. Results are given in a multi-service scenario for guaranteed rate services.
CitationGaleana, H.; Lainz, A.; Ferrus, R. User allocation algorithm with rate guarantees for multi-rate mobile networks with Backhaul Constraints. A: IEEE Vehicular Technology Conference. "IEEE 69th Vehicular Technology Conference". 2009, p. 1-5.
ISBN978-1-4244-2517-4
Files | Description | Size | Format | View |
---|---|---|---|---|
UserAlgorithm.pdf | 251,0Kb | View/Open |