Implementación de algoritmo de asignación de ancho de banda en simulador de redes

Abstract

Abstract: With the increase of devices that connect to data networks, their probability of congestion increases. An alternative to this problem is the transmission of data optimization, which is achieved with a bandwidth allocation algorithm that allows an optimized distribution of the resources available in the network; some of this algorithms are EW-MPTCP, WVEGAS, BBR, BELIA, WBBR, among others. This thesis discourses the most important functionalities of the WBBR algorithm and the results obtained from the simulation in NS-3, the simulation consists on the implementation of the BBR algorithm, these algorithms achieves the transmission of data using the highest bandwidth available and the lowest RTT of the connection. Finally, a comparison of the performance of the WBBR algorithm with its predecessor BBR is presented, the result of this comparison shows that WBBR achieves a higher channel utilization compared to BBR, and it also achieve fairness and load balancing between several routes.