2014
DOI: 10.1186/1687-1499-2014-104
|View full text |Cite
|
Sign up to set email alerts
|

QoS-aware dynamic resource allocation for wireless broadband access networks

Abstract: The development of the advanced wireless access technologies is focusing on the enhancement of mobile user satisfaction in terms of quality of service (QoS). As the number of mobile users increases, the amount of traffic passing through base station (BS) significantly increases so that the preplanned capacity of downlink or uplink can be exceeded from time to time resulting in the degradation of users' QoS satisfaction. A way to utilize the downlink (DL) and the uplink (UL) of an orthogonal frequency division … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…So convergence is rather slow, and unaware of immediate traffic pattern changes. In Nguyen, scheduling through priority queue size for reserved traffic is used, but shows only 5% improvement. In Chiang et al, frame split ratio has been derived by using TCP/IP flow parameters.…”
Section: Literature Review and Motivationmentioning
confidence: 99%
“…So convergence is rather slow, and unaware of immediate traffic pattern changes. In Nguyen, scheduling through priority queue size for reserved traffic is used, but shows only 5% improvement. In Chiang et al, frame split ratio has been derived by using TCP/IP flow parameters.…”
Section: Literature Review and Motivationmentioning
confidence: 99%
“…This optimization scheme aims to find the best slot solution for the WiMAX's UL-MAP [17]. A detailed description of GRA-MAKA is as follows.…”
Section: Proposed Gramakamentioning
confidence: 99%
“…1 n ← number of connection queues 2 q i,k ← current connection of queue i at round k 3 w i,k ← dynamic weight counter of queue i at round k 4 Figure 3 shows that the LAWRR scheduler has dynamically adjusted the static weight for q 1,1 and q 2,1 according to their traffic load characteristics. After assigning a dynamic weight to the weight counter, LAWRR begins serving each queue starting from the head of the first queue to the last queue.…”
Section: Algorithm 1: Lawrr Schedulingmentioning
confidence: 99%