2008 IEEE Wireless Communications and Networking Conference 2008
DOI: 10.1109/wcnc.2008.354
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Different Scheduling Algorithms for WiMAX Base Station: Deficit Round-Robin vs. Proportional Fair vs. Weighted Deficit Round-Robin

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
32
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(33 citation statements)
references
References 9 publications
1
32
0
Order By: Relevance
“…The UGS class provides a fixed periodic traffic flow with a Constant Bit Rate (CBR) real-time traffic without any form of QoS guarantees. An example of this includes the Voice over Internet Protocol (VoIP) without silence suppression [2,12,[14][15][16][17]. The rtPS class supports real time traffic flow that generates Variable Bit Rate (VBR) with QoS guarantees in a periodical manner.…”
Section: The Scheduling Algorithmsmentioning
confidence: 99%
See 3 more Smart Citations
“…The UGS class provides a fixed periodic traffic flow with a Constant Bit Rate (CBR) real-time traffic without any form of QoS guarantees. An example of this includes the Voice over Internet Protocol (VoIP) without silence suppression [2,12,[14][15][16][17]. The rtPS class supports real time traffic flow that generates Variable Bit Rate (VBR) with QoS guarantees in a periodical manner.…”
Section: The Scheduling Algorithmsmentioning
confidence: 99%
“…The rtPS class supports real time traffic flow that generates Variable Bit Rate (VBR) with QoS guarantees in a periodical manner. An example of such traffic are the Motion Picture Expert Group (MPEG), video conferencing and streaming [2,12,[14][15][16][17]. The nrtPS class is for non-real time VBR traffic with no QoS guarantees (i.e.…”
Section: The Scheduling Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Thus, it is important to take into account the polling mechanisms and also the scheduling mechanisms to guarantee the QoS for the applications. However, most of the previous studies [20][21][22][23] take into account only the scheduling mechanisms. The scheduling algorithm proposed in this study differs from these previous studies mainly because it interacts with the polling mechanisms aiming at adjusting the interval polling dynamically, and then to guarantee the QoS requirements to the real-time and non-real-time applications.…”
Section: Related Workmentioning
confidence: 99%