Useful stochastic bounds in time-varying queues with service and patience times having general joint distribution
Shreehari Anand Bodas, Royi Jacobovic

TL;DR
This paper develops stochastic bounds for workload and customer arrival processes in a time-varying queue with general joint distributions of service and patience times, using a novel coupling technique.
Contribution
It introduces a new coupling method to derive stochastic upper bounds for workload functionals in non-stationary queues with general joint distributions.
Findings
Derived stochastic upper bounds for workload integrals.
Applied bounds to queues with periodic arrival rates.
Demonstrated bounds' usefulness through examples.
Abstract
Consider a first-come, first-served single server queue with an initial workload and customers who arrive according to an inhomogeneous Poisson process with rate function for some . For each , let (resp., ) be the service (resp., patience) time of the 'th customer and assume that is an iid sequence of bivariate random vectors with non-negative coordinates. A customer joins if and only if his patience time is not less than his prospective waiting time (i.e., the left-limit of the workload process at his arrival epoch). Let be the first time when the system becomes empty and let be the arrival process of those who join the queue. In the present work we suggest a novel coupling technique which is applied to derive stochastic upper bounds…
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
