Abstract-Multi-path TCP (MP-TCP) has the potential to greatly improve application performance by using multiple paths transparently. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate our algorithm Balia (balanced linked adaptation) which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new algorithm with existing MP-TCP algorithms.

No abstract

Abstract. In this paper, we propose a mechanism to eliminate the performance anomaly of IEEE 802.11b. Performance anomaly happens when nodes that have different transmission rates are in the same wireless cell. All the nodes in the cell might experience the same throughput even though their transmission rates are different because DCF of WLAN provides equal probability of channel access, but it does not guarantee the equal utilization of the wireless channel among the nodes. To reduce such a performance anomaly, we adjust the frame size proportionally depending on the bit rate. Additionally, our scheme eliminates the performance anomaly in multi-hop case. Simulation study shows that our scheme achieves an improvement in the aggregate throughput and the fairness.

No abstract

No abstract

No abstract

No abstract

With the advancement of wireless access networks and mmWave New Radio (NR), new applications emerged, which requires a high data rate. The random packet loss due to mobility and channel conditions in a wireless network is not negligible, which degrades the significant performance of the Transmission Control Protocol (TCP). The TCP has been extensively deployed for congestion control in the communication network during the last two decades. Different variants are proposed to improve the performance of TCP in various scenarios, specifically in lossy and high bandwidth-delay product (high-BDP) networks. Implementing a new TCP congestion control algorithm whose performance is applicable over a broad range of network conditions is still a challenge. In this article, we introduce and analyze a Dynamic TCP (D-TCP) congestion control algorithm over mmWave NR and LTE-A networks. The proposed D-TCP algorithm copes up with the mmWave channel fluctuations by estimating the available channel bandwidth. The estimated bandwidth is used to derive the congestion control factor. The congestion window is increased/decreased adaptively based on the calculated congestion control factor. We evaluated the performance of D-TCP in terms of congestion window growth, goodput, fairness and compared it with legacy and existing TCP algorithms. We performed simulations of mmWave NR during LOS <-> NLOS transitions and showed that D-TCP curtails the impact of under-utilization during mobility. The simulation results and live air experiment points out that D-TCP achieves 32.9% gain in goodput as compared to TCP-Reno and attains 118.9% gain in throughput as compared to TCP-Cubic.