Abstract

The article describes queuing systems (QS) with batch request flows, typical for modern multiservice telecommunication networks. It contains generalization of Pollaczek-Khinchin formula for systems with common type flows. We have examined the dependencies of mean queue size at low duty ratio. We have introduced the concept of conditional mean queue size, which is a mean provided that an intervals of processor downtime are absent. We propose algorithm of approximation dependencies queues size in queuing systems with batch requests flows. We consider time delay in queues. We set the ultimate load levels which provide the established queue sizes and time delays.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call