A modified proportional fair radio resource management scheme in virtual RANs
| Autor: | Luis M. Correia, Luisa Caeiro, Behnam Rouzbehani |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
business.industry
Computer science Quality of service 05 social sciences 050801 communication & media studies 020206 networking & telecommunications 02 engineering and technology Proportionally fair 0508 media and communications Service level 0202 electrical engineering electronic engineering information engineering Fairness measure Resource management Radio resource management business Virtual network Heterogeneous network Computer network |
| Zdroj: | EuCNC |
| Popis: | This paper proposes a model for radio resource management in virtualised radio access networks, based on the criterion of proportional fairness, which is also adapted to deal with the situations when there is not enough capacity to serve all subscribers with an acceptable level of service, the so-called the extreme case. A single virtual network operator providing four different classes of services negotiates the required capacity to serve its subscribers, from a centralised entity called Virtual Radio Resource Management (VRRM). The main goals of VRRM are to maximise the utilisation of resources, while maintaining a level of fairness in the allocation of data rate among different services. However, under extreme situations, the algorithm is modified to react differently, according to the offered traffic load. In general, it keeps serving a number of users having the stringiest Quality of Service (QoS), with the minimum guaranteed data rate, while the rest of users performing lowest QoS priority services are increasingly delayed. The performance of the proposed algorithm is evaluated through a practical heterogeneous network scenario and different evaluation metrics. Results show that when there is enough capacity, the algorithm is capable of satisfying the predefined service level agreements, while keeping fairness, whereas under extreme situations, it delays just enough number of users to free capacity for high priority services. In both cases, the algorithm is capable of maximising the utilisation of resources. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|