00847nas a2200169   4500000000100000008004100001260001300042100002000055700001600075700002200091700001400113700001300127245002200140490000800162520048500170020002200655       2012                            d  bSpringer1 aOleg Tikhonenko1 aM. Karwacka1 aAndrzej Kwiecień1 aPiotr Gaj1 aP. Stera00aComputer Networks0 v2913 aWe 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.  a978-3-642-31216-8