Intra and inter-flow link aggregation in SDN

Autor(es)

Junior, Ronaldo R. R. ^[1] ; Vieira, Marcos A. M. ^[1] ; Vieira, Luiz F. M. ^[1] ; Loureiro, Antonio A. F. ^[1]

Afiliação do(s) autor(es)

^[1] Univ Fed Minas Gerais, Dept Ciencia Comp, Belo Horizonte, MG - Brazil

• Tipo de documento: Artigo Científico
• Fonte: TELECOMMUNICATION SYSTEMS; v. 79, n. 1 OCT 2021.
• Citações Web of Science: 0

Resumo

Link saturation is a problem in computer networks. We propose a link aggregation solution that is robust and solves this problem. The approach consists of creating a virtual link by combining multiple physical interfaces, summing up their bandwidth. Besides increasing the data transmission throughput, this type of solution enables a fast and clear repair in the case of link unavailability. Since Software-Defined Networking usage is increasing daily in business scenarios, this work demonstrates a way to create link aggregation in such situations. This led to the improvement of services availability, among many advantages. To achieve that, we defined and implemented a system with self-adaptive link aggregation. We study the intra-flow and inter-flow link aggregation. To evaluate the implementation, we created three algorithms under different conditions: Virtual Round-Robin, Traffic Analysis, and Hash Table. We evaluated the three algorithms in real-world and virtual scenarios. We used the Ryu controller and, for packet switching, the OVS (Open vSwitch) and BPFabric. Virtual Round-Robin achieved 95% of fairness and Hash Table provided higher throughput. (AU)

• Processo FAPESP: 15/24494-8 - Comunicação e processamento de big data em nuvens e névoas computacionais
• Beneficiário: Nelson Luis Saldanha da Fonseca
• Modalidade de apoio: Auxílio à Pesquisa - Temático
• Processo FAPESP: 18/23085-5 - ProgNet: redes com plano de dados programável
• Beneficiário: Marcos Augusto Menezes Vieira
• Modalidade de apoio: Auxílio à Pesquisa - Regular