Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T16:17:09.154Z Has data issue: false hasContentIssue false

Monotonicity results for queues with doubly stochastic Poisson arrivals: Ross's conjecture

Published online by Cambridge University Press:  01 July 2016

Cheng-Shang Chang*
Affiliation:
IBM Thomas J. Watson Research Center
Xiu Li Chao*
Affiliation:
New Jersey Institute of Technology
Michael Pinedo*
Affiliation:
Columbia University
*
∗ Postal address: IBM Research Division, T. J. Watson Research Center, H2-K06, P.O. Box 704, Yorktown Heights, NY 10598, USA.
∗∗ Postal address: Dept. of Industrial and Management Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA.
∗∗∗ Dept. of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, USA.

Abstract

In this paper, we compare queueing systems that differ only in their arrival processes, which are special forms of doubly stochastic Poisson (DSP) processes. We define a special form of stochastic dominance for DSP processes which is based on the well-known variability or convex ordering for random variables. For two DSP processes that satisfy our comparability condition in such a way that the first process is more ‘regular' than the second process, we show the following three results: (i) If the two systems are DSP/GI/1 queues, then for all f increasing convex, with V (i), i = 1 and 2, representing the workload (virtual waiting time) in system. (ii) If the two systems are DSP/M(k)/1→ /M(k)/l ∞ ·· ·∞ /M(k)/1 tandem systems, with M(k) representing an exponential service time distribution with a rate that is increasing concave in the number of customers, k, present at the station, then for all f increasing convex, with Q (i), i = 1 and 2, being the total number of customers in the two systems. (iii) If the two systems are DSP/M(k)/1/N systems, with N being the size of the buffer, then where denotes the blocking (loss) probability of the two systems. A model considered before by Ross (1978) satisfies our comparability condition; a conjecture stated by him is shown to be true.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1991 

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