Utilize este identificador para referenciar este registo:
http://hdl.handle.net/10071/28693
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Santana, P. | - |
dc.contributor.author | Moura, J. | - |
dc.date.accessioned | 2023-05-24T13:29:58Z | - |
dc.date.available | 2023-05-24T13:29:58Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | 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. http://dx.doi.org/10.3390/a16050233 | - |
dc.identifier.issn | 1999-4893 | - |
dc.identifier.uri | http://hdl.handle.net/10071/28693 | - |
dc.description.abstract | 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. | eng |
dc.language.iso | eng | - |
dc.publisher | MDPI | - |
dc.relation | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F04466%2F2020/PT | - |
dc.relation | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F50008%2F2020/PT | - |
dc.relation | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDP%2F04466%2F2020/PT | - |
dc.rights | openAccess | - |
dc.subject | Networks | eng |
dc.subject | Routing | eng |
dc.subject | Congestion | eng |
dc.subject | Variable link delay | eng |
dc.subject | SDN | eng |
dc.subject | Algorithm design | eng |
dc.subject | Multi-armed bandits | eng |
dc.title | A Bayesian multi-armed bandit algorithm for dynamic end-to-end routing in SDN-based networks with piecewise-stationary rewards | eng |
dc.type | article | - |
dc.peerreviewed | yes | - |
dc.volume | 16 | - |
dc.number | 5 | - |
dc.date.updated | 2023-05-24T14:29:36Z | - |
dc.description.version | info:eu-repo/semantics/publishedVersion | - |
dc.identifier.doi | 10.3390/a16050233 | - |
iscte.identifier.ciencia | https://ciencia.iscte-iul.pt/id/ci-pub-95797 | - |
iscte.journal | Algorithms | - |
Aparece nas coleções: | ISTAR-RI - Artigos em revistas científicas internacionais com arbitragem científica IT-RI - Artigos em revistas científicas internacionais com arbitragem científica |
Ficheiros deste registo:
Ficheiro | Tamanho | Formato | |
---|---|---|---|
article_95797.pdf | 582,65 kB | Adobe PDF | Ver/Abrir |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.