Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-23T13:20:23.915Z Has data issue: false hasContentIssue false
  • English
  • Français

COMPARISON OF QUEUES WITH DIFFERENT DISCRETE-TIME ARRIVAL PROCESSES

Published online by Cambridge University Press:  07 February 2001

Arie Hordijk
Arie Hordijk
Affiliation:
Mathematical Institute, University Leiden, Leiden, The Netherlands, E-mail: hordijk@math.leidenuniv.nl
Get access Rights & Permissions [Opens in a new window]

Abstract

Traveling times in a FIFO-stochastic event graph are compared in increasing convex ordering for different arrival processes. As a special case, a stochastic lower bound is obtained for the sojourn time in a tandem network of FIFO queues with a Markov arrival process. A counterexample shows that the extended Ross conjecture is not true for discrete-time arrival processes.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 15 , Issue 1 , January 2001 , pp. 1 - 14
Copyright
© 2001 Cambridge University Press

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.)