Abstract
A class of systems with several non–ordinary Poisson input flows is studied. It is assumed that the flows are conflicting which means they cannot be served simultaneously. A service device carries out control function also. A probabilistic model for the class of the systems is constructed. Easily verifiable conditions of stationarity are determined analytically for two control algorithms: a cyclic algorithm for the homogeneous flows and a feedback algorithm with threshold priority and prolongations for the flows that differs in priority and intensity. A computer simulation model is described. Some examples of determining the quasi-optimal values of the control system parameters are given.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Fedotkin, M., Rachinskaya, M.: Parameters estimator of the probabilistic model of moving batches traffic flow. In: Vishnevsky, V., Kozyrev, D., Larionov, A. (eds.) DCCN 2013. CCIS, vol. 279, pp. 154–168. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05209-0_14
Averill, M.L., Kelton, W.D.: Simulation Modeling and Analysis. McGraw-Hill, New York (2000). p. 760
Matsumoto, M., Nishimura, A.: Dynamic Creation of Pseudorandom Number Generators. In: Monte Carlo and Quasi-Monte Carlo Methods, pp. 56–69 (2000)
Fedotkin, M.A., Rachinskaya, M.A.: Conflicting non-ordinary Poisson flows cyclic control process simulation model. In: Bulletin of the Volga State Academy of Water Transport, no. 47, pp. 43–51 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Rachinskaya, M., Fedotkin, M. (2017). Stationarity Conditions for the Control Systems that Provide Service to the Conflicting Batch Poisson Flows. In: Rykov, V., Singpurwalla, N., Zubkov, A. (eds) Analytical and Computational Methods in Probability Theory. ACMPT 2017. Lecture Notes in Computer Science(), vol 10684. Springer, Cham. https://doi.org/10.1007/978-3-319-71504-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-71504-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71503-2
Online ISBN: 978-3-319-71504-9
eBook Packages: Computer ScienceComputer Science (R0)