Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T14:11:51.889Z Has data issue: false hasContentIssue false

A monotonicity result for the workload in Markov-modulated queues

Published online by Cambridge University Press:  14 July 2016

Nicole Bäuerle*
Affiliation:
University of Ulm
Tomasz Rolski*
Affiliation:
University of Wroclaw
*
∗ Postal address: Department of Mathematics VII, University of Ulm, D-89069 Ulm, Germany. Email address: baeuerle@mathematik.uni-ulm.de.
∗∗ Postal address: Mathematical Institute, University of Wroclaw, 50384 Wroclaw, Poland.

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.

MSC classification

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable