This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Non-Real-Time Content Scheduling Algorithms for Wireless Data Networks
July 2006 (vol. 55 no. 7)
pp. 893-905
A substantial portion of the emerging wireless data service consists of non-real-time applications such as content download. The existing mechanisms based on per-packet performance guarantees used mainly for voice and streaming media do not suffice for the elastic nature of non-real-time traffic. For a non-real-time user data services, the key performance measure of interest is the total download time. In this paper, we propose a novel scheduling framework for wireless content service. Specifically, we present a two-layer scheduling architecture that combines content-aware scheduling with opportunistic scheduling. In terms of content-awareness, the proposed scheduling policy provides guarantees on the download time of content. In the second stage, the instantaneous channel conditions of different users are exploited in an opportunistic manner so as to maximize the throughput of the system. We define service differentiation in two modes—differential and guaranteed—and provide polynomial time algorithms for both that manipulate the stretch ratio but within allowable limits. Extensive simulations are conducted that verify the efficiency of the proposed schemes and provide insights into the behavior of the scheduling algorithms for non-real-time data.

[1] http:/www.3gpp.org, 2006.
[2] http:/www.3gpp2.org, 2006.
[3] 3GPP TR25.848 V0.5.0, “Physical Layer Aspects of UTRA High Speed Downlink Packet Access (HSDPA),” ANNEX B, TSGR1#18(01)186, Jan. 2001.
[4] ETSI, UMTS TR101 112, “Selection Procedures for the Choice of Radio Transmission Technologies of the UMTS,” 2004.
[5] L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti, S. Muthukrishnan, and T. Nandagopal, “Parallel Scheduling Problems in Next Generation Wireless Networks,” Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 238-247, Aug. 2002.
[6] P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi, “CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users,” IEEE Comm. Magazine, pp. 70-77, July 2000.
[7] M. Bender, S. Chakrabarti, and S. Muthukrishnan, “Flow and Stretch Metrics for Scheduling Continuous Job Streams,” Proc. ACM Symp. Discrete Algorithms, pp. 270-279, 1998.
[8] S. Borst, “User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks,” Proc. IEEE Infocom, pp. 636-647, 2003.
[9] C. Dovrolis and P. Ramanathan, “A Case for Relative Differentiated Services and the Proportional Differentiation Model,” IEEE Network, vol. 13, no. 5, pp. 26-34, Sept. 1999.
[10] K. Enoki, “I-Mode: The Mobile Internet Service of the 21st Century,” IEEE Int'l Solid-State Circuits Conf. (ISSCC), Digest of Technical Papers, pp. 12-15, 2001.
[11] S. Ganguly, N. Tu, M. Chatterjee, and R. Izmailov, “Non-Real Time Content Scheduling in Wireless Data Networks,” Proc. IEEE Int'l Symp. Personal, Indoor, and Mobile Radio Comm. (PIMRC), vol. 2, pp. 1375-1379, Sept. 2004.
[12] J. Gehrke, S. Muthukrishnan, R. Rajaraman, and A. Shaheen, “Scheduling to Minimize Average Stretch,” Technical Report 99-2, DIMACS, Rutgers Univ., 1999.
[13] H. Kushner and P. Whiting, “Asymptotic Properties of Proportional-Fair Sharing Algorithms,” Proc. 40th Ann. Allerton Conf. Comm., Control, and Computing, 2002.
[14] N. Joshi, S. Kadaba, S. Patel, and G. Sundaram, “Downlink Scheduling in CDMA Data Networks,” Proc. ACM Mobicom, pp. 179-190, 2000.
[15] A. Konrad, B. Zhao, A. Joseph, and R. Ludwig, “A Markov-Based Channel Model Algorithm for Wireless Networks,” Wireless Networks, vol. 9, no. 3, pp. 189-199, May 2003.
[16] Y. Liu and E. Knightly, “Opportunistic Fair Scheduling over Multiple Wireless Channels,” Proc. Ann. Joint Conf. IEEE Computer and Comm. Soc. (IEEE INFOCOM), vol. 2, pp. 1106-1115, 2003.
[17] X. Liu, E.P.K. Chong, and N.B. Shroff, “Opportunistic Transmission Scheduling with Resource-Sharing Constraints in Wireless Networks,” IEEE J. Selected Areas in Comm. (JSAC), vol. 19, no. 10, pp. 2053-2064, Oct. 2001.
[18] P. Marbach, “Pricing Differentiated Services Networks: Bursty Traffic,” Proc. IEEE Infocom, pp. 650-658, 2001.
[19] H. Ming, Z. Junshan, and J. Sadowsky, “Traffic Aided Opportunistic Scheduling for Downlink Transmissions: Algorithms and Performance Bounds,” Proc. Ann. Joint Conf. IEEE Computer and Comm. Soc. (IEEE INFOCOM), vol. 3, pp. 1652-1661, 2004.
[20] S. Parkvall, E. Dahlman, P. Frenger, P. Beming, and M. Persson, “The Evolution of WCDMA towards Higher Speed Downlink Packet Data Access,” Proc. IEEE Vehicular Technology Conf. (VTC), vol. 3, pp. 2287-2291, 2001.
[21] S. Souissi and S.B. Wicker, “A Diversity Combining DS/CDMA System with Convolutional Encoding and Viterbi Decoding,” IEEE Trans. Vehicular Technology, vol. 44, no. 2, pp. 304-312, May 1995.
[22] A. Varga, “The OMNeT++ Discrete Event Simulation System,” Proc. European Simulation Multiconf. (ESM 2001), 2001, http://www.hit.bme.hu/phd/vargaaomnetpp.htm .
[23] D. Verma, Content Distribution Networks: An Engineering Approach, first ed. John Wiley & Sons, 2001.
[24] P. Viswanath, D. Tse, and R. Laroia, “Opportunistic Beamforming Using Dumb Antennas,” IEEE Trans. Information Theory, vol. 48, pp. 1277-1294, 2002.
[25] H. Zhu, H. Tang, and T. Yang, “Demand-Driven Service Differentiation for Cluster-Based Network Servers,” Proc. IEEE Infocom, pp. 679-688, 2001.

Index Terms:
Service differentiation, stretch, non-real-time traffic, optimization, deadline scheduling.
Citation:
Samrat Ganguly, Mainak Chatterjee, Rauf Izmailov, "Non-Real-Time Content Scheduling Algorithms for Wireless Data Networks," IEEE Transactions on Computers, vol. 55, no. 7, pp. 893-905, July 2006, doi:10.1109/TC.2006.106
Usage of this product signifies your acceptance of the Terms of Use.