Computer Networks

Author: Tikhonenko O.; Karwacka M.; Kwiecień A.; Gaj P.; Stera P.
Book Title: Communications in Computer and Information Science
Year of Publication: 2012
Status: Published
ISBN Number: 978-3-642-31216-8
Publisher: Springer
Chapter: Busy period characteristics for single server queue with random capacity demands
Volume: 291
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.