Abstract

The paper describes queuing systems with batch request flows typical for modern multiservice telecommunication networks. It contains generalization of Pollaczek-Khinchin formula for systems with common type flows. The dependences of queues average value at low duty ratio are examined. Full absence of any queues because of a minimal time interval between nearby requests takes place. The term of conditional average queue size that is an average value with the absence of processor downtime intervals is given.

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