A monotonicity result for the workload in Markov-modulated queues

A monotonicity result for the workload in Markov-modulated queues

0.00 Avg rating0 Votes
Article ID: iaor2000542
Country: United Kingdom
Volume: 35
Issue: 3
Start Page Number: 741
End Page Number: 747
Publication Date: Sep 1998
Journal: Journal of Applied Probability
Authors: ,
Abstract:

We consider a single server queue where the arrival process is a Markov-modulated Poisson process and service times are independent and identically distributed and independent from arrivals. The underlying intensity process is assumed ergodic with generator cQ, c > 0. We prove under some monotonicity assumptions on Q that the stationary workload W(c) is decreasing in c with respect to the increasing convex ordering.

Reviews

Required fields are marked *. Your email address will not be published.