10 research outputs found
Resource allocation in wireless access network : A queueing theoretic approach
To meet its performance targets, the future 5G networks need to greatly optimize the Radio Access Networks (RANs), which connect the end users to the core network. In this thesis, we develop mathematical models to study three aspects of the operation of the RAN in modern wireless systems. The models are analyzed using the techniques borrowed mainly from queueing theory and stochastic control. Also, simulations are extensively used to gain further insights.
First, we provide a detailed Markov model of the random access process in LTE. From this, we observe that the bottleneck in the signaling channel causes congestion in the access when a large number of M2M devices attempt to enter the network. Then, in the context of the so-called Heterogeneous networks (HetNets), we suggest dynamic load balancing schemes that alleviate this congestion and reduce the overall access delay.
We then use flow-level models for elastic data traffic to study the problem of coordinating the activities of the neighboring base stations. We seek to minimize the flow-level delay when there are various classes of users. We classify the users based on their locations, or, in dynamic TDD systems, on the direction of service the network is providing to them. Using interacting queues and different operating policies of running such queues, we study the amount of gain the dynamic policies can provide over the static probabilistic policies. Our results show that simple dynamic policies can provide very good performance in the cases considered.
Finally, we consider the problem of opportunistically scheduling the flows of users with time-varying channels taking into account  the size of data they need to transfer. Using flow-level models in a system with homogeneous channels, we provide the optimal scheduling policy when there are no new job arrivals. We also suggest the method to implement such a policy in a time-slotted system.
With heterogeneous channels, the problem is intractable for the flow-level techniques. Therefore, we utilize the framework of the restless-multi-armed-bandit (RMAB) problems employing the so-called Whittle index approach. The Whittle index approach, by relaxing the scheduling constraints, makes the problem separable, and thereby provides an exact solution to the modified problem. Our simulations suggest that when this solution is applied as a heuristic to the original problem, it gives good performance, even with dynamic job arrivals
Optimal flow-level performance of opportunistic scheduling with size information
Proportional fair (PF) is well known as the algorithm of choice for scheduling data flow in a wireless setting. Although considered as having good performance characteristics with nice fairness properties, PF is far from optimal when it comes to minimizing the flow-level delays. In this thesis, we study the optimal scheduling policy in an opportunistic wireless environment.
The analysis can be applied to any setting where some kind of rate region can be constructed. As the main result we prove that when a fixed number of flows can be served at an average rate taken from a compact and symmetric rate region, the optimal policy is consistent with the SRPT-FM scheduling policy used in queuing systems with multiple servers. Moreover, we see that for some specially crafted rate region we can also get the explicit analytic expressions of the optimal long term service rates that minimize the cumulative delay of the flows.
Through simulation, we observe that in a dynamic setting the performance of this static-case optimal policy is no worse than the PF policy in this kind of rate region. For a case with asymmetric service requirements, we consider a case with only two flows where we observe that if the rate region has certain characteristics met in practice, there are only two possible optimal rate pairs. The choice between them can be made based on the size of flows at hand. We also study a numerical example where the optimal policy still follows the spirit of the SRPT-FM policy even in the asymmetric case
An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels
In this paper we study how to design a scheduling strategy aimed at minimizing the average holding cost for flows with general size distribution when the feasible transmission rate of each user varies randomly over time. We employ a Whittle-index-based approach in order to achieve an opportunistic and non-anticipating size-aware scheduling index rule proposal. When the flow size distribution belongs to the Decreasing Hazard Rate class, we propose the so-called Attained Service Potential Improvement index rule, which consists in giving priority to the flows with the highest ratio between the current attained-service-dependent completion probability and the expected potential improvement of this completion probability. We further analyze the performance of the proposed scheduler, concluding that it outperforms well-known opportunistic disciplines
Scheduling in a random environment: stability and asymptotic optimality
International audienceWe investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted, and users arrive and depart upon service completion. This may model, for example, the flow-level behavior of end-users in a narrowband HDR wireless channel (CDMA 1xEV-DO). As performance criteria, we consider the stability of the system and the mean delay experienced by the users. Given the complexity of the problem, we investigate the fluid-scaled system, which allows to obtain important results and insights for the original system: 1) We characterize for a large class of scheduling policies the stability conditions and identify a set of maximum stable policies, giving in each time-slot preference to users being in their best possible channel condition. We find in particular that many opportunistic scheduling policies like Score-Based, Proportionally Best, or Potential Improvement are stable under the maximum stability conditions, whereas the opportunistic scheduler Relative-Best or the cÎĽ-rule are not. 2) We show that choosing the right tie-breaking rule is crucial for the performance (e.g., average delay) as perceived by a user. We prove that a policy is asymptotically optimal if it is maximum stable and the tie-breaking rule gives priority to the user with the highest departure probability. We will refer to such tie-breaking rule as myopic. 3) We derive the growth rates of the number of users in the system in overload settings under various policies, which give additional insights on the performance. 4) We conclude that simple priority-index policies with the myopic tie-breaking rule are stable and asymptotically optimal. All our findings are validated with extensive numerical experiments
Recommended from our members
Schedulers for next generation wireless networks : realizing QoE trade-offs for heterogeneous traffic mixes
In this thesis we will focus on the design of schedulers for next generation wireless networks which support application mixes, characterized by different, possibly complex, application/user Quality of Experience (QoE) metrics. The central problem underlying resource allocation for such systems is realizing QoE trade-offs among various applications/users given the dynamic loads and capacity variability they would typically see. In the first part of the thesis our focus is on applications where QoE depends on flow-level delay-based metrics. We consider system-wide metrics which directly capture both users' QoE metrics and appropriate QoE trade-offs among various applications for a wide range of system loads. This approach is different from the traditional wireless scheduler designs which have been driven by rate-based criteria, e.g., utility maximizing/proportionally fair, and/or queue-based packet schedulers which do not directly reflect the link between flow-level delays and users' QoE. In the second part of this thesis we address the key design challenges in networks supporting Ultra Reliable Low Latency Communications (URLLC) traffic which requires extremely high reliability (99.999%) and very low delays (1 msec). We will explore three different types flow delay-based metrics in this proposal, based on 1) overall mean delay; 2) functions of mean delays; and, 3) mean of functions of delays. We begin by considering minimization of mean flow delay for an M/GI/1 queuing model for a wireless Base Station (BS) where the flow size distributions are of the New Better than Used in Expectation + Decreasing Hazard Rate (NBUE +DHZ) type. Such a flow size distribution have been observed in real systems and we too validate this model based on collected data. Using a combination of analysis and simulation we show that our scheduler achieves good performance for users that might correspond to interactive applications like web browsing and/or stored video streaming and is robust to variations in system loads. Next we consider a generalization of this approach where we minimize a metric based on cost functions of the mean flow delays in a multi-class system where users/flows are classified based on their respective QoE requirements and each class's QoE requirement is modeled by its respective cost function. This approach helps us model QoE more accurately and gives us more flexibility in considering QoE trade-offs among heterogeneous user classes. We optimize two different metrics based on how we average the cost functions of delays, namely, functions of mean delays; and mean of functions of delays. The former can be used when users' experiences are sensitive to mean delays and while the latter can be used when user's experience is also sensitive to higher moments of delays, e.g., variance or soft thresholds on delay. Extensive simulations confirm the effectiveness of our proposed approaches at realizing various QoE trade-offs and performance. In 5G wireless networks URLLC traffic is expected to support many applications like industrial automation, mission critical traffic, virtual traffic etc, where the wireless network has to reliability transport small packets with very high reliability and low delays. We address the following aspects related to the system design for URLLC traffic, 1) quantifying the impact of various system parameters like system bandwidth, link SINR, delay and latency constraints on URLLC 'capacity'; 2) provisioning wireless system appropriately to meet URLLC Quality of Service (QoS) requirements; and, 3) designing efficient Hybrid Automatic Repeat Request (HARQ) schemes for transmitting small packets. Further, due the heterogeneity in delay requirements between URLLC and other types of traffic, sharing radio resources between them creates its own unique challenges. We develop efficient multiplexing schemes between URLLC traffic and other mobile broadband traffic based on preemptive puncturing/superposition of the mobile broadband transmissions by URLLC transmissions.Electrical and Computer Engineerin