Abstract
Scheduling algorithms are fundamental components in the process of resource management in mobile communication networks with heterogeneous QoS requirements such as delay, delay jitter, packet loss rate or throughput. The random characteristics of the propagation environment and the use of complex physical layers in order to combat this random behavior further complicates the design of simple, efficient, scalable and fair scheduling algorithms. This paper presents the main criteria used in the design of scheduling algorithms for 3G/4G mobile communications networks and provides a survey of scheduling mechanisms proposed for use in TDMA and CDMA based systems.
Please use the following format when citing this chapter: Ramis, J., Carrasco, L., Femenias, G., Riera-Palau, F., 2007, in IFIP International Federation for Information Processing, Volume 245, Personal Wireless Communications, eds. Simak, B., Bestak, R., Kozowska, E., (Boston: Springer), pp. 264–276.
Chapter PDF
Similar content being viewed by others
Keywords
References
H. Zhang, “Service disciplines for guaranteed performance service in packet switching networks,” Proc. IEEE, vol. 83, no. 10, pp. 1374–1396, 1995.
S. Lu et al., “Fair Scheduling in Wireless Packet Networks,” IEEE/ACM Trans. Networking, vol. 7, no. 4, pp. 473–489, 1999.
D. Liao and L. Li, “Traffic aided fair scheduling using compensation scheme in CDMA cellular networks,” ICC’05, vol. 1, pp. 363–367.
A. Parekh, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344–357, 1993.
A, Deniers et al., “Analysis and Simulation of a Fair Queueing Algorithm,” SIG-COMM’89, pp. 1–12, 1989
J. Bennet and H. Zhang, “WF2Q: Worst-case Fair Weighted Fair Queueing,” IEEE INFOCOM 1996, vol. 1, pp. 120–128, March 1996.
J. Lee et al., “WF2Q-M: a worst-case fair weighted fair queueing with maximum rate control,” IEEE GLOBECOM 2002, vol. 2, pp. 1576–1580, Nov. 2002.
J. Gallardo and D. Makrakis, “Dynamic predictive weighted fair queueing for differentiated services,” IEEE ICC 2001, vol. 8, pp. 2380–2384, June 2001.
J. Bennett and H. Zhang, “Hierarchical packet fair queueing algorithms,” IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 675–689, 1997.
S. Golestani, “A self-clocked fair queueing scheme for broadband applications,” IEEE INFOCOM 1994, vol. 2, pp. 636–646, June 1994.
P. Goyal et al., “Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks,” IEEE/ACM Trans.Networking.,vol.5, no..5, pp.690–704, 1997.
T. Ng et al., “Packet fair queueing algorithms for wireless networks with location-dependent errors,” IEEE INFOCOM 1998, vol. 3, pp. 1103–1111, March-April 1998.
M. Jeong et al., “Wireless packet scheduler for fair service allocation,” IEEE APCC/OECC 1999, vol. 1, pp. 794–797, Oct. 1999.
N. Kim and H. Yoon, “Packet fair queueing algorithms for wireless networks with link level retransmission,” IEEE CCNC 2004, PP122–127, Jan. 2004.
Q. Liu et al., “Cross-layer scheduling with prescribed QoS guarantees in adaptive wireless networks,” IEEE JSAC, vol. 23, no. 5, pp. 1056–1066, 2005.
L. Xu et al., “Dynamic Fair Scheduling With QoS Constraints in Multimedia Wideband CDMA Cellular Networks,” IEEE Trans. Wireless Com., vol.3, no.l, pp.60–73, 2004.
M. Arad and A. Leon-Garcia, “A generalized processor sharing approach time to scheduling in hybrid CDMA/TDMA,” IEEE INFOCOM 1998, vol. 3, pp.1164–1171.
X. Wang, “An FDD Wideband CDMA MAC Protocol with Minimum-Power Allocation and GPS-Scheduling for Wireless Wide Area Multimedia Networks,” IEEE Trans. Mobile Comp., vol.4, no. 1, pp. 16–28, 2005.
L. Wang et al., “Channel Adaptive Fair Queueing for Scheduling Integrated Voice and Data Services in Multicode CDMA Systems,” IEEE WCNC 2003, vol. 3, pp. 1651–1656, March 2003.
A. Stamoulis et al.,“Time-varying fair queueing scheduling for multicode CDMA based on dynamic programming,” IEEE Trans. Wireless Com., vol.3, no.2, pp.512–523, 2004.
G. Song and Y. Li, “Cross-layer optimization for OFDM wireless networks. Part I: Theoretical framework,” IEEE Trans. Wireless Com., vol.4, no.2, pp. 614–624, 2005.
W. Zhao and M. Lu, “CDMA downlink rate allocation for heterogeneus traffic based on utility function: GA-SA approach,” CNSR’04, pp. 156–162, May 2004.
G. Song, “Utility-based resource allocation and scheduling inOFDM-based wireless broadband networks,” IEEE Commun. Magazine, pp. 127–134, 2005.
X. Duan et al., “A dynamic power and rate joint allocation algorithm for mobile multimedia DS-CDMA networks based on utility functions,” PIMRC02, vol. 3, pp. 1107–1111, Sept. 2002.
G. Song and Y. Li, “Cross-layer optimization for OFDM wireless networks. Part II: algorithm development,” IEEE Trans. Wireless Com., vol.4, no.2, pp.625–634, 2005.
A. Jalali et al., “Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system,” IEEE VTC’00, vol. 3, pp. 1854–1858, May.
G. Barriac and J. Holtzman, “Introducing Delay Sensitivity into the Proportional Fair Algorithm for CDMA Downlink Scheduling,” IEEE ISSSTA’ 02, vol.3, pp.652–656.
H. Koto et al., “Scheduling Algorithm based on Sender Backlog for Real-Time Application in Mobile Packet Networks,” IEEE WCNC dy2005, vol. 1, pp. 151–157.
S. Shen and C. Chang, “A utility-based scheduling algorithm with differentiated QoS provisioning for multimedia CDMA cellular networks,” in VTC’04 Spring, vol.3, pp. 1421–1425.
K. Johnsson and D. Cox, “An adaptive cross-layer scheduler for improved QoS support of multiclass data services on wireless systems,” IEEE JSAC, vol. 23, no.2, pp. 334–343, Feb. 2005.
W. Wong et al., “Soft QoS provisioning using the token bank fair queuing scheduling algorithm,” IEEE Wireless Commun,, vol. 10, no. 3, pp. 8–16, 2003.
A. Kam et al., “Supporting Rate Guarantee and Fair Access for Bursty Data Traffic in W-CDMA,” IEEE JSAC, vol. 19, no. 11, pp. 2121–2130, 2001.
Q. Pang et al., “Service scheduling for general packet radio service classes,” IEEE WCNC 1999, vol. 3, pp. 1229–1233, Sept. 1999.
V. Huang et al., “QoS-Oriented Packet Scheduling for Wireless Multimedia CDMA Communications,” IEEE Trans. Mobile Comp., vol. 3, no. 1, pp. 73–85, 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 International Federation for Information Processing
About this paper
Cite this paper
Ramis, J., Carrasco, L., Femenias, G., Riera-Palou, F. (2007). Scheduling algorithms for 4G wireless networks. In: Bestak, R., Simak, B., Kozlowska, E. (eds) Personal Wireless Communications. IFIP — The International Federation for Information Processing, vol 245. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74159-8_25
Download citation
DOI: https://doi.org/10.1007/978-0-387-74159-8_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74158-1
Online ISBN: 978-0-387-74159-8
eBook Packages: Computer ScienceComputer Science (R0)