Performance Analysis of a Preemptive Priority Queue With Applications to Packet Communication Systems

We analyze the performance of a preemptive priority queueing system. To make clear at the outset the importance of the particular queueing system studied, we describe the system model in a packet communication context. Specifically, as Fig. 1 illustrates, a number of data sources share a single communication channel. Each source generates, according to a Poisson process, messages consisting of a * AT&T Information Systems.+ Polytechnic Institute of New York. ®Copyright 1983, American Telephone & Telegraph Company. Photo reproduction for noncommercial use is permitted without payment of royalty provided that each reproduction is done without alteration and that the Journal reference and copyright notice are included on the first page. The title and abstract, but no other portions, of this paper may be copied or distributed royalty free by computer-based and other information-service systems without further permission. Permission to reproduce or republish any other portion of this paper must be obtained from the Editor. 3225