|Tikhonenko O, Karwacka M.
|Kwiecień A, Gaj P, Stera P.
|Communications in Computer and Information Science
|Busy period characteristics for single server queue with random capacity demands
|We investigate single server queueing systems with batch Poisson arrivals and without demands losses under assumption that each demand has some random capacity (generally, each demand is characterized by l-dimensional indication vector). Service time of the demand arbitrary depends on its capacity (incication). The Laplace-Stieltjes transform of total capacities (random vector of sum of indications) of demands that were served during a busy period of the system is determined.