We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

The transport of real-time data flows over wireless channels can be optimized by cross-layer schedulers which serve the different users dependent on their traffic load and channel state. This paper investigates the delay performance of a two-stage cross-layer scheduler which has been designed to meet the above requirements. The well-known Weighted Fair Queuing Scheduler can tramsmit packets wit...

This paper presents a study carried out on a Weighted Fair Queuing implementation for Unix routers the WFQ implementation of the ALTQ project. It shows the WFQ/ALTQ weaknesses and explains why we cannot expect an interesting behavior from a system using such a

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

With the advent of the IEEE 802.11 wireless networks that provide high speed connectivity, demand for supporting multiple real-time traffic applications over wireless LANs has been increasing. A natural question is how to provide fair resource allocation to real-time traffic in wireless LANs. Wireless networks are subject to unpredictable location-dependent error bursts, which is different from...

This paper draws on Card’s discussions of moral luck to consider the complicated moral life of people—described as pessimists—who accept the heavy knowledge of the predictability of the bad moral luck of oppression. The potential threat to ethics posed by this knowledge can be overcome by the pessimist whose resistance to oppression, even in the absence of hope, expresses a sense of still havin...

This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).