First exit time for a discrete time parallel queue
Probability
2022-02-18 v1
Abstract
We consider a discrete time parallel queue, which is two-queue network, where at each time-slot there is a the same batch arrival to both queues and at each queue there is a random service available. The service law at each time-slot for each queue is different. Let be the queue length at th time-slot. We present several open questions related to the steady-state of this queue.
Keywords
Cite
@article{arxiv.2202.08343,
title = {First exit time for a discrete time parallel queue},
author = {Zbigniew Palmowski},
journal= {arXiv preprint arXiv:2202.08343},
year = {2022}
}