Study of Preemptive Priority Single-server Queue with Peaked Arrival Flow

摘要

A preemptive priority single-server teletraffic system with peaked arrival process and arbitrary departure process is studied in this paper. The peaked arrival process is described by the Polya distribution. A new model of this teletraffic system is, based on a generalized Pollaczek-Khinchin formula. It is shown that the peakedness of the peaked arrival process increases significantly the mean service time of this preemptive priority teletraffic system.