Comparison of WiMAX scheduling algorithms and proposals for the rtPS QoS class

Belghith, Aymen; Nuaymi, Loutfi

doi:10.1109/ew.2008.4623857

Cited by 57 publications

(43 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since T 2 > F 0.99, 4,36 , assuming H 0 is rejected, i.e there is at least one algorithm whose performance is different from at least one of the other algorithms studied.…”

Section: The Friedman Testmentioning

confidence: 99%

“…The first type of schedulers known as RR, WWR, SP, etc.. The second type of scheduler is proposed specifically for WiMAX networks [4].…”

Section: Scheduling Algorithmmentioning

confidence: 99%

“…They translated the scheduling problem into a stochastic optimization rather than a convex optimization problem. In [22], they proposed a network algorithm that supervises the IPTV access network and determines which type of wireless technology the clients should connect with when using multiband devices, depending on the requirements of the IPTV client device, the available networks, and some network parameters 4 (such as the number of loss packets and packet delay), to provide the maximum Quqlity of Experience (QoE) to the client. The authors in [23] proposed a novel IPTV service based on the concept of content-zapping, in contrast to traditional channel-zapping for the distribution of personalized multimedia contents over IP networks, where each customer system obtains a multimedia streaming that is automatically arranged by the system based on the user selections and the user will only associate with the system by requesting a content change or marking a content as favorite.…”

Section: Scheduling Algorithmmentioning

confidence: 99%

“…The weight adjustment takes into account the basic constraint: W H + W L = 1. Knowing that the weight of two queues is defined by following equations: 4 Where W H is the weight of high priority queue, W L is the weight of low-priority queue, T H refers to the threshold of high priority queue, and NP H refers to the number of packet occupying the HP.…”

Section: Queue Weight Adjustment (Input Scheduler)mentioning

confidence: 99%

See 3 more Smart Citations

An Efficient Study of Scheduling Algorithms with Freidman Test in WiMAX Networks

Brahmia

Syarif

Abouaïssa

et al. 2014

NPA

View full text Add to dashboard Cite

In this paper, we evaluate and compare our scheduling strategy for various IPTV services traffic over 802.16j networks with several scheduling algorithms such as Strict Priority algorithm (SP), Weighted Round Robin (WRR), and Modified Dynamic Weighted Round Robin (MWRR). The proposed scheme adapts dynamically the scheduler operation to according queue load and QoS constraints. In particular, the proposed mechanism gives more priority to HD-TV and SD-TV traffics by using two schedulers. The proposed scheduling algorithm has been simulated using the QualNet network simulator. The Friedman test has been used to address some significant issues of the analysis to compare the proposed scheme with the others scheme. The experimental result and analysis show that the proposed scheduler schemes outperform the traditional scheduling techniques for rtPS traffic that allows ensuring QoS requirements for IPTV application.

show abstract

“…Since T 2 > F 0.99, 4,36 , assuming H 0 is rejected, i.e there is at least one algorithm whose performance is different from at least one of the other algorithms studied.…”

Section: The Friedman Testmentioning

confidence: 99%

“…The first type of schedulers known as RR, WWR, SP, etc.. The second type of scheduler is proposed specifically for WiMAX networks [4].…”

Section: Scheduling Algorithmmentioning

confidence: 99%

Section: Scheduling Algorithmmentioning

confidence: 99%

Section: Queue Weight Adjustment (Input Scheduler)mentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Study of Scheduling Algorithms with Freidman Test in WiMAX Networks

Brahmia

Syarif

Abouaïssa

et al. 2014

NPA

View full text Add to dashboard Cite

show abstract

“…Some works have been published about scheduling algorithms for Wimax but the optimal scheduling algorithm is still in open research area [4], [5] and [7]. In this paper, a new scheduling algorithm is proposed to provide a better allocation of resources to different SSs (subscriber stations) based on their priority and QoS parameters.…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of Scheduling Algorithm for Wimax Networks

Khdhir¹,

Mnif²,

Kamoun³

2013

JACN

View full text Add to dashboard Cite

Adaptive scheduling mechanism for IPTV over WiMAX IEEE 802.16j networks

Brahmia

Abouaïssa

Lorenz

2012

Int J Communication

View full text Add to dashboard Cite

A WiMAX technology is a very promising Broadband Wireless Access technology that is able to transmit different service types. This latter can have different constraints such as traffic rate, maximum latency, and tolerated jitter. The IEEE 802.16 Medium Access Control specifies five types of QoS classes: UGS, rtPS, ertPS, nrtPS, and BE. However, the IEEE 802.16 standard does not specify the scheduling algorithm to be used. Operators have the choice among many existing scheduling techniques. Also, they can propose their own scheduling algorithms. In this paper, we propose a scheduling strategy (Adaptive Weighted Round Robin, AWRR) for various Internet Protocol Television (IPTV) services traffic over 802.16j networks. Our scheme adapts dynamically the scheduler operation to according queue load and quality of service constraints. In particular, the proposed mechanism gives more priority to high definition television and standard definition television traffic by using two schedulers. The proposed scheduling algorithm has been simulated using the QualNet network simulator. The experimental results show that our scheduler schemes AWRR have a better performance than the traditional scheduling techniques for rtPS traffic, which allows ensuring QoS requirements for IPTV application.Unsolicited grant service (UGS): such as T1/E1 transport. It requires reserved traffic rate, maximum latency, and tolerated jitter. Extended real-time polling service (ertPS): such as voice of IP (VoIP). It is built on the efficiency of both UGS and rtPS, reduces overhead and access delay of rtPS, and improves uplink resource utilization of the UGS. As a subcategory of rtPS, ertPS has the same QoS parameters as rtPS in the scheduler design. Real-time polling service (rtPS): such as MPEG audio/video streaming and video conferencing. It supports variable bit rate traffic via minimum reserved and maximum sustained traffic rates and requires tolerable stringent latency constraints. Non-real-time polling service (nrtPS): delay tolerant streams with variable-sized packets, for which only minimum reserved and maximum sustained traffic rates are required, such as File Transfer Protocol (FTP). Best effort (BE) service: such as HTTP and email. BE services are handled on a space available basis and do not require tight latency/jitter constraints, with upper limited bandwidth consumption via maximum sustained traffic rate.

show abstract

Comparison of WiMAX scheduling algorithms and proposals for the rtPS QoS class

Cited by 57 publications

References 9 publications

An Efficient Study of Scheduling Algorithms with Freidman Test in WiMAX Networks

An Efficient Study of Scheduling Algorithms with Freidman Test in WiMAX Networks

Performance Evaluation of Scheduling Algorithm for Wimax Networks

Adaptive scheduling mechanism for IPTV over WiMAX IEEE 802.16j networks

Contact Info

Product

Resources

About