Parallelization of EM-Algorithms for Markovian Arrival Processes

DOI10.1007/978-3-030-43024-5_11zbMath1484.68031OpenAlexW3011763781MaRDI QIDQ5014507

Andreas Blume, Peter Buchholz, Jan Kriege

Publication date: 8 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43024-5_11

zbMATH Keywords

EM algorithmparallel algorithmsMarkovian arrival processtraffic modeling

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

A customer service model in an adaptive-modulation mobile communication cell with allowance for random environment

Cites Work

• An EM algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure
• A single-server queue with server vacations and a class of non-renewal arrival processes
• A versatile Markovian point process
• Parallel Prefix Computation
• Computer Performance Evaluation. Modelling Techniques and Tools
• Input Modeling with Phase-Type Distributions and Markov Models
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallelization of EM-Algorithms for Markovian Arrival Processes