Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not
addressed effectively by most contemporary wireline fair-scheduling algorithms because of …

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not
addressed effectively by most contemporary wireline fair scheduling algorithms because of …

Fair queueing in the wireless domain poses significant challenges due to the unique issues
in the wireless channel such as location-dependent and bursty channel error. In this paper …

Fair queuing has long been a popular paradigm for providing bounded delay channel
access and separation between flows in wireline networks. However, adapting fair queuing …

We present wireless credit-based fair queuing (WCFQ), a new scheduler for wireless packet
networks with provable statistical short-and long-term fairness guarantees. WCFQ exploits …

While packet scheduling for wired links is a maturing area, scheduling of wireless links is
less mature. A fundamental difference between wired and wireless links is that wireless …

Abstract Parames~ varan Ramana. tllan Pratbinla t\graIval Dept. of Elect. & Comp. Engr. I [)
ter]~ et. ArcIl. Research Lab University of Wisconsin Bellcore, hIorristotvn Nladison, WI …

We consider the problem of allocating resources (time slots, frequency, power, etc.) at a
base station to many competing flows, where each flow is intended for a different receiver …

In this paper we outline a scheme to perform packet-level scheduling and resource
allocation at the wireless node that takes into account the notions of both efficiency and …

While packet fair queueing (PFQ) algorithms provide both bounded delay and fairness in
wired networks, they cannot be applied directly to wireless networks. The key difficulty is that …