Skip to main content
Log in

Robust Filtering Algorithm for Markov Jump Processes with High-Frequency Counting Observations

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We present an algorithm for estimating the state ofMarkov jump processes, given the counting observations. A characteristic feature of the class of considered observation systems is that the frequency of jumps in incoming observations significantly exceeds the intensity of the change of states of the estimated process. This property makes it possible for the filtering algorithm to process incoming observations using their diffusion approximation. The estimates proposed in this work have the stability property concerning inaccurate knowledge of the distribution of the observed process. To illustrate the robust qualities of the estimates, we present a solution for the applied problem of monitoring the state of an RTP connection based on observations of the packet flow recorded at the receiving node.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Liptser, R. and Shiryayev, A., Statistics of Random Processes. II: Applications, New York: Springer-Verlag, 2001.

    Book  Google Scholar 

  2. Liptser, R. and Shiryaev, A., Teoriya martingalov (Theory of Martingales), Moscow: Fizmatlit, 1986.

    MATH  Google Scholar 

  3. Borisov, A., Applying Optimal Filtering Algorithms for Solving the Problem of Monitoring the Accessibility of a Remote Server, Informat. Primen., 2014, vol. 8, no. 3, pp. 34–50.

    Google Scholar 

  4. Borisov, A., Application of Optimal Filtering Methods for On-line of Queueing Network States, Autom. Remote Control, 2016, vol. 77, no. 3, pp. 277–296.

    Article  MathSciNet  Google Scholar 

  5. Cont, R., Stoikov, S., and Talreja, R., A Stochastic Model for Order Book Dynamics, Oper. Res., 2010, vol. 58, no. 3, pp. 549–563.

    Article  MathSciNet  Google Scholar 

  6. Cont, R. and Larrard, A., Price Dynamics in a Markovian Limit Order Market, SIAM J. Financial Math., 2013, vol. 4, no. 3, pp. 1–25.

    Article  MathSciNet  Google Scholar 

  7. Cvitanic, J., Liptser, R., and Rozovskii, B., A Filtering Approach to Tracking Volatility from Prices Observed at Random Times, Ann. Appl. Probab., 2006, vol. 16, pp. 1633–1652.

    Article  MathSciNet  Google Scholar 

  8. Liptser, R. and Zeitouni, O., Robust Diffusion Approximation for Nonlinear Filtering, J. Math. Syst. Est. Control, 1998, vol. 8, no. 3, pp. 1–22.

    MathSciNet  MATH  Google Scholar 

  9. Whitt, W., Stochastic-Process Limits. An Introduction to Stochastic-Process Limits and Their Application to Queues, New York: Springer, 2002.

    Book  Google Scholar 

  10. Kushner, H., Heavy Traffic Analysis of Controlled Queueing and Communication Networks, New York: Springer, 2001.

    Book  Google Scholar 

  11. Kogan, Ya., Liptser, R., and Smorodinskii, A., Gaussian Diffusion Approximation of Markov Closed Models for Computer Communication Networks, Probl. Peredachi Inf., 1986, vol. 22, no. 3, pp. 49–65.

    Google Scholar 

  12. Kogan, Y., Liptser, R., and Shenfild, M., State-Dependent Bene˘s Buffer Model with Fast Loading Output Rates, Ann. Appl. Probab., 1995, vol. 5, no. 3, pp. 97–120.

    Article  MathSciNet  Google Scholar 

  13. Krichagina, E., Liptser, R., and Pukhal’skii, A., Diffusion Approximation for Systems with a Queue-Dependent Input Stream and Arbitrary Servicing, Teor. Veroyat. Primen., 1988, vol. 33, no. 3, pp. 124–135.

    Google Scholar 

  14. Misra, V., Gong, W., and Towsley, D., Fluid-Based Analysis of Network of AQM Routers Supporting TCP Flows with an Application to RED, ACM SIGCOMM Comput. Commun. Rev., 2000, vol. 30, no. 3, pp. 151–160.

    Article  Google Scholar 

  15. Domanska, J., Domanski, A., Czachorski, T., and Klamka, J., Fluid Flow Approximation of Time-Limited TCP/UDP/XCP Streams, B. Pol. Acad. Sci. Tech., 2014, vol. 62, no. 3, pp. 217–225.

    Google Scholar 

  16. Smith, W., Regenerative Stochastic Processes, Proc. Royal Soc. London, Ser. A, Math. Phys. Sci., 1955, vol. 232, no. 3, pp. 6–31.

    MathSciNet  MATH  Google Scholar 

  17. Elliott, R., Aggoun, L., and Moore, J., Hidden Markov Models: Estimation and Control, New York: Springer, 2008.

    MATH  Google Scholar 

  18. Borisov, A., Bosov, A., and Miller, G., Modeling and Monitoring of the VoIP Connection State, Informat. Primen., 2016, vol. 10, no. 3, pp. 2–13.

    Google Scholar 

  19. Korolev, V., EM Algorithm, Its Modifications, and Their Application to the Mixture Density Separation Problem. Theoretical Survey, Moscow: IPI RAN, 2007.

    Google Scholar 

Download references

Funding

This work was supported in part by the Russian Foundation for Basic Research, project no. 19-07-00187 A.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. V. Borisov.

Additional information

This paper was recommended for publication by E.Ya. Rubinovich, a member of the Editorial Board

Russian Text © The Author(s), 2020, published in Avtomatika i Telemekhanika, 2020, No. 4, pp. 3–20.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Borisov, A.V. Robust Filtering Algorithm for Markov Jump Processes with High-Frequency Counting Observations. Autom Remote Control 81, 575–588 (2020). https://doi.org/10.1134/S0005117920040013

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117920040013

Keywords

Navigation