A Deficit Round Robin with Fragmentation scheduler for IEEE 802.16e Mobile WiMAX

So-In, Chakchai; Jain, Raj; Al-Tamimi, Abdel-Karim

doi:10.1109/sarnof.2009.4850308

Cited by 13 publications

(24 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the former tries to solve the scheduling algorithms inside one class of service, the latter deals with scheduling of different service classes. In this paper, we focus on intra-class channelunaware resource allocation strategies and mainly on DRR with fragmentation due to its perfect throughput fairness with support of variable length packets together with a rather simple implementation [4], [6], [7]. In addition, as mentioned in [4], DRR can exhibit O(1) processing work per packet.…”

Section: A Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Analysis of deficit round robin scheduling for future aeronautical data link

Ayaz

Hoffmann

German³

et al. 2011

2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

Abstract-The aviation community is currently working on the standardization of data communication systems for the future air traffic management. In this context, the International Civil Aviation Organization (ICAO) has initiated a work on standardization of an IPv6-based aeronautical telecommunications network and on future radio access technologies, respectively. In this paper, we integrate L-Band Digital Aeronautical Communications System Option 1 (L-DACS 1), which is one candidate for future radio access technologies, with realistic IPv6-based network layer functionality and analyze Deficit Round Robin (DRR) with fragmentation algorithm for the forward and return link in L-DACS 1. Our analysis mainly covers two application domains: file transfer and real-time services. We show that DRR with fragmentation scheduler provides good performance results in terms of throughput, delay, and bandwidth fairness.

show abstract

Section: A Related Workmentioning

confidence: 99%

“…The original DRR algorithm is proposed by [4] and the modified version which supports fragmentation is proposed by [6] 2 . According to [4], when a packet arrives to the queues, its flow number is checked first.…”

Section: Drr Modificationsmentioning

confidence: 99%

Analysis of deficit round robin scheduling for future aeronautical data link

Ayaz

Hoffmann

German³

et al. 2011

2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

show abstract

“…The second algorithm, DRR [24], avoids packet fragmentation by scheduling only a full packet. If a packet will result in exceeding the fair share, the packet is not scheduled and the deficit (amount that would have been allocated) is remembered.…”

Section: ) Deficit Round Robin (Drr)mentioning

confidence: 99%

“…If a packet will result in exceeding the fair share, the packet is not scheduled and the deficit (amount that would have been allocated) is remembered. However, to fully utilize a WiMAX frame, we use a modified version of DRR, DRR with fragmentation described in [24]. In general, if a packet meets the fair share limit, we schedule it in the current WiMAX frame and if necessary, allow the part that will not fit in the current WiMAX frame to be scheduled in the next frame.…”

Section: ) Deficit Round Robin (Drr)mentioning

confidence: 99%

Modeling and resource allocation for mobile video over WiMAX broadband wireless networks

Al-Tamimi

So-In

Jain

2010

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

“…The Deficit Round Robin with Fragmentation (DRRF) [6] scheduling algorithm is a potential algorithm that can be used to allocate the resources in IEEE 802.16e Mobile WiMAX networks. The DRRF is similar to a traditional deficit round robin algorithm or DRR [8] in that it is used to maintain the throughput fairness over a long period of time.…”

Section: Example Modifications To a Scheduling Algorithmmentioning

confidence: 99%

Generalized Weighted Fairness and its application for resource allocation in IEEE 802.16e Mobile WiMAX

So-In

Jain

Al-Tamimi

2010

2010 the 2nd International Conference on Computer and Automation Engineering (ICCAE)

Self Cite

View full text Add to dashboard Cite

In wireless networks, the definition of fair resource allocation is ambiguous because the wireless channel condition is not constant over time and location. Two main ways to define fair resource allocation are: by number of allocated service time units per user, temporal fairness, or the number of transmitted bytes per user, throughput fairness. In wireless broadband networks i.e., IEEE 802.16e Mobile WiMAX, the quality of services offered by service providers is associated with the price paid. Similar to a traditional cellular phone system, the users may be required to pay air-time charges. The throughput fairness is favorable to customers with a poor channel condition or those at a far distance. The temporal fairness will be preferred by the customers near the base stations and with good channel condition. In this paper, we define the Generalized Weighted Fairness (GWF) criterion that allows carriers to implement and apply either of the two fairness criteria to a Mobile WiMAX environment. In addition, we show how a scheduling algorithm can use the GWF criterion to achieve a general weighted fair resource allocation in IEEE 802.16e Mobile WiMAX networks. We use Deficit Round Robin with Fragmentation (DRRF) as an example of a scheduling algorithm. Numerical and simulation results are presented to demonstrate the effect of GWF.

show abstract

A Deficit Round Robin with Fragmentation scheduler for IEEE 802.16e Mobile WiMAX

Cited by 13 publications

References 4 publications

Analysis of deficit round robin scheduling for future aeronautical data link

Analysis of deficit round robin scheduling for future aeronautical data link

Modeling and resource allocation for mobile video over WiMAX broadband wireless networks

Generalized Weighted Fairness and its application for resource allocation in IEEE 802.16e Mobile WiMAX

Contact Info

Product

Resources

About