Abstract:
A system of priority service is analyzed with a discipline of relative priority and an arbitrary number of entry sources. The input flow parameters depend on the queue length . The service rate and performance depend on the queue length at the time of entry arrival. Laplacean transformations of busy period lengths, simultaneous distribution of queue lengths, and unload intervals for entries of various classes are found.
Fulltext:
PDF file (854 kB)