Abstract
We analyze a discrete-time priority queue with train arrivals. Messages of a variable number of fixed-length packets belonging to two classes arrive to the queue at the rate of one packet per slot. We assume geometrically distributed message lengths. Packets of the first class have transmission priority over the packets of the other class. By using probability generating functions, some performance measures such as the moments of the packet delay are calculated. The impact of the priority scheduling discipline and the correlation in the arrival process is shown by some numerical examples.
AMS Subject Classification:
ACKNOWLEDGMENT
The first author is a Postdoctoral Fellow with the Fund for Scientific Research, Flanders (F.W.O.-Vlaanderen), Belgium.