EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Bayesian Multi-Armed Bandit Algorithm for Dynamic End-to-End Routing in SDN-Based Networks with Piecewise-Stationary Rewards

Pedro Santana, José Moura

Algorithms · 28.04.2023 · 16 (5) · 233

DOI: 10.3390/a16050233 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 28.04.2023. Verfasst von Pedro Santana und 1 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Fundação para a Ciência e Tecnologia (FCT), FCT, European Union (EU).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

To handle the exponential growth of data-intensive network edge services and automatically solve new challenges in routing management, machine learning is steadily being incorporated into software-defined networking solutions. In this line, the article presents the design of a piecewise-stationary Bayesian multi-armed bandit approach for the online optimum end-to-end dynamic routing of data flows in the context of programmable networking systems. This learning-based approach has been analyzed with simulated and emulated data, showing the proposal’s ability to sequentially and proactively self-discover the end-to-end routing path with minimal delay among a considerable number of alternatives, even when facing abrupt changes in transmission delay distributions due to both variable congestion levels on path network devices and dynamic delays to transmission links.

Förderung

  • Fundação para a Ciência e Tecnologia (FCT)
  • FCT
  • European Union (EU)

Zitieren

APA

Santana, P., & Moura, J. (2023). A Bayesian Multi-Armed Bandit Algorithm for Dynamic End-to-End Routing in SDN-Based Networks with Piecewise-Stationary Rewards. Algorithms, 16(5), 233. https://doi.org/10.3390/a16050233

Vancouver

Santana P, Moura J. A Bayesian Multi-Armed Bandit Algorithm for Dynamic End-to-End Routing in SDN-Based Networks with Piecewise-Stationary Rewards. Algorithms. 2023;16(5):233. doi:10.3390/a16050233

BibTeX
@article{Santana2023,
  author = {Santana, Pedro and Moura, José},
  title = {A Bayesian Multi-Armed Bandit Algorithm for Dynamic End-to-End Routing in SDN-Based Networks with Piecewise-Stationary Rewards},
  journal = {Algorithms},
  year = {2023},
  volume = {16},
  number = {5},
  pages = {233},
  doi = {10.3390/a16050233}
}
Kostenlos starten →