Service differentiation in broadband wireless access networks with scheduling and connection admission control: a unified analysis

VVe present a unified analytical model for service differentiation in a broadband packet-switched wireless network (e.g., IEEE 802.16) with two types of traffic, namely, the quality-of-service (QoS)-sensitive traffic and the best-effort traffic. While fair scheduling is used to allocate radio resources between these two traffic types, connection admission control (CAC) is employed to limit the number of ongoing connections for QoS-sensitive users so that the performance requirements for the QoS-sensitive traffic can be satisfied. An analytical model is developed assuming a work conserving traffic scheduling in the radio link layer and it also considers multi-rate transmission at the physical layer. Both the packet-level and the connection-level performance measures are obtained. Finally, we apply the concept of utility to obtain user satisfaction as a function of the QoS measures obtained from the analytical model. An optimization formulation is also presented from which the near-optimal solutions for scheduling and CAC parameters can be obtained. The proposed analytical model would be useful for performance analysis and engineering of next-generation broadband wireless networks

[1]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

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

[3]  Kin K. Leung,et al.  Dynamic allocation of downlink and uplink resource for broadband services in fixed wireless networks , 1999, IEEE J. Sel. Areas Commun..

[4]  Symeon Papavassiliou,et al.  Integration of Pricing with Call Admission Control to Meet QoS Requirements in Cellular Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[5]  Georgios B. Giannakis,et al.  Cross-Layer combining of adaptive Modulation and coding with truncated ARQ over wireless links , 2004, IEEE Transactions on Wireless Communications.

[6]  Jon W. Mark,et al.  Resource allocation in wireless networks based on joint packet/call levels QoS constraints , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[7]  Binoy Ravindran,et al.  Time-utility function-driven switched Ethernet: packet scheduling algorithm, implementation, and feasibility analysis , 2004, IEEE Transactions on Parallel and Distributed Systems.

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

[9]  L. F. Turner,et al.  Generalised fsmc model for radio channels with correlated fading , 1999 .

[10]  E. Douglas Jensen Asynchronous Decentralized Real-Time Computer Systems , 2000 .

[11]  Yuguang Fang,et al.  Call admission control schemes and performance analysis in wireless mobile networks , 2002, IEEE Trans. Veh. Technol..

[12]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[13]  Michele Zorzi Packet dropping statistics of a data-link protocol for wireless local communications , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[14]  Romano Fantacci,et al.  Performance evaluation of polling systems for wireless local communication networks , 2000, IEEE Trans. Veh. Technol..

[15]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[16]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[17]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .