Conditional average value of queues in queue systems with packet flows of demands

This work considers queuing systems with packet flows of demands featured for modern multiservice telecommunication networks. It presents Pollaczek-Khintchine formula generalization for systems with common type flows. We considered mean queue size dependences under low duty ratio. This work introduces a new term of conditional average value of queue, which is mean value under processor no-downtime condition, and presents algorithm for approximation of queue size dependences in queuing systems with packet flows of demands. Time delay in queues was considered. We defined duty limits, which provide desired queue size and time delays.