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 be the queue length at th time-slot. We present several open questions related to the steady-state of this queue.
Cites work
- scientific article; zbMATH DE number 3814724 (Why is no real title available?)
- Hitting probabilities and large deviations
- Large deviations for Markov chains in the positive quadrant
- Random walks in the quarter plane. Algebraic methods, boundary value problems, applications to queueing systems and analytic combinatorics
- Reflecting Brownian motion in two dimensions: exact asymptotics for the stationary distribution
- Tail asymptotics of the stationary distribution of a two-dimensional reflecting random walk with unbounded upward jumps
- Tandem Brownian queues
- The probability of exceeding a high boundary on a random time interval for a heavy-tailed random walk
- The second rate function and the asymptotic problems of renewal and hitting the boundary for multidimensional random walks
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Two parallel insurance lines with simultaneous arrivals and risks correlated with inter-arrival times
- Two-dimensional ruin probability for subexponential claim size
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)