Priority queueing system with fixed-length packet-train arrivals

A discrete-time priority queueing system is studied, in which two different classes of fixed-length packet-trains arrive according to independent batc h geometric streams. The packets in each packet-train arrive at the rate of one packet per slot (train arrivals), resulting in st correlated arrival s tream. The service time of one packet is deterministic of one slot. The mot ivation for the work comes from ATM networks with diverse traffic sources a nd correlated packet arrival stream. Using the probability generating funct ion method, the joint distribution of queue lengths and the waiting time di stribution are obtained for each class. Numerical results are presented. Co mparision is made with the case of 'batch arrivals', where all packets of a packet-train arrive simultaneously at the buffer.