Skip to main content

Joint Probability Density Function of Modulated Synchronous Flow Interval Duration

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

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

Abstract

An explicit form of a probability density function of interval duration between two adjacent events of modulated synchronous doubly stochastic flow is derived. Also an explicit form of a joint probability density function for modulated synchronous flow interval duration is obtained. This flow is one of the mathematical models of information flows, which take place in digital networks with integral service. The flow is considered in stationary mode when there are no transition processes. A recurrent conditions for modulated synchronous flow are obtained using the formula for joint probability density function.

The work is supported by Tomsk State University Competitiveness Improvement Program.

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. Dudin, A.N., Klimenuk, V.N.: Queue systems with correlated flows, p. 175. Belorussian State University, Minsk (2000)

    Google Scholar 

  2. Kingman, J.F.C.: On doubly stochastic Poisson process. Proceedings of Cambridge Phylosophical Society 60(4), 923–930 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  3. Basharin, G.P., Kokotushkin, V.A., Naumov, V.A.: About the method of renewals of subnetwork computation. AN USSR, Techn. Kibernetics 6, 92–99 (1979)

    MathSciNet  Google Scholar 

  4. Neuts, M.F.: A versatile Markov point process. Journal of Applied Probability 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. Communication in Statistics Stochastic Models 7, 1–46 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Card, H.C.: Doubly stochastic Poisson processes in artifical neural learning. IEEE Transactions on Neural Networks 9(1), 229–231 (1998)

    Article  Google Scholar 

  7. Gortsev, A.M., Golofastova, M.N.: Optimal state estimation of modulated synchronous doubly stochastic flow of events. Control, Computation and Informstics, Tomsk State University Journal 2(23), 42–53 (2013)

    Google Scholar 

  8. Sirotina, M.N.: Optimal state estimation of modulated synchronous doubly stochastic flow of events in conditions of fixed dead time. Control, Computation and Informstics, Tomsk State University Journal 1(26), 63–72 (2014)

    Google Scholar 

  9. Bushlanov, I.V., Gortsev, A.M., Nezhel’skaya, L.A.: Estimating parameters of the synchronous twofold-stochastic flow of events. Automation and Remote Control 69(9), 1517–1533 (2008)

    Article  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

Gortsev, A., Sirotina, M. (2014). Joint Probability Density Function of Modulated Synchronous Flow Interval Duration. 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_17

Download citation

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

  • 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