What question did this study set out to answer?

The aim is to determine how to schedule real-time packets to achieve fairness while maximizing system throughput in the presence of channel errors.

August 25, 2005Open Access

Fair real-time traffic scheduling over a wireless LAN

View Full Paper

Ask AI

Bookmark

The aim is to determine how to schedule real-time packets to achieve fairness while maximizing system throughput in the presence of channel errors.
Simulations comparing four online algorithms: EDF, GDF, EOG, and LFF.
Evaluation of performance in terms of throughput and maximum degradation of service.
Assessment of each algorithm's approach to handling real-time traffic scheduling goals.
LFF performs nearly as well as EDF in maximizing throughput.
LFF outperforms GDF in minimizing maximum degradation.
An optimal polynomial time algorithm exists for the offline version of the scheduling problem.

No takes yet. Share an insight, caveat, or question.

Randomized trial examines packet scheduling algorithms for fairness and throughput in wireless LAN applications, indicating effectiveness.

Adamou et al. (2005) studied this question.

View Full Paper

Ask AI

Bookmark

Randomized trial examines packet scheduling algorithms for fairness and throughput in wireless LAN applications, indicating effectiveness.