Compound TCP will play a central role in future home WiFi networks supporting Internet of Things (IoT) applications. Compound TCP was designed to be fair but can manifest throughput unfairness in infrastructure-based IEEE 802.11 networks when devices at different locations experience different wireless channel quality. In this paper, we develop a comprehensive analytical model for compound TCP over WiFi. Our model captures the flow and congestion control dynamics of multiple competing long-lived compound TCP connections as well as the medium access control layer dynamics (i.e., contention, collisions, and retransmissions) that arise from different signal-to-noise ratios (SNRs) perceived by the devices. Our model provides accurate estimates for TCP packet loss probabilities and steady-state throughputs for IoT devices with different SNRs. More importantly, we propose a simple adaptive control algorithm to achieve better fairness without compromising the aggregate throughput of the system. The proposed real-time algorithm monitors the access point queue, drives the system dynamics to the desired operating point which mitigates the adverse impacts of SNR differences, and accommodates the sporadically transmitting IoT sensors in the system.
We present active measurement results from a commercial IEEE 802.16/WiMAX-based network, with primary focus on TCP performance. We compare four TCP variants, namely New Reno, Cubic, Vegas and Veno, using throughput, round-trip time (RTT), and retransmission rate metrics. While all TCP variants achieve similar throughput, they do so in different ways, with different impacts on the network performance. We identify adverse effects of TCP window auto-tuning in this environment and demonstrate that on the downlink, congestion losses dominate wireless transmission errors. We reveal several issues for this WiMAX-based network, including limited bandwidth for TCP, high RTT and jitter, and unfairness during bidirectional transfers. Such a network environment may be challenging for many wireless Internet applications, such as remote login, VoIP, and video streaming.
Data center networks are characterized by high link speeds, low propagation delays, small switch buffers, and temporally clustered arrivals of many concurrent TCP flows fulfilling data transfer requests. However, the combination of these features can lead to transient buffer overflow and bursty packet losses, which in turn lead to TCP retransmission timeouts that degrade the performance of short-lived flows. This so-called TCP-incast problem can cause TCP throughput collapse. In this paper, we explore an application-level approach for solving this problem. The key idea of our solution is to coordinate the scheduling of short-lived TCP flows so that no data loss happens. We develop a mathematical model of lossless data transmission, and estimate the maximum good put achievable in data center networks. The results indicate non-monotonic good put that is highly sensitive to specific parameter configurations in the data center network. We validate our model using ns-2 network simulations, which show good correspondence with the theoretical results.
In this paper, we compare the throughputs of two different TCP NewReno variants, namely Slow-but-Steady and Impatient. We develop analytic throughput models of these variants as a function of round-trip time, loss event rate, and the burstiness of packet drops within a loss event. Our models build upon prior work on TCP Reno throughput modeling, but extend this work to provide an analytical characterization of the NewReno fast recovery algorithms. We validated our models using the ns-2 simulator. Our models accurately predict the steady-state NewReno throughput for a wide range of loss rates. Based on these models, we analytically determine the preferred operating regions for each TCP variant. Our results show that the Slow-but-Steady variant is comparable to or superior to the Impatient variant in all but the most extreme scenarios for network packet loss.
8 September 2011 in IEEE/ACM Transactions on Networking
This paper develops analytical models that characterize the behavior of on-demand stored media content delivery using BitTorrent-like protocols. The models capture the effects of different piece selection policies, including Rarest-First, two variants of In-Order, and two probabilistic policies (Portion and Zipf). Our models provide insight into system behavior and help explain the sluggishness of the system with In-Order streaming. We use the models to compare different retrieval policies across a wide range of system parameters, including peer arrival rate, upload/download bandwidth, and seed residence time. We also provide quantitative results on the startup delays and retrieval times for streaming media delivery. Our results provide insights into the design tradeoffs for on-demand media streaming in peer-to-peer networks. Finally, the models are validated using simulations.
5 March 2021 in ACM SIGMETRICS Performance Evaluation Review
Network utility maximization (NUM) for Multipath TCP (MPTCP) is a challenging task, since there is no well-defined utility function for MPTCP [6]. In this paper, we identify the conditions under which we can use Kelly's NUM mechanism, and explicitly compute the equilibrium. We obtain this equilibrium by using Tullock's rent-seeking framework from game theory to define a utility function for MPTCP. This approach allows us to design MPTCP algorithms with common delay and/or loss constraints at the subflow level. Furthermore, this utility function has diagonal strict concavity, which guarantees a globally unique (normalized) equilibrium.