Fabio Luciano Verdi

Fabio Luciano Verdi

Auto-generated profile, based on publicly available information

Fabio Luciano Verdi

UFSCar

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 February 2023 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
MCMarco Chiesa
Marco Chiesa
FVFábio L. Verdi
Fábio L. Verdi
Programmable switches have been widely used to design network monitoring solutions that operate in the fast data-plane level, e.g., detecting heavy hitters, super-spreaders, computing flow size distributions and their entropy. Many existing works on networking monitoring assume switches deploy a single memory that is accessible by each processed packet. However, high-speed ASIC switches increasingly deploymultiple independent pipes, each equipped with its own independent memory thatcannot be accessed by other pipes. In this work, we initiate the study of deploying existing heavy-hitter data-plane monitoring solutions on multi-pipe switches where packets of a "flow" may spread over multiple pipes, i.e., stored into distinct memories. We first quantify the accuracy degradation due to splitting a monitoring data structure across multiple pipes (e.g., up to 3000x worse flow-size estimation average error). We then present PipeCache, a system that adaptsexisting data-plane mechanisms to multi-pipe switches by carefully storing all the monitoring information of each traffic class into exactly one specific pipe (as opposed to replicate the information on multiple pipes). PipeCache relies on the idea of briefly storing monitoring information into a per-pipe cache and then piggybacking this information onto existing data packets to the correct pipeentirely at data-plane speed. We implement PipeCache on ASIC switches and we evaluate it using a real-world trace. We show that existing data-plane mechanisms achieves accuracy levels and memory requirements similar to single-pipe deployments when augmented with PipeCache (i.e., up to 16x lower memory requirements).

19 January 2022 in Journal of Systems and Software
Verified
Journal Article
Closed access
SSSofia A.M. Silveira
Sofia A.M. Silveira
LZLuciana A.M. Zaina
Luciana A.M. Zaina
LSLeobino N. Sampaio
Leobino N. Sampaio
FVFábio L. Verdi
Fábio L. Verdi

22 May 2023
Verified
Conference Paper
Open access
PDF file
LALeandro C. de Almeida
Leandro C. de Almeida
JSJefferson L. F. da Silva
Jefferson L. F. da Silva
RLRicardo P. Lins
Ricardo P. Lins
PJPaulo Ditarso Maciel Jr.
Paulo Ditarso Maciel Jr.
RPRafael Pasquini
Rafael Pasquini
FVFábio L. Verdi
Fábio L. Verdi
A experimentação é uma etapa imprescindível para muitos tipos de pesquisas científicas, visto que a partir dela o pesquisador pode observar a validade de suas hipóteses. No contexto de redes de computadores, durante a fase de experimentação, é desafiador encontrar geradores de carga que sejam capazes de modelar padrões de tráfego para os mais diversos tipos de aplicações. Neste sentido, este trabalho apresenta o WAVE - uma carga de trabalho para experimentos verificáveis. Tendo como característica ser agnóstico à aplicação, o WAVE foi amplamente executado em testes de carga para aplicações de vídeo sob demanda e armazenamento de chave-valor. Na versão atual, o WAVE é capaz de gerar cargas para dois padrões distintos: sinusoidal e flashcrowd.

10 April 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
FVFabio Luciano Verdi
Fabio Luciano Verdi
HOHelio Tibagi de Oliveira
Helio Tibagi de Oliveira
LSLeobino N. Sampaio
Leobino N. Sampaio
LZLuciana A. M. Zaina
Luciana A. M. Zaina
Over the years, network monitoring tools have evolved to keep pace with the advances in networking technologies and paradigms, such as virtualization and softwarization, and more recently, data plane programmability. However, there have been few advances regarding user interfaces and interactions in network management systems. In this paper, an investigation based on the human-computer interaction perspective is presented and improvements on the usability aspects of network monitoring tools are proposed. First, we conducted a survey to capture general information from network administrator professionals. On the basis of these initial data, we identified and specified two personas to represent the groups of users. Thereafter, a study focused on observing users’ interaction and experience with a well-known network monitoring tool was conducted. Finally, our qualitative analysis revealed several findings that were used to develop recommendations to aid developers in the (re)design of these tools to enhance end-user interaction.

6 June 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
FVFábio L. Verdi
Fábio L. Verdi
GLGustavo V. Luz
Gustavo V. Luz
InFaRR (In-network Fast ReRouting) is an algorithm for fast rerouting in programmable data planes. Implemented in P4, InFaRR is free of additional headers and network state heartbeats. InFaRR has four essential features not jointly found in other recovery mechanisms: Loop prevention, Pushback, Recognition and Restoration and Return to the main route. Tests in standard Fat-Tree and AB Fat-Tree topologies with failures in different scenarios showed positive results when compared to state-of-the-art algorithms in the literature. In scenarios in which the other algorithms were able to recover, InFaRR presented fewer hops to bypass the failure when the Pushback, Loop Prevention and Recognition and Restoration mechanisms were used. In scenarios with multiple failures, InFaRR successfully rerouted where the others algorithms in some cases looped. The mechanism for returning to the main route allows to verify failures in remote links, making it possible to return to the main route without intervention from the control plane. Several evaluations were done comparing the results of InFaRR with the state-of-the art mechanisms, showing the capability of our fast rerouting algorithm in dealing with failures at the line-rate.

28 March 2020
Verified
Book Chapter
Closed access
PDF file
JGJosé A. T. Gavazza
José A. T. Gavazza
JMJuliano Coelho Melo
Juliano Coelho Melo
TSThiago Bueno da Silva
Thiago Bueno da Silva
AAAntonio M. Alberti
Antonio M. Alberti
PRPedro Frosi Rosa
Pedro Frosi Rosa
JSJosé Augusto Suruagy
José Augusto Suruagy