{'fraction_non_alphanumeric': 0.018806214227309895, 'fraction_numerical': 0.0, 'mean_word_length': 5.08955223880597, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Stability and Transient Performance Analysis of TCP with Control Theory

A feedback-based congestion control mechanism is essential to realize an efficient data transfer services in packed-switched networks. TCP (Transmission Control Protocol), a sort of feedback-based congestion control mechanisms, has been widely used in the current Internet. In this thesis, we are devoted to studying a congestion control mechanism of TCP, which controls a congestion level of the network by regulating a window size of a source host according to feedback information obtained from the network. Another version of TCP called TCP Vegas has been proposed and studied in the literature. It can achieve better performance than the current TCP Reno. In previous studies, however, steady-state behavior of a window-based flow control mechanism based on TCP Vegas has been analyzed for a simple network topology. In this thesis, we extend the analysis to a generic network topology where each connection has a different propagation delay and there exists multiple bottleneck links. We first derive equilibrium values of window sizes of TCP connections and the number of packets waiting in a router’s buffer. We also derive throughput of each