Szczegóły publikacji
Opis bibliograficzny
A time-efficient shrinkage algorithm for the Fourier-based prediction enabling proactive optimisation in software-defined networks / Grzegorz RZYM, Piotr BORYŁO, Piotr CHOŁDA // International Journal of Communication Systems ; ISSN 1074-5351. — 2020 — vol. 33 iss. 12 art. no. e4448, s. 1–20. — Bibliogr. s. 19–20, Summ. — Publikacja dostępna online od: 2020-04-29
Autorzy (3)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 129434 |
|---|---|
| Data dodania do BaDAP | 2020-07-15 |
| Tekst źródłowy | URL |
| DOI | 10.1002/dac.4448 |
| Rok publikacji | 2020 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | International Journal of Communication Systems |
Abstract
This paper focuses on the problem of time-efficient traffic prediction. The prediction enables the proactive and globally scoped optimisation in software-defined networks (SDNs). We propose the shrinkage and selection heuristic method for the trigonometric Fourier-based traffic models in SDNs. The proposed solution allows us to optimise the network for an upcoming time window by installing flow entries in SDN nodes before the first packet of a new flow arrives. As the mechanism is designed to be a part of a sophisticated routing-support system, several critical constraints are considered and taken into account. Specifically, the system is traffic- and topology-agnostic, thus the prediction mechanism must be applicable to the networks with highly variable traffic loads (e.g., observed inside intra-DCNs: datacentre networks). Furthermore, the system must effectively optimise routing in large-scale SDNs comprised of numerous nodes and handling millions of flows of a dynamic nature. Therefore, the prediction must be simultaneously accurate as well as being time efficient and scalable. These requirements are met by our Fourier-based solution, which subtracts consecutive harmonics from the original signal and compares the result with an adaptive threshold adjusted to the signal's standard deviation. The evaluation is performed by comparing the proposed heuristic with the well-known Lasso method of proven accuracy. The results show that our solution is able to retain prediction accuracy at a comparable level. Moreover, in accordance with our main aim, we operate in a manner which is always significantly faster. In some cases, computation times are reduced by as much as 50 times.
