Examining QoS Guarantees for Real-Time CBR Services in Broadband Wireless Access Networks

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.

[1]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[2]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.

[4]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[5]  Atm Forum.  ATM user-network interface (UNI) specification : version 3.1 , 1993 .

[6]  J. W. Roberts,et al.  Performance evaluation and design of multiservice networks , 1992 .

[7]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[8]  Guven Mercankosk,et al.  Establishing a real time VBR connection over an ATM network , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[9]  Aura Ganz,et al.  Packet scheduling for QoS support in IEEE 802.16 broadband wireless access systems , 2003, Int. J. Commun. Syst..

[10]  Pierre A. Humblet,et al.  Ballot theorems applied to the transient analysis of nD/D/1 queues , 1993, TNET.

[11]  Katsuyoshi Iida,et al.  Delay analysis for CBR traffic under static-priority scheduling , 2001, TNET.

[12]  William Stallings,et al.  Local and Metropolitan Area Networks , 1993 .

[13]  Mani B. Srivastava,et al.  Energy efficient wireless packet scheduling and fair queuing , 2004, TECS.

[14]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.