Fair scheduling in wireless packet networks | IEEE Journals & Magazine
ieeexplore.ieee.org › document
We describe an ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the ...
The key contributions of this paper are the following: (a) a fair- ness model for wireless fair queueing, (b) the design of an ideal wireless fair queueing ...
Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling ...
We describe an ideal wireless fair scheduling algorithm which provides a packetized implementation of the fluid model while assuming full knowledge of the ...
Essentially, the goal of each of these algorithms is to serve packets in an order that approximates uid fair queueing as closely as possible. At rst glance, it ...
Fair scheduling of delay and rate-sensitive packet ows over a wireless channel is not addressed e ectively by most contemporary wireline fair scheduling ...
The key contributions of this paper are the following: 1) a fairness model for wireless fair queueing; 2) the design of an ideal wireless fair queueing.
People also ask
What are the different types of packet scheduling?
What is packet scheduling in quality of service in computer networks?
In this paper, we propose a new model for wireless fair scheduling based on an adaptation of fluid fair queueing (FFQ) to handle location-dependent error bursts ...
Abstract—We consider the problem of designing a fair sched- uling algorithm for discrete-time constrained queuing networks.
An ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current ...