Skip to main content
Article
Size Matters: Size-based Scheduling for MPEG-4 over Wireless Channels
Real-Time and Embedded Systems Lab (mLAB)
  • Rahul Mangharam, University of Pennsylvania
  • Mustafa Demirhan, Rutgers University - New Brunswick/Piscataway
  • Ragunathan Rajkumar, Carnegie Mellon University
  • Dipankar Raychaudhuri, Rutgers University - New Brunswick/Piscataway
Document Type
Conference Paper
Date of this Version
1-1-2004
Comments
Suggested Citation:
R. Mangharam, M. Demirhan, R. Rajkumar, and D. Raychaudhuri, Size matters: Size-based scheduling for MPEG-4 over wireless channels. SPIE & ACM Proceedings in Multimedia Computing and Networking. Vol. 3020 pp. 110-122. San Jose, CA, January 2004.

Copyright 2004 Society of Photo-Optical Instrumentation Engineers. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited. http://dx.doi.org/10.1117/12.538820
Abstract

For bursty traffic with a large peak-to-average ratio and a stochastic channel, is it possible to minimize the response time of every flow while maximizing the effective channel utilization and maintain fairness? This is the question we address in this paper. In wireless networks with a single shared channel, channel arbitration is a core issue for flows with throughput and timeliness requirements on the uplink and peer-to-peer links where the instantaneous demand is not known. This paper presents a link layer frame scheduling algorithm for delay-sensitive variable bit rate traffic, such as high-rate multimedia (MPEG-4), over a wireless channel. We evaluate our scheduling algorithm over two Medium Access Control (MAC) architectures and compare it to four scheduling strategies that cover a range of classes: TDMA, proportional share algorithms, real-time scheduling algorithms, and size-based scheduling algorithms. Detailed simulation results, with full-length MPEG-4 movie traces over a fading wireless channel, show that Fair-Shortest Remaining Processing Time (Fair-SRPT) outperforms other algorithms in terms of QoS performance, channel utilization efficiency and response time under all utilization levels and channel error rates. Our Fair-SRPT scheme avoids the classical SRPT problems of preferring small jobs by using normalization to mean reservations. An attractive feature of the proposed approach is that it can be implemented with no modifications to the IEEE 802.11e and IEEE 802.15.3 high-rate personal area network standards.

Keywords
  • Scheduling Algorithms for Embedded Wireless Networks
Citation Information
Rahul Mangharam, Mustafa Demirhan, Ragunathan Rajkumar and Dipankar Raychaudhuri. "Size Matters: Size-based Scheduling for MPEG-4 over Wireless Channels" (2004)
Available at: http://works.bepress.com/rahul_mangharam/36/