Abstract
A wide range of emerging real-time services (e.g. VoIP, video conferencing, video-on-demand) require different levels of Quality of Services (QoS) guarantees over wireless networks. Scheduling algorithms play a key role in meeting these QoS requirements. A distinction of QoS guarantees is made between deterministic and statistical guarantees. Most of research in this area have been focused on deterministic delay bounds and the statistical bounds of differentiated real-time services are not well known. This paper provides the mathematical analysis of the statistical delay bounds of different levels of Constant Bit Rate (CBR) traffic under First Come First Served with static priority (P-FCFS) scheduling. The mathematical results are supported by the simulation studies. The statistical delay bounds are also compared with the deterministic delay bounds of several popular rate-based scheduling algorithms. It is observed that the deterministic bounds of the scheduling algorithms are much larger than the statistical bounds and are overly conservative in the design and analysis of efficient QoS support in wireless access systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
ITU Study Group 13, Traffic Control and Congestion Control in B-ISDN, Draft Recommendation I.371 (May 1996)
ATM Forum, ATM User-network Interface Specification, Version 3.1 (September 1994)
ATM Forum, Traffic Management Specification, Version 4.0 (February 1996)
Parekh, A.K., Gallerger, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Casde. IEEE/ACM Transaction on Networking 1(3) (1993)
Golestani, S.J.: A Self-Clocked Fair Queueing Scheme for Broadband Applications. In: Proceedings of IEEE INFOCOM (1994)
Stiliadis, D., Varma, A.: Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms. IEEE/ACM Transactions on Networking 6(5) (1998)
Goyal, P., Vin, H.M., Cheng, H.: Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks Technical Report TR-96-02, Department of Computer Sciences, The University of Texas at Austin (January 1996)
Lu, S., Raghunathan, V., Srikant, R.: Fair Scheduling in Wireless Packet Networks. IEEE/ACM Trans. Network 7(4), 473–489 (1999)
Raghunathan, V., Ganeriwal, S., Srivastava, M., Schurgers, C.: Energy Efficient Wireless Packet Scheduling and Fair Queueing. ACM Trans. Embedded Comput. Sys. 391, 3–23 (2004)
Mercankosk, G.: Mathematical Preliminaries for Rate Enforced ATM Access, Technical Memorandum of Australian Telecommunications Research Institute (ATRI), NRL-TM-071 (July 1995)
Roberts, J.W.: Performance evaluation and Design of Multiserverce Networks, Final Report of Management Committee of COST 224 Project (1992)
Humblet, P., Bhargava, A., Hluchyj, M.G.: Ballot Theorems Applied to the Transient Analysis of nD/D/1 Queues. IEEE/ACM Transactions on Networking 1(1) (1993)
Mercankosk, G., Budrikis, Z.L.: Establishing a Real-Time VBR Connection over an ATM Network. In: IEEE GLOBECOM 1996, pp. 1710–1714 (1996)
Mercankosk, G.: Access Delay Analysis for Extended Distributed Queueing Technical Memorandum of Australian Telecommunications Research Institute (ATRI), NRL-TM-022 (July 1995)
Zhou, H.: Real-Time Services over High Speed Networks Ph.D thesis, Curtain University of Technology (2002)
Iida, K., Takine, T., Sunahara, H., Oie, Y.: Delay Analysis for CBR Traffic Under Static-Priority Scheduling. IEEE/ACM Transactions on Networking 9(2) (April 2001)
Wongthavarawat, K., Ganz, A.: Packet Scheduling for QoS Support in IEEE 802.16 Broadband Wireless Access Systems. International Journal of Communication Systems (2003)
IEEE 802.16 Standard, Local and Metropolitan Area Networks, Part 16 IEEE Draft P802.16-14
Georgiadis, L., Guerin, R., Parekh, A.: Optimal Multiplexing on A Single Link: Delay and Buffer Requirements. In: Proceedings of IEEE INFOCOM 1994, vol. 2 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, H., Zhang, Z. (2011). Examining QoS Guarantees for Real-Time CBR Services in Broadband Wireless Access Networks. In: Lee, R. (eds) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2011. Studies in Computational Intelligence, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22288-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-22288-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22287-0
Online ISBN: 978-3-642-22288-7
eBook Packages: EngineeringEngineering (R0)