Abstract
In the paper some bounds are proved for the mean waising time in reany server queues, especially in M/G/s queues which are more precise than those of KINGMAL and BRUMELLE. For M/G/s queues bounds are given for the probility that an arriving customor has to loss probility in G/M/s loss systems using a semi-ordering relation.

This publication has 9 references indexed in Scilit: