| Article ID: | iaor20023516 |
| Country: | United States |
| Volume: | 15 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 14 |
| Publication Date: | Jan 2001 |
| Journal: | Probability in the Engineering and Informational Sciences |
| Authors: | Hordijk A. |
| Keywords: | markov processes |
Traveling times in a first in first out (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.