On Asymptotic Optimality of Dual Scheduling Algorithm In A Generalized Switch

Generalized switch is a model of a queueing system where parallel servers are interdependent and have time-varying service capabilities. This paper considers the dual scheduling algorithm that uses rate control and queue-length based scheduling to allocate resources for a generalized switch. We consider a saturated system in which each user has infinite amount of data to be served. We prove the asymptotic optimality of the dual scheduling algorithm for such a system, which says that the vector of average service rates of the scheduling algorithm maximizes some aggregate concave utility functions. As the fairness objectives can be achieved by appropriately choosing utility functions, the asymptotic optimality establishes the fairness properties of the dual scheduling algorithm. The dual scheduling algorithm motivates a new architecture for scheduling, in which an additional queue is introduced to interface the user data queue and the time-varying server and to modulate the scheduling process, so as to achieve different performance objectives. Further research would include scheduling with Quality of Service guarantees with the dual scheduler, and its application and implementation in various versions of the generalized switch model

Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic

We investigate the asymptotic behavior of the steady-state queue length distribution under generalized max-weight scheduling in the presence of heavy-tailed traffic. We consider a system consisting of two parallel queues, served by a single server. One of the queues receives heavy-tailed traffic, and the other receives light-tailed traffic. We study the class of throughput optimal max-weight-alpha scheduling policies, and derive an exact asymptotic characterization of the steady-state queue length distributions. In particular, we show that the tail of the light queue distribution is heavier than a power-law curve, whose tail coefficient we obtain explicitly. Our asymptotic characterization also contains an intuitively surprising result - the celebrated max-weight scheduling policy leads to the worst possible tail of the light queue distribution, among all non-idling policies. Motivated by the above negative result regarding the max-weight-alpha policy, we analyze a log-max-weight (LMW) scheduling policy. We show that the LMW policy guarantees an exponentially decaying light queue tail, while still being throughput optimal

An Analytical Framework for Heterogeneous Partial Feedback Design in Heterogeneous Multicell OFDMA Networks

The inherent heterogeneous structure resulting from user densities and large scale channel effects motivates heterogeneous partial feedback design in heterogeneous networks. In such emerging networks, a distributed scheduling policy which enjoys multiuser diversity as well as maintains fairness among users is favored for individual user rate enhancement and guarantees. For a system employing the cumulative distribution function based scheduling, which satisfies the two above mentioned desired features, we develop an analytical framework to investigate heterogeneous partial feedback in a general OFDMA-based heterogeneous multicell employing the best-M partial feedback strategy. Exact sum rate analysis is first carried out and closed form expressions are obtained by a novel decomposition of the probability density function of the selected user's signal-to-interference-plus-noise ratio. To draw further insight, we perform asymptotic analysis using extreme value theory to examine the effect of partial feedback on the randomness of multiuser diversity, show the asymptotic optimality of best-1 feedback, and derive an asymptotic approximation for the sum rate in order to determine the minimum required partial feedback.Comment: To appear in IEEE Trans. on Signal Processin

Stability of Scheduled Multi-access Communication over Quasi-static Flat Fading Channels with Random Coding and Independent Decoding

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value, and the channels from transmitters to receiver are quasi-static, flat, and have independent fades. Requests for message transmissions are assumed to arrive according to an i.i.d. arrival process. Then, we show the following: (1) in the limit of large message alphabet size, the stability region has an interference limited information-theoretic capacity interpretation, (2) state-independent scheduling policies achieve this asymptotic stability region, and (3) in the asymptotic limit corresponding to immediate access, the stability region for non-idling scheduling policies is shown to be identical irrespective of received signal powers.Comment: 5 pages, 1 figure, To be presented at 2005 IEEE International Symposium on Information Theory, corrected versio

Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy

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 practical scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a class of $O(n^{2.5} \log n)$-complexity hybrid scheduling policies are recently developed to guarantee both rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in the general non-asymptotic setting), their practical complexity is typically high. To address this issue, we develop a simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with a \lower complexity $2n^2+2n$, and rigorously prove that D-SSG not only achieves throughput optimality, but also guarantees near-optimal asymptotic delay performance. Specifically, we show that the rate-function attained by D-SSG for any delay-violation threshold $b$, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold $b-1$. Thus, we are able to achieve a reduction in complexity (from $O(n^{2.5} \log n)$ of the hybrid policies to $2n^2 + 2n$) with a minimal drop in the delay performance. More importantly, in practice, D-SSG generally has a substantially lower complexity than the hybrid policies that typically have a large constant factor hidden in the $O(\cdot)$ notation. Finally, we conduct numerical simulations to validate our theoretical results in various scenarios. The simulation results show that D-SSG not only guarantees a near-optimal rate-function, but also empirically is virtually indistinguishable from delay-optimal policies.Comment: Accepted for publication by the IEEE/ACM Transactions on Networking, February 2014. A preliminary version of this work was presented at IEEE INFOCOM 2013, Turin, Italy, April 201

Actuator and sensor fault estimation based on a proportional-integral quasi-LPV observer with inexact scheduling parameters

© 2019. ElsevierThis paper presents a method for actuator and sensor fault estimation based on a proportional-integral observer (PIO) for a class of nonlinear system described by a polytopic quasi-linear parameter varying (qLPV) mathematical model. Contrarily to the traditional approach, which considers measurable or unmeasurable scheduling parameters, this work proposes a methodology that considers inexact scheduling parameters. This condition is present in many physical systems where the scheduling parameters can be affected by noise, offsets, calibration errors, and other factors that have a negative impact on the measurements. A H8 performance criterion is considered in the design in order to guarantee robustness against sensor noise, disturbance, and inexact scheduling parameters. Then, a set of linear matrix inequalities (LMIs) is derived by the use of a quadratic Lyapunov function. The solution of the LMI guarantees asymptotic stability of the PIO. Finally, the performance and applicability of the proposed method are illustrated through a numerical experiment in a nonlinear system.Peer ReviewedPostprint (author's final draft