On admission control and scheduling of multimedia burst data for CDMA systems

Authors:
Yu-Kwong Kwok;Vincent K. N. Lau
Affiliations:
The University of Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong
Venue:
Wireless Networks
Year:
2002

Citing 6
Cited 2

CDMA: principles of spread spectrum communication

CDMA: principles of spread spectrum communication
Evolution of wireless data services: IS-95 to cdma2000

IEEE Communications Magazine
Adaptation techniques in wireless packet data services

IEEE Communications Magazine
Common packet data channel (CPDC) for integrated wireless DS-CDMA networks

IEEE Journal on Selected Areas in Communications
Access control of data in integrated voice/data CDMA systems: benefits and tradeoffs

IEEE Journal on Selected Areas in Communications
High data-rate packet communications for cellular networks using CDMA: algorithms and performance

IEEE Journal on Selected Areas in Communications

ARC: an integrated admission and rate control framework for CDMA data networks based on non-cooperative games

Proceedings of the 9th annual international conference on Mobile computing and networking
ARC: An Integrated Admission and Rate Control Framework for Competitive Wireless CDMA Data Networks Using Noncooperative Games

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to support transmissions of multimedia data (high data rate and burst) with performance guarantees in a wideband CDMA system, it is crucial to design a judicious algorithm for burst data admission control and scheduling. However, in the current literature there are only simple techniques (such as first-come-first-served and equal sharing) suggested for tackling the problem. Indeed, these existing schemes are not designed for optimizing the precious bandwidth resources while providing performance guarantees (e.g., a user admitted with a certain data rate can enjoy the assigned rate without interruption). In this paper, we first present our novel integer programming formulation of the burst data admission control and scheduling problem. The objective of the optimization can be maximizing the utilization of the bandwidth resources or minimizing the delays of the user transmissions. Taking into account all the important factors such as mobility, power control, and soft handoff, our formulation induces an algorithm for generating an optimal admission control solution which consists of: (1) the burst data rate (in terms of the number of channels); (2) the burst duration; and (3) the burst start time. For practical implementation, we also suggest a near-optimal version of the algorithm, which is evaluated via static and dynamic simulations, and comparisons with two existing schemes.