Queue length in a system with an autoregressive hyperexponential incoming flow at a critical load

DOI10.3103/S0278641923040118zbMATH Open1539.60122MaRDI QIDQ6545495FDOQ6545495

Authors: A. K. Bergovin 

Publication date: 29 May 2024

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Recommendations

• On the length of a queue in a mixed priority system under conditions of critical loading
• Limiting expectation time distribution for a critical load in a system with relative priority
• Queue length in an absolute priority system with hyperexponential input flow
• On queue length in a queueing system with Erlang incoming flow

zbMATH Keywords

queue lengthcritical loadrelative priorityPoisson flowrandom intensity

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• The waiting time analysis of a discrete-time queue with arrivals as a discrete autoregressive process of order 1
• The discrete-time queue with autoregressive inputs revisited

Cited In (1)

• On the length of a queue in a mixed priority system under conditions of critical loading

This page was built for publication: Queue length in a system with an autoregressive hyperexponential incoming flow at a critical load

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