On Delay-Bounded Multimedia Internet-Call Access Control in a WCDMA Common Channel

We address call access control in the Wideband Code Divisional Multiple Access (WCDMA) downlink common channels. Proposed is a policy consisting of two phases, the first screening calls for admission, and the second scheduling call services according to the most popular preemptive FIFO rule. The scheduling mechanism is first depicted on the infinite vertical time-strip with width representing the aggregate capacity of common channels, by denoting a call service as positioning the corresponding call-rectangle thereon. Enabled by this depiction, we apply the existing results on the two-dimensional (2-D) bin packing problem in predicting the sojourn time of an arriving call. The first phase of call admission control is based on the predictions, from the characteristics of which calls, once admitted, are guaranteed to be serviced within allowable delay. The performance of the proposed access control policy is extensively tested with realistic input data. The results are found convincingly affirmative for its practical applicability

[1]  Prathima Agrawal,et al.  Admission and flow control for multimedia CDMA , 2000, 2000 IEEE International Conference on Multimedia and Expo. ICME2000. Proceedings. Latest Advances in the Fast Changing World of Multimedia (Cat. No.00TH8532).

[2]  Edward G. Coffman,et al.  A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation , 1982, J. Algorithms.

[3]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[4]  Cristina Comaniciu,et al.  QoS guarantees for third generation (3G) CDMA systems via admission and flow control , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[5]  Alexander L. Stolyar,et al.  Scheduling algorithms for a mixture of real-time and non-real-time data in HDR , 2001 .

[6]  Yoshihiro Ishikawa,et al.  Capacity Design and Performance of Call Admission Control in Cellular CDMA Systems , 1997, IEEE J. Sel. Areas Commun..

[7]  Fei Hu,et al.  Multimedia call admission control in mobile networks: a dynamical reservation-pool approach , 2003, Comput. Networks.

[8]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[9]  Kiseon Kim,et al.  QoS-sensitive admission policy for non-real-time data packets in voice/data integrated CDMA systems , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  Bo Li,et al.  A dynamic call admission policy with precision QoS guarantee using stochastic control for mobile wireless networks , 2002, TNET.

[11]  Te-Kai Liu,et al.  Joint admission/congestion control for wireless CDMA systems supporting integrated services , 1998, IEEE J. Sel. Areas Commun..

[12]  Antti Toskala,et al.  Wcdma for Umts , 2002 .

[13]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[14]  Mark Crovella,et al.  Characteristics of WWW Client-based Traces , 1995 .

[15]  Vincent K. N. Lau,et al.  On Admission Control and Scheduling of Multimedia Burst Data for CDMA Systems , 2002 .

[16]  Huai-Rong Shao,et al.  Dynamic Resource Control for High-Speed Downlink Packet Access Wireless Channel , 2003, ICDCS Workshops.

[17]  Philippe Godlewski,et al.  Admission control strategy and scheduling algorithms for downlink packet transmission in WCDMA , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[18]  Michael L. Honig,et al.  Resource allocation for multiple classes of DS-CDMA traffic , 2000, IEEE Trans. Veh. Technol..

[19]  Sajal K. Das,et al.  A framework for bandwidth degradation and call admission control schemes for multiclass traffic in next-generation wireless networks , 2003, IEEE J. Sel. Areas Commun..