Controllable Markov Jump Processes. II. Monitoring and Optimization of TCP Connections


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The article considers the practical application of the analysis and estimation of the controlled Markov jump process states by continuous, discrete, and counting observations in the development of state monitoring algorithms for network connections operating under the Transmission Control Protocol (TCP). A specific feature of the applied problem is the physical heterogeneity of the channel providing the TCP connection under study: along with the wired section, there is a wireless “last mile” of the channel. The current state of the entire connection cannot be directly observed, and there is just indirect statistical information in the form of a flow of acknowledgements of successful packet transmission, as well as packet loss counting processes and timeouts. In this part of the work, not only the controlled stochastic dynamic observation system was used for the mathematical description of the TCP New Reno connection but also the developed high-precision algorithm for tracking this connection state according to the available statistical information. The numerical examples make it possible to define causes of channel losses, such as congestion in the wired section or signal attenuation in the wireless section, and as a result modify the TCP algorithm so as to significantly increase the bandwidth.

About the authors

A. V. Borisov

Institute of Informatics Problems, Russian Academy of Sciences

Author for correspondence.
Email: aborisov@frccsc.ru
Russian Federation, Moscow, 119333

G. B. Miller

Institute of Informatics Problems, Russian Academy of Sciences

Email: aborisov@frccsc.ru
Russian Federation, Moscow, 119333

A. I. Stefanovich

Institute of Informatics Problems, Russian Academy of Sciences

Email: aborisov@frccsc.ru
Russian Federation, Moscow, 119333


Copyright (c) 2019 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies