Excessive Backlog Probabilities of Two Parallel Queues
Kamil Demirberk \"Unl\"u, Ali Devin Sezer

TL;DR
This paper analyzes the probabilities of queue overflow in a two-parallel queue system modeled by constrained random walks, providing exponential decay estimates and constructing harmonic functions for approximation.
Contribution
It introduces a novel method to approximate overflow probabilities using harmonic functions derived from characteristic surfaces of related random walks.
Findings
Overflow probability decays exponentially with system size.
Harmonic functions effectively approximate key probabilities.
Explicit formulas are derived for specific parameter regimes.
Abstract
Let be the constrained random walk on with increments , , and ; represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and interarrival times are exponentially distributed with arrival rates and service rates , ; we assume , , i.e., is assumed stable. Without loss of generality we assume . Let be the first time hits the line . Let be the same random walk as but only constrained on and its jump probabilities for the first component reversed. Let and let be the first time hits . The…
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.
