Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Erika Costa Alves

dblp:394/3069 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0005-2498-4715ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Cellular and mobile networks · 61% Software-defined and programmable networks · 30% Network measurement and analytics · 9%
Network and information security
1 paper
Network security · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › SDN threat detection
DDoS detection
0.812024
Evaluation of the Latency of Machine Learning Random Access DDoS Detection in Open RAN · MobiCom 2024
Cellular and mobile networks › radio access networks
Open RAN
0.812024
Evaluation of the Latency of Machine Learning Random Access DDoS Detection in Open RAN · MobiCom 2024
Cellular and mobile networks
radio access networks
0.812024
Evaluation of the Latency of Machine Learning Random Access DDoS Detection in Open RAN · MobiCom 2024
Network security › intrusion detection and prevention
intrusion detection
0.812024
Evaluation of the Latency of Machine Learning Random Access DDoS Detection in Open RAN · MobiCom 2024
Network measurement and analytics
latency measurement
0.212024
Evaluation of the Latency of Machine Learning Random Access DDoS Detection in Open RAN · MobiCom 2024

Methods — techniques the papers use, named apart from their topics

machine learning · 1.5XGBoost · 1.5
YearPublicationVenuePosition
2025 Order, Unite, and Conquer: A Group Formulation for Multi-Armed Bandits in Microservice Provisioning
abstract
Bringing intelligent decision-making to industrial facilities involves coordinating a complex ecosystem of applications with different performance requirements that often depend on each other. A promising approach to managing this complexity is leveraging loosely coupled software architectures, such as microservices, with distributed infrastructures, such as the Edge-to-Cloud Continuum. The order in which microservices are provisioned in the Edge-to-Cloud Continuum can significantly impact outcomes when distributing tasks to agents. Poor provisioning orderings can lead to non-critical microservices overburdening servers with lower latency while leaving latencysensitive microservices with no option but to run on more distant servers. To address this challenge, we introduce a novel provisioning ordering mechanism within a Multi-Armed Bandit (MAB) algorithm, helping to conquer the problem. Simulations based on real-world specifications indicate a $\mathbf{3 8 \%}$ reduction in latency violations and up to 6% decrease in power consumption compared to an unordered approach.
João Vitor Bruniera Labres, Paulo Silas Severo de Souza, Deborah Victória Lima Moreira, Paulo Ricardo Branco da Silva, Michel Bernardo de Paiva, Erika Costa Alves, Layane Menezes Azevedo
PDP6
2024 Evaluation of the Latency of Machine Learning Random Access DDoS Detection in Open RAN
abstract
A testbed with open-source tools and commercial equipment is designed to investigate the timing of ML-based xApp operations in DDoS attack detection during the Random Access procedure. Results show high-precision and high-recall ML classifiers operating faster than the Medium Access Control (MAC) layer's Contention Resolution timer. For classifiers with over 97% precision and recall, XGBoost has the fastest execution time and the narrowest estimated run time probability density function.
Paulo Ricardo Branco da Silva, João Paulo S. H. Lima, Erika Costa Alves, William Sanchez Farfan, Victor Aguiar Coutinho, Thomas William do Prado Paiva, Daniel Lazkani Feferman, Francisco Hugo Costa Neto
MobiCom3