Monotonicity of Generalized Semi-Markov Processes

By viewing networks of queues, and other stochastic systems, as generalized semi-Markov processes, we obtain simple, general conditions for stochastic monotonicity. We consider monotonicity of event epochs (e.g., arrivals, service completions) with respect to clock times (e.g., interarrival times, service times) and with respect to structural parameters, such as buffer size, number of jobs, number of servers.