CRC4EVER: Cyclic Redundancy Check for Enhanced Verification and Efficient Routing

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 nodelDs 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.

Authors

Institutions

Publication Details

Published
2025-09-08
DOI
https://doi.org/10.1145/3744969.3748446
Primary Topic
Software-Defined Networks and 5G
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CRC4EVER: Cyclic Redundancy Check for Enhanced Verification and Efficient Routing

Moisés R. N. Ribeiro, Fabricio Rodríguez, Everson S. Borges, Magnos Martinello et al.
Software-Defined Networks and 5G
article

CRC4EVER: Cyclic Redundancy Check for Enhanced Verification and Efficient Routing

Moisés R. N. Ribeiro, Fabricio Rodríguez, Everson S. Borges, Magnos Martinello, Christian Esteve Rothenberg, Eduard Marin, Cristina K. Dominicini, Rafael S. Guimarães
article en

Abstract

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 nodelDs 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.

University of Finance and Economics (MN), Instituto de Formación y Estudios Sociales (ES), Telefonica Research and Development (ES), Hospital de Clínicas da Unicamp (BR)
European Commission, Fundação de Amparo à Pesquisa do Estado de São Paulo, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, Conselho Nacional de Desenvolvimento Científico e Tecnológico, HORIZON EUROPE Framework Programme
Openalex Percentile: Top 72%
Software-Defined Networks and 5G
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

CRC4EVER: Cyclic Redundancy Check for Enhanced Verification and Efficient Routing — Moisés R. N. Ribeiro, Fabricio Rodríguez, et al. · (2025) | TGRS Research Map | TGRS