Analysis Of Congestion Control In Data Channels With Frequent Frame Loss
Yuri Monakhov, Anna Kuznetsova

TL;DR
This paper develops an analytical model of TCP Reno congestion control to improve network capacity utilization in environments with frequent frame loss, highlighting the importance of effective congestion management.
Contribution
It introduces a differential calculus and queuing system-based analytical model of TCP Reno, focusing on enhancing virtual channel capacity in lossy networks.
Findings
Model accurately describes TCP Reno behavior in lossy environments
Identifies key factors affecting capacity utilization
Provides insights for optimizing congestion control mechanisms
Abstract
Development of optimal control procedures for congested networks is a key factor in maintaining efficient network utilization. The absence of congestion control mechanism or its failure can lead to the lack of availability for certain network segments, and in severe cases -- for the entire network. The paper presents an analytical model describing the operation of the TCP Reno congestion control algorithm in terms of differential calculus and queuing systems. The purpose of this research is to explore the possibilities and ways of increasing the virtual channel capacity utilization efficiency in a lossy environment.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCybersecurity and Information Systems · Distributed and Parallel Computing Systems · Network Traffic and Congestion Control
