First exit time for a discrete-time parallel queue

From MaRDI portal
Publication:2146407




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) be the queue length at nth time-slot. We present several open questions related to the steady-state of this queue.










This page was built for publication: First exit time for a discrete-time parallel queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146407)