Abstract
The problem of tastest finding the moments when the exponential parameter of the Pareto distribution is changed is solved by applying the method of cumulative sums. Analytical expressions for basic characteristics of the method—the average time of delay of the determination of the change-point and the average time between two “incorrect determinations”—are derived. An algorithm of detection of variations in the traffic in a computer network is developed.
Similar content being viewed by others
REFERENCES
Crovella, M. and Bestavros, A., Self-similarity in World Wide Web Traffic: Evidence and Possible Causes, IEEE/ACM Trans. Networking, 1997, no. 6, pp. 835-847.
Park, K., Kim, G., and Crovella, M., On the Relationship between File Sizes, Transport Protocols, and Self-similar Network Trafic, Boston, 1996.
Willinger, W., Paxon, V., and Taqqu, M., Self-similarity and Heavy Tails: Structural Modeling of Network Traf-fic, in A Practical Guide to Heavy Tails: Statistical Techniques and Application, Boston, 1996, pp. 17-53.
Shiryaev, A.N., Statisticheskii posledovatel'nyi analiz (Statistical Sequential Analysis), Moscow: Nauka, 1976.
Mazalov, V.V., Method of Cumulative Sums and Problems of Optimal Control by Technological Processes, Software Eng. Knowledge Eng., 1997, no. 2, pp. 216-229.
Page, E.S., Continuous Inspection Schemes, Biometrika, 1954, no. 41, pp. 100-114.
Shiryaev, A.N., Minimax Optimality of the Cumulative Sums (CUSUM) Method in the Case of Continuous Time, Usp. Mat. Nauk, 1996, vol. 51, no. 4, pp. 173-174.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mazalov, V.V., Zhuravlev, D.N. A Method of Cumulative Sums in the Problem of Detection of Traffic Changes in Computer Networks. Programming and Computer Software 28, 342–348 (2002). https://doi.org/10.1023/A:1021002127252
Issue Date:
DOI: https://doi.org/10.1023/A:1021002127252