Abstract
Recently, there has been widespread interest in the extension of data networks to the wireless domain. However, scheduling results from the wireline domain do not carry over to wireless systems because wireless channels have unique characteristics not found in wireline channels, namely, limited bandwidth, bursty channel errors and location-dependent channel errors.
In this paper, we study the problem of scheduling multiple real-time streams with deadlines, over a shared channel. We show that, in general, unlike the wireline case, the earliest due date (EDD) or shortest time to extinction (STE) policy is not always the optimal policy, even if the channel state is perfectly known and EDD is implemented only over channels in a “Good” state. Here, optimality is measured with respect to the number of packets lost due to deadline expiry. However, for most values of the channel parameters that are of practical interest, we show through analytical and numerical results that the EDD policy over “Good” channels is nearly optimal. Finally, through simulations, we also show that by combining this policy with fair scheduling mechanisms would result in scheduling algorithms that provide some degree of isolation between the sources as well as provide a natural way of compensating channels that see prolonged error bursts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Bhagwat, P. Bhattacharya, A. Krishna and S. Tripathi, Enhancing throughput over wireless LANs using channel state dependent packet scheduling, in: Proc. IEEE Infocom'97 (April 1997).
V. Bharghavan, A. Demers, S. Shenker and L. Zhang, MACAW: A media access protocol for wireless LANs, in: ACM Sigcomm'94 (1994).
P. Bhattacharya and A. Ephremides, Optimal scheduling with strict deadlines, IEEE Transactions on Automatic Control 34(7) (July 1989).
R. Cruz, A calculus for network delay, Part I: Network elements in isolation, IEEE Transactions on Information Theory 37(1) (January 1991).
A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, Internetworking: Research and Experience 1 (1990) 3–26.
N.G. Duffield, T.V. Lakshman and D. Stiliadis, On adaptive bandwidth sharing with rate guarantees, in: Proc. IEEE Infocom'98 (April 1998).
N. Figueira and J. Pasquale, A schedulability condition for deadline-based service disciplines, IEEE/ACM Transactions on Networking 5(2) (April 1997).
C. Fragouli, V. Sivaraman and M. Srivastava, Controlled multimedia wireless link sharing via enhanced class-based queueing with channel state-dependent packet scheduling, in: Proc. IEEE Infocom'98 (April 1998).
L. Georgiadis, R. Guerin and A. Parekh, Optimal multiplexing on a single link: Delay and buffer requirements, IEEE Transactions on Information Theory 43(5) (September 1997).
S. Golestani, A self-clocked fair queueing scheme for broadband applications, in: Proc. IEEE Infocom'94 (June 1994).
P. Goyal, H. Vin and H. Cheng, Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks, in: Proc. ACM Sigcomm'96 (August 1996).
B. Hajek and P. Seri, On causal scheduling of multiclass traffic with deadlines, in: Proc. IEEE ISIT'98 (August 1998).
W.C. Jakes, Microwave Mobile Communications (IEEE Press, 1993).
G. Koole, Z. Liu and R. Righter, Optimal transmission policies for noisy channels, preprint.
S. Lu, V. Bharghavan and R. Srikant, Fair scheduling in wireless packet networks, in: Proc. ACM Sigcomm'97 (September 1997).
T.S.E. Ng, I. Stoica and H. Zhang, Packet fair queueing algorithms for wireless networks with location-dependent errors, in: Proc. IEEE Infocom'98 (April 1998).
S. Panwar, D. Towsley and J. Wolf, Optimal scheduling policies for a class of queue with customer deadlines to the beginning of services, Journal of ACM 35(4) (1988) 832–844.
A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Transactions on Networking 1(3) (June 1993).
A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE/ACM Transactions on Networking 2(2) (April 1994).
P. Ramanathan and P. Agrawal, Adapting packet fair queueing algorithms to wireless networks, in: Proc. ACM Mobicom'98 (1998).
L. Tassiulas and A. Ephremides, Dynamic server allocation to parallel queue with randomly varying connectivity, IEEE Transactions on Infomation Theory 30(2) (March 1993).
L. Zhang, Virtual clock: A new traffic control algorithm for packet switching networks, ACM Transactions on Computer Systems 9 (May 1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shakkottai, S., Srikant, R. Scheduling Real-Time Traffic With Deadlines over a Wireless Channel. Wireless Networks 8, 13–26 (2002). https://doi.org/10.1023/A:1012763307361
Issue Date:
DOI: https://doi.org/10.1023/A:1012763307361