IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v112y2002i1p123-13810.1023-a1020981005544.html
   My bibliography  Save this article

An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure

Author

Listed:
  • Lothar Breuer

Abstract

Although the concept of Batch Markovian Arrival Processes (BMAPs) has gained widespread use in stochastic modelling of communication systems and other application areas, there are few statistical methods of parameter estimation proposed yet. However, in order to practically use BMAPs for modelling, statistical model fitting from empirical time series is an essential task. The present paper contains a specification of the classical EM algorithm for MAPs and BMAPs as well as a performance comparison to the computationally simpler estimation procedure recently proposed by Breuer and Gilbert. Furthermore, it is shown how to adapt the latter to become an estimator for hidden Markov models. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Lothar Breuer, 2002. "An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure," Annals of Operations Research, Springer, vol. 112(1), pages 123-138, April.
  • Handle: RePEc:spr:annopr:v:112:y:2002:i:1:p:123-138:10.1023/a:1020981005544
    DOI: 10.1023/A:1020981005544
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020981005544
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1020981005544?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Casale, Giuliano & Sansottera, Andrea & Cremonesi, Paolo, 2016. "Compact Markov-modulated models for multiclass trace fitting," European Journal of Operational Research, Elsevier, vol. 255(3), pages 822-833.
    2. Andrzej Chydzinski & Pawel Mrozowski, 2016. "Queues with Dropping Functions and General Arrival Processes," PLOS ONE, Public Library of Science, vol. 11(3), pages 1-23, March.
    3. Mark, Brian L. & Ephraim, Yariv, 2013. "An EM algorithm for continuous-time bivariate Markov chains," Computational Statistics & Data Analysis, Elsevier, vol. 57(1), pages 504-517.
    4. Lin, Lei & Wang, Qian & Sadek, Adel W., 2014. "Border crossing delay prediction using transient multi-server queueing models," Transportation Research Part A: Policy and Practice, Elsevier, vol. 64(C), pages 65-91.
    5. Ramírez-Cobo, Pepa & Carrizosa, Emilio & Lillo, Rosa E., 2021. "Analysis of an aggregate loss model in a Markov renewal regime," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    6. Liu, Baoliang & Cui, Lirong & Wen, Yanqing & Shen, Jingyuan, 2015. "A cold standby repairable system with working vacations and vacation interruption following Markovian arrival process," Reliability Engineering and System Safety, Elsevier, vol. 142(C), pages 1-8.
    7. B. Houdt & J. Velthoven & C. Blondia, 2008. "QBD Markov chains on binomial-like trees and its application to multilevel feedback queues," Annals of Operations Research, Springer, vol. 160(1), pages 3-18, April.
    8. Hautphenne, Sophie & Fackrell, Mark, 2014. "An EM algorithm for the model fitting of Markovian binary trees," Computational Statistics & Data Analysis, Elsevier, vol. 70(C), pages 19-34.
    9. Yera, Yoel G. & Lillo, Rosa E. & Ramírez-Cobo, Pepa, 2019. "Fitting procedure for the two-state Batch Markov modulated Poisson process," European Journal of Operational Research, Elsevier, vol. 279(1), pages 79-92.
    10. Peter Buchholz & Jan Kriege, 2017. "Fitting correlated arrival and service times and related queueing performance," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 337-359, April.
    11. Dimitri frosinin & L. Breuer, 2006. "Threshold policies for controlled retrial queues with heterogeneous servers," Annals of Operations Research, Springer, vol. 141(1), pages 139-162, January.
    12. Nima Manafzadeh Dizbin & Barış Tan, 2019. "Modelling and analysis of the impact of correlated inter-event data on production control using Markovian arrival processes," Flexible Services and Manufacturing Journal, Springer, vol. 31(4), pages 1042-1076, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:112:y:2002:i:1:p:123-138:10.1023/a:1020981005544. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.