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.
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· 2026 International Conferenc...· 0 citations
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· Proceedings of the 2026 ACM...· 0 citations
Results show that live-metric adaptive path selection yields large throughput gains where path diversity can be exploited and behaves as a safe drop-in replacement for shortest-path forwarding otherwise.
A. Wiranata, Intan Murniasih, Soleman Soleman· JITK (Jurnal Ilmu Pengetahua...· 0 citations
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.· Transactions on Emerging Tel...· 0 citations
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.· International journal of all...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.