Skip to content
Book Open access

LARS: Keeping Local Traffic Local with Latency-Aware Route Servers at IXPs

Aug 2026 · Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · pp. 1009-1023 · 1 citation · 27 references
Computer Science

TL;DR

This paper presents LARS, the first system to enable latency-aware path optimization at IXP route servers, which requires no changes to BGP and no bilateral coordination among members, thus directly enabling latency-aware routing for all IXP members.

Abstract

Internet Exchange Points facilitate traffic exchange through Route Servers that use BGP for path selection without considering latency. This paper presents LARS, the first system to enable latency-aware path optimization at IXP route servers. It requires no changes to BGP and no bilateral coordination among members, thus directly enabling latency-aware routing for all IXP members. LARS continuously probes the route-server RIB, annotates routes with RTT-derived BGP communities, and enables members to (i) enforce a configurable latency radius that suppresses high-latency routes and (ii) prefer lower-latency alternatives when multiple paths exist. We evaluate LARS at a very large IXP using a production-level prototype that demonstrates stable latency estimation, effective tail-latency control via selective redistribution, and potential to optimize BGP best paths.

Read PDF

Similar papers

Conference Aug 2026

Distance-Aware Cache Server Placement for Anycast CDNs via Genetic Algorithm

In anycast content delivery networks (CDNs), client requests are naturally routed to the topologically closest cache server (CS) via the border gateway protocol (BGP). However, BGP routing policies frequently cause path inflation, directing clients to geographically distant servers and severely degrading delivery laten...

Futo Masai, Noriaki Kamiyama · 0 citations
Book Open access Oct 2026

Poster: Never via route servers: when filtering affects third-party routes

IXP route servers redistribute routes among members, facilitating multilateral route exchange [3]. A single announcement reaches every member peering with the route server, so a leaked route can propagate to hundreds of networks in one step. Operators therefore filter unsafe routes, including RPKI-invalid origins [1],...

P. Ferreira, Pedro Marcos, Ítalo S. Cunha · 0 citations
Open access 2026

Performance-optimized Opportunistic Routing with Temporal-spatial Awareness and Collaborative Caching

PORTAC is proposed, a historical contact–enhanced collaborative cache routing mechanism integrating contact stability–aware routing and multi-level cache scheduling integrating contact stability–aware routing and multi-level cache scheduling.

Guanghui Wang, Peng Li, Fei Hao et al. · 0 citations
Sep 2026

DIP‐BLS: Dynamic Interaction Planning and BLS Aggregate Signatures for Low‐Latency Data Forwarding in Web 3.0

The decentralized nature of Web 3.0 forms networks of autonomous, heterogeneous entities, including smart contracts and dapp modules, among others, which operate on untrusted infrastructure for interactive communication. In such environments, component churn is frequent, link conditions vary in real time, and the log...

Yang Liu, Zi-Hang Yin, Tong-Tong Cheng et al. · 0 citations
2026

Dynamic Traffic Engineering in SDN: A Topology-Aware Approach to Network Management, Congestion Avoidance, Latency Optimization, and Failure Resilience

This paper proposes SDN-based traffic engineering approach that combines in one control-plane link utilization monitoring, delay-aware path selection and proactive failure recovery, and proposes a greedy congestion and latency aware routing algorithm and a mechanism of pre-computation of backup paths.

M. S., B. M. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.