Exploiting Markov chains to infer queue length from transactional data

DOI10.2307/3214907zbMath0755.60079OpenAlexW2328483302MaRDI QIDQ4021727

L. D. Servi, Daryl J. Daley

Publication date: 16 January 1993

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214907

zbMATH Keywords

Markov chainsqueuecross-couplingtaboo probabilitiestelecommunication network nodes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (4)

Inferring most likely queue length from transactional data ⋮ Queue inference from periodic reporting data ⋮ Estimating effective capacity in Erlang loss systems under competition ⋮ A survey of parameter and state estimation in queues

This page was built for publication: Exploiting Markov chains to infer queue length from transactional data