Useful stochastic bounds in time-varying queues with service and patience times having general joint distribution

Abstract

Consider a first-come, first-served single server queue with an initial workload x>0 and customers who arrive according to an inhomogeneous Poisson process with rate function λ:[0,∞)→[0,λh ] for some λh>0. For each i∈N, let Si (resp., Yi) be the service (resp., patience) time of the i'th customer and assume that (S1,Y1),(S2,Y2),… is an iid sequence of bivariate random vectors with non-negative coordinates. A customer joins if and only if his patience time is not less than his prospective waiting time (i.e., the left-limit of the workload process at his arrival epoch). Let τ(x) be the first time when the system becomes empty and let N*λ(·) be the arrival process of those who join the queue. In the present work we suggest a novel coupling technique which is applied to derive stochastic upper bounds for the functionals: equation* ∫0τ(x)g Wx(t) dt\ \ and\ \ ∫0τ(x)g Wx(t) dN*λ(t)\,, equation* where Wx(·) is the workload process in the queue and g(·) is any lower semi-continuous function. We also demonstrate how to utilise these bounds via some examples under the additional assumption that λ(·) is periodic.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…