First exit time for a discrete-time parallel queue

DOI10.1007/S11134-022-09744-ZzbMATH Open1491.90060arXiv2202.08343OpenAlexW4220961666MaRDI QIDQ2146407FDOQ2146407

Authors: Zbigniew Palmowski 

Publication date: 16 June 2022

Published in: Queueing Systems (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/2202.08343

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Title not available (Why is that?)
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• The second rate function and the asymptotic problems of renewal and hitting the boundary for multidimensional random walks
• Random walks in the quarter plane. Algebraic methods, boundary value problems, applications to queueing systems and analytic combinatorics
• Tandem Brownian queues
• Large deviations for Markov chains in the positive quadrant
• Reflecting Brownian motion in two dimensions: exact asymptotics for the stationary distribution
• The probability of exceeding a high boundary on a random time interval for a heavy-tailed random walk
• Tail asymptotics of the stationary distribution of a two-dimensional reflecting random walk with unbounded upward jumps
• Two parallel insurance lines with simultaneous arrivals and risks correlated with inter-arrival times
• Hitting probabilities and large deviations
• 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)