Multi-component Matching Queues in Heavy Traffic
Bowen Xie

TL;DR
This paper analyzes multi-component matching queues in heavy traffic, deriving a limit process characterized by a coupled stochastic integral equation, and explores cost implications inspired by blood bank operations.
Contribution
It provides an explicit heavy traffic limit for multi-component matching queues with perishable items, including a coupled stochastic integral equation and an asymptotic cost analysis.
Findings
Heavy traffic limit characterized by a coupled stochastic integral equation.
Asymptotic Little's law relating queue length and virtual waiting time.
Convergence of cost functional to the heavy traffic limit.
Abstract
We consider multi-component matching systems in heavy traffic consisting of distinct perishable components which arrive randomly over time at high speed at the assemble-to-order station, and they wait in their respective queues according to their categories until matched or their ``patience" runs out. An instantaneous match occurs if all categories are available, and the matched components leave immediately thereafter. For a sequence of such systems parameterized by , we establish an explicit definition for the matching completion process, and when all the arrival rates tend to infinity in concert as , we obtain a heavy traffic limit of the appropriately scaled queue lengths under mild assumptions, which is characterized by a coupled stochastic integral equation with a scalar-valued non-linear term. We demonstrate some crucial properties for certain coupled…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Random Matrices and Applications · Probability and Risk Models
