Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-10T09:37:38.320Z 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
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

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