Scheduling for time-division based shared channel allocation for UMTS

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 As- * A preliminary version [11] of this work has been accepted by IEEE Wireless Communications and Networking Conference 2004. This paper is an extension of the proposed algorithm, and simulation and analysis are conducted to investigate the performance of the proposed algorithm. signment 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.

Time-Division-Based Cyclic Scheduling for UMTS High-Speed Downlink Shared-Channels

“…As mentioned in [13], the SCAS scheme has lower complexity and higher resource utilization over previous scheduling schemes. With the same characteristic of SCAS, the eSCAS scheme has the same advantages of SCAS.…”

“…Furthermore, these algorithms have much complexity on scheduling, which are not easily implemented in the real system. In our previous research [12], [13], we proposed the shared-channel assignment and scheduling (SCAS) scheme to schedule DSCHs. SCAS has been shown taking less complexity than other existing scheduling schemes do [13].…”

“…In our previous research [12], [13], we proposed the shared-channel assignment and scheduling (SCAS) scheme to schedule DSCHs. SCAS has been shown taking less complexity than other existing scheduling schemes do [13]. The SCAS scheme is briefly described as follows.…”

CAC-RD: an UMTS call admission control

“…The objective of these studies is to increase the network performance and availability. Some literature proposals adopt QoS solutions of fixed networks, such as MPLS (Multi-protocol Label Switching) [9], IntServ (Integrated Services) [5] and DiffServ (Differentiated Services) [8,12,17] in wireless networks. Other proposals consider resources reservation, admission or flow control, in the wireless link.…”

On Scheduling Policies for Streams of Structured Jobs

“…The problem of efficient allocation of reusable resources over time, also known as scheduling, is a universal problem, appearing almost everywhere, ranging from the allocation of machines in a factory [22,6,19], allocation of processor time slots in a real-time system [20,9], allocating communication channels in a network [16], or allocation of vehicles for transportation tasks [7]. Unfortunately, the study of scheduling problems is distributed among many academic communities and application domains, each focusing on certain aspects of the problem.…”