DeepAI AI Chat
Log In Sign Up

Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis

by   Martin Zubeldia, et al.

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 qubits from each node that can be used to serve the requests. An important feature of this model is that qubits decohere and so abandon over time. In contrast to classical server-based queueing models, the combination of queueing, server-less multi-way matching, and abandonment make the analysis a challenging problem. The primary focus of this paper is to study a simple system consisting of two types of requests and three types of qubits operating under a Max-Weight policy. In this setting, we characterize the stability region under the Max-Weight policy by adopting a two-time scale fluid limit to get a handle on the abandonments. In particular, we show that Max-Weight is throughput optimal and that it can achieve throughputs larger than the ones that can be achieved by non-idling policies when the requests are infinitely backlogged. Moreover, despite the use of the Max-Weight policy, we show that there can be a counter-intuitive behavior in the system: the longest requests queue can have a positive drift for some time even if the overall system is stable.


page 1

page 2

page 3

page 4


Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse

We consider a multi-hop switched network operating under a Max-Weight (M...

Throughput Optimal Decentralized Scheduling with Single-bit State Feedback for a Class of Queueing Systems

Motivated by medium access control for resource-challenged wireless Inte...

Communication-Aware Scheduling of Serial Tasks for Dispersed Computing

There is a growing interest in development of in-network dispersed compu...

Stability Analysis of a Quantum Network with Max-Weight Scheduling

We study a quantum network that distributes entangled quantum states to ...

Optimal Content Replication and Request Matching in Large Caching Systems

We consider models of content delivery networks in which the servers are...

Delay-Optimal Scheduling for Queueing Systems with Switching Overhead

We study the scheduling polices for asymptotically optimal delay in queu...

DeepRT: A Soft Real Time Scheduler for Computer Vision Applications on the Edge

The ubiquity of smartphone cameras and IoT cameras, together with the re...