Scheduling for time-division based shared channel allocation for UMTS

Authors:
Chai-Hien Gan;Phone Lin;Nei-Chiung Perng;Tei-Wei Kuo;Ching-Chi Hsu
Affiliations:
Department of Computer Science, National Chiao Tung University, R.O.C.;Department of Computer Science & Information Engineering, and Graduate Institute of Networking and Multimedia, National Taiwan University, Taipei, R.O.C.;Department of Computer Science & Information Engineering, National Taiwan University, R.O.C.;Department of Computer Science & Information Engineering, National Taiwan University, R.O.C.;Executive Vice President, Institute for Information Industry (III), Taiwan, R.O.C.
Venue:
Wireless Networks
Year:
2007

Citing 7
Cited 2

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Wcdma for Umts

Wcdma for Umts
Channel allocation for GPRS with buffering mechanisms

Wireless Networks
Dynamic bandwidth allocation with fair scheduling for WCDMA systems

IEEE Wireless Communications
Modeling opportunity driven multiple access in UMTS

IEEE Transactions on Wireless Communications
Wireless dynamic channel assignment performance under packet data traffic

IEEE Journal on Selected Areas in Communications
Supporting rate guarantee and fair access for bursty data traffic in W-CDMA

IEEE Journal on Selected Areas in Communications

On Scheduling Policies for Streams of Structured Jobs

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
A novel prebuffering scheme for IPTV service

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Universal Mobile Telecommunications System (UMTS) adopts the WCDMA technology as the radio access interface to provide variable transmission rate services. There are four classes of connections identified in UMTS, which are the conversational, streaming, interactive, and background connections. To efficiently utilize radio bandwidth, the shared channel approach is proposed to deliver the packets for the interactive and background connections. This paper proposes a "Shared-Channel Assignment and Scheduling" (SCAS) algorithm to periodically allocate shared channels to serve interactive and background connections. We conduct formal mathematical proofs and simulation experiments to investigate the performance of the SCAS algorithm. We formally prove that with SCAS, a shared channel can be fully utilized (i.e., the utilization of a shared channel can be up to 100%) to serve the interactive connections. Our analysis indicates that compared with the previously proposed shared channel allocation and scheduling algorithms, there are less computation and communication overheads introduced in the SCAS algorithm. The results of the simulation experiments indicate that it is preferred to set up the Transmission Time Interval (TTI; that is, the unit of time interval for shared channel allocation) smaller to optimize the performance of the SCAS algorithm, including the shared channel utilization and the average waiting time of a connection before getting transmission service.