DHDaniela Hurtado-Lange

Daniela Hurtado-Lange

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Daniela Hurtado-Lange has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Load balancing system under Join the Shortest Queue: Many-Server-Heavy-Traffic Asymptotics

    by Daniela Hurtado-Lange, Siva Theja Maguluri

    We study the load balancing system operating under Join the Shortest Queue (JSQ) in the many-server heavy-traffic regime. If $N$ is the number of servers, we let the difference between the total service rate and the total arrival rate be $N^{1-\alpha}$ with $\alpha>0$. We show that for $\alpha>4$ the average queue length behaves similarly to the classical heavy-traffic regime. Specifically, we prove that the distribution of the average queue length multiplied by $N^{1-\alpha}$ converges to an exponential random variable. Moreover, we show a result analogous to state space collapse. We provide two proofs for our result: one using the one-sided Laplace transform, and one using Stein's method. We additionally obtain the rate of convergence in the Wasserstein's distance.

  • Open Access

    Heavy-Traffic Analysis of Queueing Systems with no Complete Resource Pooling

    by D. Hurtado-Lange, S. T. Maguluri

    We study the heavy-traffic limit of the generalized switch operating under MaxWeight, without assuming that the CRP condition is satisfied and allowing for correlated arrivals. The main contribution of this paper is the steady-state mean of linear combinations of queue lengths in heavy traffic. We showcase the generality of our result by presenting various stochastic networks as corollaries, each of which is a contribution by itself. In particular, we study the input-queued switch with correlated arrivals and we show that if the state space collapses to a full-dimensional subspace, the correlation among the arrival processes does not matter in heavy traffic. We exemplify this last case with a parallel-server system, an N-system, and an ad hoc wireless network. While the above results are obtained using the drift method, we additionally present a negative result showing a limitation of the drift method. We show that it is not possible to obtain the individual queue lengths using the drift method with polynomial test functions. We do this by presenting an alternate view of the drift method in terms of a system of linear equations, and we use this system of equations to obtain bounds on arbitrary linear combinations of the queue lengths.

  • Open Access

    Throughput and Delay Optimality of Power-of-d Choices in Inhomogeneous Load Balancing Systems

    by Daniela Hurtado-Lange, Siva Theja Maguluri

    It is well-known that the power-of-d choices routing algorithm maximizes throughput and is heavy-traffic optimal in load balancing systems with homogeneous servers. However, if the servers are heterogeneous, throughput optimality does not hold in general. We find necessary and sufficient conditions for throughput optimality of power-of-d choices when the servers are heterogeneous, and we prove that almost the same conditions are sufficient to show heavy-traffic optimality. Additionally, we generalize the sufficient condition for throughput optimality to a larger class of routing policies.

  • Open Access

    Transform Methods for Heavy-Traffic Analysis

    by Daniela Hurtado-Lange, Siva Theja Maguluri

    The drift method was recently developed to study queueing systems in steady-state. It was successfully used to obtain bounds on the moments of the scaled queue lengths, that are asymptotically tight in heavy-traffic, in a wide variety of systems including generalized switches, input-queued switches, bandwidth sharing networks, etc. In this paper we develop the use of transform techniques for heavy-traffic analysis, with a special focus on the use of moment generating functions. This approach simplifies the proofs of the drift method, and provides a new perspective on the drift method. We present a general framework and then use the MGF method to obtain the stationary distribution of queue lengths in heavy-traffic in queueing systems that satisfy the Complete Resource Pooling condition. In particular, we study load balancing systems and generalized switches under general settings.

  • Open Access

    Logarithmic Heavy Traffic Error Bounds in Generalized Switch and Load Balancing Systems

    by Daniela Hurtado-Lange, Sushil Mahavir Varma, Siva Theja Maguluri

    Motivated by application in wireless networks, cloud computing, data centers etc, Stochastic Processing Networks have been studied in the literature under various asymptotic regimes. In the heavy-traffic regime, the steady state mean queue length is proved to be $O(\frac{1}{\epsilon})$ where $\epsilon$ is the heavy-traffic parameter, that goes to zero in the limit. The focus of this paper is on obtaining queue length bounds on prelimit systems, thus establishing the rate of convergence to the heavy traffic. In particular, we study the generalized switch model operating under the MaxWeight algorithm, and we show that the mean queue length of the prelimit system is only $O\left(\log \left(\frac{1}{\epsilon}\right)\right)$ away from its heavy-traffic limit. We do this even when the so called complete resource pooling (CRP) condition is not satisfied. When the CRP condition is satisfied, in addition, we show that the MaxWeight algorithm is within $O\left(\log \left(\frac{1}{\epsilon}\right)\right)$ of the optimal. Finally, we obtain similar results in load balancing systems operating under the join the shortest queue routing algorithm.