2010
DOI: 10.1109/surv.2010.033010.00038
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling and CAC in IEEE 802.16 Fixed BWNs: A Comprehensive Survey and Taxonomy

Abstract: IEEE 802.16 technology has emerged as a competitive alternative to wireline broadband access solution. IEEE 802.16 can provide quality of service (QoS) guarantees for heterogeneous classes of traffic with different QoS requirements. The standard, however, leaves open the resource management and scheduling issues, which are crucial components to guarantee QoS performance. The main objective of this paper is to provide a better understanding of the missing components to ensure QoS support in IEEE 802.16 fixed br… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 74 publications
0
6
0
Order By: Relevance
“…The authors in (Msadaa et al, 2010) also classify the algorithms into three categories: algorithms based on packet queuing, algorithms based on optimization strategies and crosslayer algorithms. The scheduling strategy based on queuing packet has the same characteristics of the algorithms developed for wired networks.…”
Section: Fig 3 General Classification Of Wimax Scheduling Mechanismsmentioning
confidence: 99%
“…The authors in (Msadaa et al, 2010) also classify the algorithms into three categories: algorithms based on packet queuing, algorithms based on optimization strategies and crosslayer algorithms. The scheduling strategy based on queuing packet has the same characteristics of the algorithms developed for wired networks.…”
Section: Fig 3 General Classification Of Wimax Scheduling Mechanismsmentioning
confidence: 99%
“…This stage can be characterized according to the number of scheduling levels. Typically, an one-level structure, with a single queuing discipline that attends all scheduling services, is used [7]. However, such structure is usually devoted to a specific problem and ignores the assembly of the OFDMA frame.…”
Section: A Scheduling Proposalsmentioning
confidence: 99%
“…• PD i : polling delay corresponds to the interval time when the bandwidth is requested and when it is allocated [14]. This parameter is dependent on the number of rtPS connections.…”
Section: Ensuring Limited Maximum Delay For Rtps Servicementioning
confidence: 99%
“…The algorithm calculates a deadline for each rtPS connection (line 10) as defined in expression (1). After this, it sorts the rtPS connections by the lowest deadline (lines [13][14][15][16][17][18][19]. Thus, it is possible to minimize the delay existent at the access network by the use of various MCSs.…”
Section: Ensuring Limited Maximum Delay For Rtps Servicementioning
confidence: 99%