| Full text | |
| Author(s): |
Junior, Ronaldo R. R.
[1]
;
Vieira, Marcos A. M.
[1]
;
Vieira, Luiz F. M.
[1]
;
Loureiro, Antonio A. F.
[1]
Total Authors: 4
|
| Affiliation: | [1] Univ Fed Minas Gerais, Dept Ciencia Comp, Belo Horizonte, MG - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | TELECOMMUNICATION SYSTEMS; v. 79, n. 1 OCT 2021. |
| Web of Science Citations: | 0 |
| Abstract | |
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) | |
| FAPESP's process: | 15/24494-8 - Communications and processing of big data in cloud and fog computing |
| Grantee: | Nelson Luis Saldanha da Fonseca |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 18/23085-5 - ProgNet: networks with programmable data plane |
| Grantee: | Marcos Augusto Menezes Vieira |
| Support Opportunities: | Regular Research Grants |