An analog of Little's formula for queueing systems with nonhomogeneous tasks

MaRDI QIDQ1287448zbMATH OpenFDO

Authors Oleg M. Tikhonenko

Publication date 8 November 2000

Published in Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
• scientific article; zbMATH DE number 3894234
• A distributional form of Little's law in heavy traffic
• Little laws for utility processes and waiting times in queues

Cited in

(3)

• Engset formulas for nonhomogeneous non-Markov queueing systems and their application in communication networks
• A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
• Regenerative analysis of a system with a random volume of customers

This page was built for publication: An analog of Little's formula for queueing systems with nonhomogeneous tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1287448)