| Texto completo | |
| Autor(es): |
Borges, Everson
;
Rodriguez, Fabricio
;
Guimaraes, Rafael Silva
;
Martinello, Magnos
;
Dominicini, Cristina K.
;
Ribeiro, Moises R. N.
;
Marin, Eduard
;
Rothenberg, Christian
Número total de Autores: 8
|
| Tipo de documento: | Artigo Científico |
| Fonte: | PROCEEDINGS OF THE 2025 ACM SIGCOMM 2025 POSTERS AND DEMOS, SIGCOMM 2025; v. N/A, p. 3-pg., 2025-01-01. |
| Resumo | |
This demonstration introduces Cyclic Redundancy Check for Enhanced Verification and Efficient Routing (CRC4EVER). We propose how the Residue Number System (RNS) - a number system that employs a shared secret scheme distributed across network nodes (nodeIDs)- can enable lightweight forwarding and proof-of-transit (PoT) in path-aware networks, relying solely on CRC operations. Our approach leverages an RNS-based source routing, where a routeID encodes the entire packet path. At each hop, the routeID is decoded via simple modulo operations, executed at line rate, by repurposing existing CRC hardware in programmable switches. Furthermore, the unique mapping between the routeID and its corresponding set of nodeIDs provides intrinsic path verifiability via CRC-based hash operations. A proof-of-concept was implemented on programmable Tofino switches, demonstrating the feasibility of executing both routing and path verification at line rate, through table-free CRC operations. (AU) | |
| Processo FAPESP: | 20/05182-3 - PORVIR-5G: programabilidade, orquestração e virtualização em redes 5G |
| Beneficiário: | José Marcos Silva Nogueira |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |
| Processo FAPESP: | 21/00199-8 - Redes e serviços inteligentes rumo 2030 (SMARTNESS) |
| Beneficiário: | Christian Rodolfo Esteve Rothenberg |
| Modalidade de apoio: | Auxílio à Pesquisa - Programa Centros de Pesquisa Aplicada |