Tail asymptotics for a random sign Lindley recursion
classification
🧮 math.PR
math.STstat.TH
keywords
recursionsystemslindleyservicetailalternatingasymptoticscases
read the original abstract
We investigate the tail behaviour of the steady state distribution of a stochastic recursion that generalises Lindley's recursion. This recursion arises in queuing systems with dependent interarrival and service times, and includes alternating service systems and carousel storage systems as special cases. We obtain precise tail asymptotics in three qualitatively different cases, and compare these with existing results for Lindley's recursion and for alternating service systems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.