2013
DOI: 10.12691/ajeee-1-1-1
|View full text |Cite
|
Sign up to set email alerts
|

A Cross-Layer Qos Based Scheduling Algorithm WRR Design in Wimax Base Stations

Abstract: The IEEE 802.16 standard defines a wireless broadband access network technology called Wimax. It introduces several advantages, one of which is the support for Quality of Service (QoS) at the MAC level. To ensure meeting the QoS requirements, the 802.16 base stations must run some algorithms to allocate slots between connections. Call admission and scheduling are the strongest tools in our hand to ensure QoS. We propose an efficient design architecture that is capable of allocating slots based on the QoS requi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…In [13], [14], [20] & [21] WRR procedure, packets are categorized into different service classes and then assigned to a queue that can be assigned different percentage of bandwidth and served based on Round Robin order as shown in Figure 4. This algorithm address the problem of starvation by guarantees that all service classes have the ability to access at least some configured amount of network bandwidth.…”
Section: Weighted Round Robin (Wrr)mentioning
confidence: 99%
See 1 more Smart Citation
“…In [13], [14], [20] & [21] WRR procedure, packets are categorized into different service classes and then assigned to a queue that can be assigned different percentage of bandwidth and served based on Round Robin order as shown in Figure 4. This algorithm address the problem of starvation by guarantees that all service classes have the ability to access at least some configured amount of network bandwidth.…”
Section: Weighted Round Robin (Wrr)mentioning
confidence: 99%
“…It is noted that WRR technique shows the most favorable results as the average jitter has low reading (0.136s). [21] Says WRR is very useful algorithm for which the scheduler uses it only for one time. But when the case of hierarchy of WRR then it is challenging task to use because the peer-connection QoS requirements must be translated into scheduler at each level and when the network is dynamic, buffer length & trade-off between the throughput and queue delay is difficult to control.…”
Section: Fig 4: [25] Wrr Scheduling Algorithmmentioning
confidence: 99%