Vacation queues with Markov schedules Academic Article uri icon

abstract

  • This paper identifies a probability structure for queues that belong to the class of vacation systems operating according to Markov schedules, admitting a wide variety of server scheduling disciplines including most disciplines associated with those M/GI/1/L vacation systems reported in the literature. The conditions that define these schedules are identified, and it is shown that when these conditions are satisfied, queueing behavior is governed by an underlying Markov renewal/semi-regenerative structure. A simple example is examined (the M/GI/1 vacation system with limited batch service) to demonstrate the usefulness and generality of the underlying probability structure.

published proceedings

  • Advances in Applied Probability

author list (cited authors)

  • Wortman, M. A., & Disney, R. L

complete list of authors

  • Wortman, MA||Disney, Ralph L

publication date

  • September 1990