arXiv subjects

Elias P. Duarte Jr

Publications and source records attributed to Elias P. Duarte Jr.

2 recordsLinked to original sources

arXiv2025

VNF-Cache: An In-Network Key-Value Store Cache Based on Network Function Virtualization

With the exponential growth of the amount of data available on the Internet, optimizing the response time and resource usage for data access becomes essential. Caches are an effective solution that brings data closer to clients, eliminating repetitive requests to servers. This paper presents VNF-Cache, a caching service for geographically remote key-value databases. VNF-Cache is an NFV-COIN (Network Function Virtualization-Computing In The Network) service, a technology undergoing standardization by the IETF that enables the implementation of arbitrary services directly in the network. VNF-Cache intercepts network packets, processes, stores, and sends values directly to clients when possible. Through a proof-of-concept implementation and experiments conducted with geographically dispersed servers in Brazil, the United States, and Japan, significant reductions in response time and increases in the number of requests processed per second were observed.

cs.NI↗

arXiv2024

Fast Reroute with Highly Connected Routes Based on Maximum Flow Evaluation

Fault-tolerant routing allows the selection of alternative routes to the destination after the route being used fails. Fast Reroute (FRR) is a proactive strategy through which the protocol pre-configures backup routes that are activated when needed. In this work, we propose the MaxFlowRouting algorithm that employs maximum flow evaluation as well as the route size to select routes that are highly connected. The main advantage of the proposed algorithm is that if any component of such a route fails, there are more alternative paths to the destination in comparison with the route computed with Dijkstra's shortest path algorithm. Simulation results are presented in which we compare the two algorithms (Dijkstra's and MaxFlowRouting) for multiple different random graphs (including Erdos-Renyi, Barábasi-Albert, and Watts-Strogatz) and also for the topologies of some of the most important Internet backbones of the U.S.A., Europe, Brazil, and Japan: Internet2, Geant, RNP, and Wide.

cs.NI↗