Skip to main content

Optimal State Estimation in Modulated MAP Event Flows with Unextendable Dead Time

  • Conference paper
Information Technologies and Mathematical Modelling (ITMM 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 487))

Abstract

We consider the optimal estimation problem for the states of a modulated MAP event flow with two states; it is one of the mathematical models for an incoming stream of claims (events) in digital integral servicing networks. The observation conditions for this flow are such that each event generates a period of dead time during which other events from the flow are inaccessible for observation and do not extend the dead time period (unextendable dead time). We find an explicit form for posterior probabilities of the flow states. The decision about the flow state is made with the maximal a posteriori criterion.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kingman, J.F.C.: On Doubly Stochastic Poisson Process. Proceedings of Cambridge Philosophical Society 60(4), 923–930 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  2. Basharin, G.P., Kokotushkin, V.A., Naumov, V.A.: On the Equivalent Substitutions Method for Computing Fragments of Communication Networks. Izv. Akad. Nauk USSR. Tekhn. Kibern. (6), 92–99 (1979)

    Google Scholar 

  3. Basharin, G.P., Kokotushkin, V.A., Naumov, V.A.: On the Equivalent Substitutions Method for Computing Fragments of Communication Networks. Izv. Akad. Nauk USSR Tekhn. Kibern. (1), 55–61 (1980)

    Google Scholar 

  4. Neuts, M.F.: A Versatile Markov Point Process. J. Appl. Probab. 16, 764–779 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lucantoni, D.M.: New Results on the Single Server Queue with a Batch Markovian Arrival Process. Communications in Statistics Stochastic Models 7, 1–46 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dudin, A.N., Klimenok, V.I.: Queueing Systems with Correlated Flows. Belarus Gos. Univ., Minsk (2000)

    Google Scholar 

  7. Apanasovich, V.V., Kolyada, A.A., Chernyavskii, A.F.: Statistical Analysis of Random Flows in a Physical Experiment. Universitetskoe, Minsk (1988)

    Google Scholar 

  8. Khazen, E.M.: Methods of Optimal Statistical Decisions and Optimal Control. Sovetskoe Radio, Moscow (1968)

    Google Scholar 

  9. Gortsev, A.M., Shmyrin, I.S.: Optimal Estimation of States of the Double Stochastic Flow of Events in the Presence of Measurement Errors of Time Instants. Automat. Remote Control 60(1, part 1), 41–51 (1999)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Nezhelskaya, L. (2014). Optimal State Estimation in Modulated MAP Event Flows with Unextendable Dead Time. In: Dudin, A., Nazarov, A., Yakupov, R., Gortsev, A. (eds) Information Technologies and Mathematical Modelling. ITMM 2014. Communications in Computer and Information Science, vol 487. Springer, Cham. https://doi.org/10.1007/978-3-319-13671-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13671-4_39

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13670-7

  • Online ISBN: 978-3-319-13671-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics