Communications in Computer and Information Science
Volume
291
Chapter
Busy period characteristics for single server queue with random capacity demands
Publisher
Springer
ISBN Number
978-3-642-31216-8
Abstract
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.
Historia zmian
Data aktualizacji: 18/02/2016 - 15:10; autor zmian: Piotr Gawron (gawron@iitis.pl)
