Estimating characteristics of queueing networks using transactional data

From MaRDI portal

Revision as of 09:55, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1275380

Jump to:navigation, search

DOI10.1023/A:1019119727465zbMath0914.90115OpenAlexW8449307MaRDI QIDQ1275380

Sergey Zeltyn, Avishai Mandelbaum

Publication date: 17 January 1999

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019119727465

zbMATH Keywords

performance evaluation queues data analysis hidden Markov models queueing networks non-parametric inference queueing inference engine

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (4)

Queue inference from periodic reporting data ⋮ Statistical analysis of single-server loss queueing systems ⋮ Optimization-Based Calibration of Simulation Input Models ⋮ A survey of parameter and state estimation in queues

This page was built for publication: Estimating characteristics of queueing networks using transactional data

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1275380&oldid=13376520"