3 citations · 4 across the 12 of their papers we have counts for
13 papers
Load Balancing Policies in Heterogeneous Systems: Non-Monotone Stability and Heavy-Traffic Optimality
Yishun Luo, Martin Zubeldia
We consider a discrete-time queueing system with heterogeneous parallel single-server queues. Jobs arrive at a central dispatcher and must be assigned immediately to one of the…
Heavy-traffic Optimality of Skip-the-Longest-Queues in Heterogeneous Service Systems
Yishun Luo, Martin Zubeldia
We consider a discrete-time parallel service system consisting of heterogeneous single server queues with infinite capacity. Jobs arrive to the system as an i.i.d. process with…
Distributed Rate Scaling in Large-Scale Service Systems
Daan Rutten, Martin Zubeldia, Debankur Mukherjee
We consider a large-scale parallel-server system, where each server independently adjusts its processing speed in a decentralized manner. The objective is to minimize the overall c…
Concentration of Contractive Stochastic Approximation: Additive and Multiplicative Noise
Zaiwei Chen, Siva Theja Maguluri, Martin Zubeldia
In this paper, we establish maximal concentration bounds for the iterates generated by a stochastic approximation (SA) algorithm under a contractive operator with respect to some a…
Join-the-Shortest Queue with Abandonment: Critically Loaded and Heavily Overloaded Regimes
Prakirt Raj Jhunjhunwala, Martin Zubeldia, Siva Theja Maguluri
We consider a load balancing system comprised of a fixed number of single server queues, operating under the well-known Join-the-Shortest Queue policy, and where jobs/customers are…
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis
Martin Zubeldia, Prakirt R. Jhunjhunwala, Siva Theja Maguluri
Inspired by quantum switches, we consider a discrete-time multi-way matching system with two classes of arrivals: requests for entangled pair of qubits between two nodes, and qubit…
Large deviations for acyclic networks of queues with correlated Gaussian inputs
Martin Zubeldia, Michel Mandjes
We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Ga…
Stability, memory, and messaging tradeoffs in heterogeneous service systems
David Gamarnik, John N. Tsitsiklis, Martin Zubeldia
We consider a heterogeneous distributed service system, consisting of servers with unknown and possibly different processing rates. Jobs with unit mean and independent processi…
Delay-optimal policies in partial fork-join systems with redundancy and random slowdowns
Martin Zubeldia
We consider a large distributed service system consisting of homogeneous servers with infinite capacity FIFO queues. Jobs arrive as a Poisson process of rate (for some…
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory
Lili Su, Martin Zubeldia, Nancy Lynch
We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual…
A lower bound on the queueing delay in resource constrained load balancing
David Gamarnik, John N. Tsitsiklis, Martin Zubeldia
We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate , with $0<λ…
Collaboratively Learning the Best Option, Using Bounded Memory
Lili Su, Martin Zubeldia, Nancy Lynch
We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual…
Delay, memory, and messaging tradeoffs in distributed service systems
David Gamarnik, John N. Tsitsiklis, Martin Zubeldia
We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate , with…