OFDM downlink scheduling for delay-optimality: Many-channel many-source asymptotics with general arrival processes

Sharma, Manu; Lin, Xiaojun

doi:10.1109/ita.2011.5743589

Cited by 25 publications

(100 citation statements)

References 11 publications

Supporting

Mentioning

100

Contrasting

Order By: Relevance

“…Most of packet scheduling algorithms in wireless system are aimed to maximize either throughput or fairness among the users. Some of the common single carrier packet scheduling algorithms are discussed in this paper which can be used in proposed dynamic multitraffic scheduler [9].…”

Section: Lte Downlink Schedulingmentioning

confidence: 99%

Prioritized dynamic multitraffic scheduler for downlink in LTE

Sundari

Jayanthi

Gunasundari

2015

2015 2nd International Conference on Electronics and Communication Systems (ICECS)

View full text Add to dashboard Cite

Long Term Evolution (LTE) is an all IP packet system in which guaranteeing QoS is a real challenge. The LTE aims to provide a maximum data rates of 100Mbps for downlink and 50Mbps for uplink when 20 MHz bandwidth is used. The scheduler takes different considerations into account such as throughput and fairness when deciding the allocation of the scarce radio resources. Therefore the LTE MAC scheduler should consider not only the throughput optimization but also the QoS differentiations in an effective manner. The objective of this project is to focuses on enhancing the performance of LTE downlink scheduling. This project work proposes and implements a, "Dynamic Multitraffic Scheduler" which uses dynamic bandwidth and Resource Blocks (RBs) allocations based on number of service classes. The proposed scheduler also considers the different users channel conditions and tries to create a balance between the Quality of service (QoS) guarantees and the multi-user diversity in a proportional fair manner. Round Robin (RR), Best Channel Quality Indicator (BCQI), Proportional Fair (PF) and Opportunistic scheduling are investigated and compared for both existing and proposed scheduler.

show abstract

Section: Lte Downlink Schedulingmentioning

confidence: 99%

Prioritized dynamic multitraffic scheduler for downlink in LTE

Sundari

Jayanthi

Gunasundari

2015

2015 2nd International Conference on Electronics and Communication Systems (ICECS)

View full text Add to dashboard Cite

show abstract

“…When a user accesses the network, the corresponding file will be queued at the base station, waiting to be transmitted to the user based on the First Come First Serve (FCFS) discipline. Shama and Lin in [15] showed that the one server queue model is a good approximation for an OFDM system, especially when the number of users and channels are large.…”

Section: F Queuing Dynamicsmentioning

confidence: 99%

Profit maximization of cognitive virtual network operator in a dynamic wireless network

Huang

2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

In this paper, we study a cognitive virtual network operator's profit maximization problem in a dynamic network environment. We consider various network dynamics, including dynamic user demands, unstable sensing spectrum resources, dynamic spectrum prices, and time-varying channel conditions. We develop a low-complexity on-line control policy that determines pricing and resource scheduling without knowing the distribution of dynamic network parameters. We show that the proposed algorithm can achieve arbitrarily close to the optimal profit with a proper trade-off of the queuing delay. I. INTRODUCTIONDynamic spectrum sharing has the potential to solve the spectrum shortage problem by enabling unlicensed radio devices to intelligently and dynamically discover and access the "spectrum holes" (i.e., underutilized licensed spectrum) without disturbing the licensed users. Such opportunistic sharing can happen at both user and operator levels. Recently, Duan et al. in [1] introduced a sharing architecture of Cognitive Virtual Network Operator (CVNO) at the operator level. A CVNO obtains spectrum from a spectrum owner (through spectrum sensing and leasing) to serve its own customers. The concept of CVNO is a natural generalization of MVNO (Mobile Virtual Network Operator), which has been enjoying world-wide success during the last decade [2]. Departing from the static and stylized network model in [1], in this paper we analyze the performance of the CVNO in a realistic dynamic network environment.There are two approaches for a CVNO to obtain spectrum resource: spectrum sensing and spectrum leasing [1]. Spectrum sensing is based on the cognitive radio technology, and allows the CVNO to identify and utilize spectrum holes without paying fees to the spectrum owner. 1 Spectrum sensing will not consume much time or energy if the sensing technology is efficient. The availability of spectrum holes, however, is often stochastic, and thus it is hard to predict the amount of usable spectrum until sensing finishes. Spectrum leasing, on the other hand, guarantees the availability of spectrum for a predefined time period by allowing the CVNO to pay a (often high) fee to the spectrum owner. To maximize the investment flexibility, spectrum leasing may happen at a short time scale comparable to spectrum sensing. This requires an efficient near real-time spectrum market, which is an active research area itself.

show abstract

“…First, although the decay-rate of the queue-overflow probability may be mapped to that of the delay-violation probability when the arrival process is deterministic with a constant rate [6], this is not true in general, especially when the arrivals are correlated over time. Further, [7] and [8] have shown through simulations that good queue-length performance does not necessarily imply good delay performance. Second, their results on rate-function optimality strongly rely on the assumptions that the arrival process is i.i.d.…”

Section: Introductionmentioning

confidence: 99%

“…Similar to this paper, another line of work [7] directly focused on the delay performance rather than the queue-length performance. The performance of delay is often harder to characterize, because the delay in a queueing system often does not admit a Markovian representation, even for simple M/M/1 queues.…”

Section: Introductionmentioning

confidence: 99%

Performance of low-complexity greedy scheduling policies in multi-channel wireless networks: Optimal throughput and near-optimal delay

Gupta

Lin

et al. 2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design efficient scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a recently developed scheduling policy, called Delay Weighted Matching (DWM), has been shown to be both rate-function delay-optimal (in the many-channel manyuser asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n 5 ), which makes it impractical for modern OFDM systems. To address this issue, we first develop a simple greedy policy called Delaybased Queue-Side-Greedy (D-QSG) with a lower complexity O(n 3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance. Specifically, the rate-function attained by D-QSG for any fixed integer threshold b > 0, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold b − 1. Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n 2 ), and show that D-SSG achieves the same performance as D-QSG. Thus, we are able to achieve a dramatic reduction in complexity (from O(n 5 ) of DWM to O(n 2 )) with a minimal drop in the delay performance. Finally, we conduct numerical simulations to validate our theoretical results in various scenarios. The simulation results show that our proposed greedy policies not only guarantee a near-optimal rate-function, but also empirically are virtually indistinguishable from the delay-optimal policy DWM.

show abstract

OFDM downlink scheduling for delay-optimality: Many-channel many-source asymptotics with general arrival processes

Cited by 25 publications

References 11 publications

Prioritized dynamic multitraffic scheduler for downlink in LTE

Prioritized dynamic multitraffic scheduler for downlink in LTE

Profit maximization of cognitive virtual network operator in a dynamic wireless network

Performance of low-complexity greedy scheduling policies in multi-channel wireless networks: Optimal throughput and near-optimal delay

Contact Info

Product

Resources

About