Rate scheduling for the downlink of CDMA mixed traffic networks

Varsou, A.C.; Huang, Howard; Mailaender, L.

doi:10.1109/wcnc.2000.904660

Cited by 12 publications

(14 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, it is plausible to apply nonpreemptive EDF to a CDMA system supporting multimedia traffic with delay bounds. The EDF policy has shown its effectiveness in many CDMA applications [66], [77]. The multiple code channels in CDMA networks can be viewed as multiple servers.…”

Section: B Time Scheduling With Delay Boundmentioning

confidence: 99%

Quality-of-service provisioning and efficient resource utilization in CDMA cellular communications

Jiang

Zhuang

Shen

et al. 2006

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-One of the major challenges in supporting multimedia services over Internet protocol (IP)-based code-division multiple-access (CDMA) wireless networks is the quality-of-service (QoS) provisioning with efficient resource utilization. Compared with the circuit-switched voice service in the second-generation CDMA systems (i.e., IS-95), heterogeneous multimedia applications in future IP-based CDMA networks require more complex QoS provisioning and more sophisticated management of the scarce radio resources. This paper provides an overview of the CDMA-related QoS provisioning techniques in the avenues of packet scheduling, power allocation, and network coordination, summarizes state-of-the-art research results, and identifies further research issues.Index Terms-Code-division multiple-access (CDMA), intercell coordination, multimedia services, packet scheduling, power allocation, quality-of-service (QoS), soft handoff.

show abstract

Section: B Time Scheduling With Delay Boundmentioning

confidence: 99%

Quality-of-service provisioning and efficient resource utilization in CDMA cellular communications

Jiang

Zhuang

Shen

et al. 2006

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…The scheduling algorithm known as prediction based delay-constrained shortest transmission time first (PDSTTF) is introduced in [10] together with its modified version M-PDSTTF. Using discrete transmission rates, the study shows that PDSTTF and its derivative are both superior to the EDF and HOLPRO algorithms specified in [4] and [5], respectively, in terms of packet loss probability. The study in [11] also considers a discrete set of service rates and evaluated a non blocking version of a first-come first-served (FCFS) downlink scheduling algorithm, whereas the study in [12] evaluates two uplink scheduling techniques for multicode CDMA networks, called therein uniform and arrival-rate scheduling.…”

mentioning

confidence: 99%

“…Examples of studies that are based on simulation techniques and employ algorithms utilizing a continuous range of service bit rates are found in [3][4][5][6][7][8][9]. For example, a rate processor sharing (RPS) algorithm is proposed in [3] for scheduling of downlink traffic, followed by further work in [4] and [5].…”

mentioning

confidence: 99%

“…For example, a rate processor sharing (RPS) algorithm is proposed in [3] for scheduling of downlink traffic, followed by further work in [4] and [5]. In [4] downlink scheduling based on the earliest packet deadline first (EDF) for CDMA data networks has been evaluated.…”

mentioning

confidence: 99%

“…In [4] downlink scheduling based on the earliest packet deadline first (EDF) for CDMA data networks has been evaluated. The algorithm is later modified to allow more than one transmission per scheduling interval and utilize the packet length as specified in powered EDF (PEDF) [5], and head-of-line psuedopRObability (HOLPRO) [6]. In [7] and [8] two algorithms fair-channel dependent scheduling (FCDS) and fair-channel adaptive rate scheduling (FCARS) are proposed for the downlink and uplink, respectively, transmission rate scheduling problem.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Framework for Analysis of Transmission Rate Scheduling for Wireless CDMA Data Networks

Mahmoud

2008

Wireless Pers Commun

View full text Add to dashboard Cite

The optimal utilization of network resources and the capacity to fulfill quality of service requirements are key requirements for 3rd G networks operations. Several burst admission and transmission rate scheduling algorithms are proposed in the literature. In this study, we develop an analytical framework for the downlink transmission rate scheduling problem for CDMA networks employing discrete service bit rates. The framework uses the average downlink transmit power as the system state and develops a K -dimensional Markov chain representing all possible states in the system. In addition, the transition probabilities due to arrivals of burst requests are made a function of the power utilization and the average power required to support the new burst taking into account the path loss model. The study assumes a transmission rate assignment scheme where the maximum possible system bit rate is assigned given the current system state and the subscriber's eligibility profile for particular system service rates. The analytical model provides performance metrics such as system throughput, average power utilization, average number of simultaneous transmissions, burst request blocking probability, and mean burst service time. While the developed model is applicable for a general CDMA based network with arbitrary discrete system service bit rates, the model is evaluated for the example of a cdma2000 1xRTT network. A comparison between simulation and analytic results to assess the accuracy of the model is provided.

show abstract

Delay Analysis of Packet Scheduling with Multi-Users Diversity in Wireless CDMA Systems

Kim

Kang

2005

Wireless Netw

View full text Add to dashboard Cite

There have been a number of studies that investigate efficient packet scheduling schemes to support quality of service of multiple real-time data users and to increase capacity of non-real-time users sharing a wireless channel. We consider the problem of scheduling transmissions of multiple data users sharing the same wireless channel so as to satisfy delay or throughput and present a general packet scheduling, called MBCS (Multi-users Best Channel Scheduling) which takes advantage of the multi-user diversity of a mobile wireless system. In this paper, a queuing model that represents radio resource management for supporting packet data services is developed for the purpose of evaluating the performance of wireless CDMA systems. Numerical results show that delay performance of the proposed scheduler is higher than that of the Single-user Best Channel Scheduler (SBCS) depending on the time-varying channel status.

show abstract

Rate scheduling for the downlink of CDMA mixed traffic networks

Cited by 12 publications

References 3 publications

Quality-of-service provisioning and efficient resource utilization in CDMA cellular communications

Quality-of-service provisioning and efficient resource utilization in CDMA cellular communications

Framework for Analysis of Transmission Rate Scheduling for Wireless CDMA Data Networks

Delay Analysis of Packet Scheduling with Multi-Users Diversity in Wireless CDMA Systems

Contact Info

Product

Resources

About