First exit time for a discrete time parallel queue

preprint2022arXivOpen access

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 (Qn1,Qn2)(Q_n^1, Q_n^2) be the queue length at nnth time-slot. We present several open questions related to the steady-state of this queue.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.