SIMULACIÓN EN NS3 DEL PROBLEMA DENOMINADO CUELLO DE BOTELLA COMPARTIDO QUE SE PRESENTA EN EL PROTOCOLO MP-TCP

Abstract

MP-TCP (MultiPath-TCP) is a protocol that allows the sending of data through multiple paths in devices that have several network interfaces. An MP-TCP connection is divided into several TCP connections called subflows, in this way the effective connection rate and the fault resistance can be increased. However, in a scenario where MP-TCP is used with a client and a server, each with a single network interface, you can have the created subflows follow the same path even if several are available; this generates the problem called shared bottleneck. The article describes the development of the C ++ code to simulate the shared bottleneck problem in the NS3 network simulator. The simulation is developed with the DCE (Direct Code Execution) infrastructure for NS3 in such a way that an existing implementation of MP-TCP installed in a Linux kernel can be used. With the developed implementation, tests are performed and the results obtained are presented and discussed, which makes it possible to complement the study and analysis of this problem that MP-TCP suffers from. Among the results, the estimation of the effective transfer rate obtained by varying the number of subflows and roads in scenarios in which the shared bottleneck problem occurs is highlighted.