2015
DOI: 10.1109/mnet.2015.7340422
|View full text |Cite
|
Sign up to set email alerts
|

Radio resource allocation framework for quality of experience optimization in wireless networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 23 publications
(34 citation statements)
references
References 7 publications
0
34
0
Order By: Relevance
“…In (Fei et al, 2015), the proposed scheduler performs the same first step as the previous solution, i.e., users are served following an MT fashion until all of them have the respective minimum throughput requirement satisfied; afterwards, the remaining resources are allocated in a fair manner such that almost the same quantity is assigned to all users. In (Monteiro et al, 2015), the proposed algorithm serves the users following an MT fashion until a predefined number of users is satisfied by having a QoE equal or greater than a certain threshold (it is assumed that throughput can be mapped into QoE); afterwards, the remaining resources are allocated to the users with the lowest QoE. Rugelj et al (2014) presented a method that searches for the users with the minimum QoE and assigns resources to them; this process is repeated until each user is considered satisfied according to the respective minimum QoE (the authors adopted mapping functions based on throughput plus packet loss regarding video streaming and audio applications, whereas for Web browsing applications the considered relevant parameter was service response time); next, the remaining resources are allocated following an MT fashion, with the proviso that users that achieve a very high satisfaction threshold are excluded from being further served.…”
Section: Other Applicationsmentioning
confidence: 99%
“…In (Fei et al, 2015), the proposed scheduler performs the same first step as the previous solution, i.e., users are served following an MT fashion until all of them have the respective minimum throughput requirement satisfied; afterwards, the remaining resources are allocated in a fair manner such that almost the same quantity is assigned to all users. In (Monteiro et al, 2015), the proposed algorithm serves the users following an MT fashion until a predefined number of users is satisfied by having a QoE equal or greater than a certain threshold (it is assumed that throughput can be mapped into QoE); afterwards, the remaining resources are allocated to the users with the lowest QoE. Rugelj et al (2014) presented a method that searches for the users with the minimum QoE and assigns resources to them; this process is repeated until each user is considered satisfied according to the respective minimum QoE (the authors adopted mapping functions based on throughput plus packet loss regarding video streaming and audio applications, whereas for Web browsing applications the considered relevant parameter was service response time); next, the remaining resources are allocated following an MT fashion, with the proviso that users that achieve a very high satisfaction threshold are excluded from being further served.…”
Section: Other Applicationsmentioning
confidence: 99%
“…Considering the previous example, the system operator can determine that the number of satisfied UEs in VoIP calls is greater than the number of satisfied UE that upload personal files to the server in the cloud. The per‐service minimum satisfaction concept was proposed as a system‐level metric in the work of Furuskär and used in many other works in downlink OFDMA. In the work of Lima et al two distinct RRA problems in uplink SC‐FDMA in a multiservice scenario were proposed: the constrained rate maximization (CRM) and unconstrained rate maximization problems that consist in maximizing the total data rate with and without per‐service minimum satisfaction requirements, respectively.…”
Section: State‐of‐the‐art and Main Contributionsmentioning
confidence: 99%
“…We compare our proposed algorithm (referred to as PM) with a QoE maximizing algorithm, referred to as OSM [7]. OSM is a RA algorithm that maximizes the user QoE through an iterative procedure, which in each iteration allocates enough resources to satisfy a single user, starting from the user with the highest spectral efficiency towards the user with the lowest.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…power allocation, fairness etc. ), without taking into account the impact of their proposals on economic aspects [6], [7]. Two user-oriented joint subcarrier and Power Allocation (PA) algorithms for OFDMA systems are proposed in [6].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation