Elsevier

Performance Evaluation

Volume 23, Issue 2, August 1995, Pages 93-106
Performance Evaluation

A bridge between preemptive and non-preemptive queueing models

https://doi.org/10.1016/0166-5316(94)00045-LGet rights and content

Abstract

A preemptive priority MAP, GG1, G21 queue with two types of customers is considered. Here, the priority customers' arrival process follows the Markovian Arrival Process. The relationship between the work load and waiting times of priority and non-priority customers is derived. As a result a new conservation law for the preemptive queue is obtained. Using this law and the waiting times of the preemptive queue, waiting times for a non-preemptive priority queue can be represented.

References (19)

  • P. Franken et al.
  • H. Heffes

    A class of data traffic processes — Covariance function characterization and related queueing results

    Bell Syst. Tech. J.

    (1982)
  • H. Heffes et al.

    A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance

    IEEE J. Select. Areas Comm.

    (1986)
  • N.K. Jaiswal
  • L. Kleinrock
  • D.M. Lucantoni et al.

    Single server queue with server vacations and a class of non-renewal arrival processes

    J. Appl. Prob.

    (1990)
  • F. Machihara

    Completion time of service unit interrupted by PH-Markov renewal customers and its application

  • F. Machihara

    A new approach to the fundamental period of a queue with phase-type Markov renewal arrivals

    Comm. Statist. Stoch. Models

    (1990)
  • F. Machihara

    On the queue with PH-Markov renewal preemptions

    J. Op. Rec. Soc. Japan

    (1993)
There are more references available in the full text version of this article.

Cited by (0)

View full text