ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Segment Routing over IPv6 (SRv6)”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NIEmpiricalRecentJun 26, 2026

Host-Driven Flowlet Balancing with Segment Routing over IPv6

Ryo Nakamura, Hiroki Kano, Tomoko Okuzawa

This paper proposes a host-driven method for flowlet balancing using Segment Routing over IPv6 (SRv6), reducing tail latency by 15% and 33% compared to random flowlet balancing and ECMP, respectively.

View →
cs.CRcs.AIcs.CLRecentApr 16, 2026

Route to Rome Attack: Directing LLM Routers to Expensive Models via Adversarial Suffix Optimization

Haochun Tang, Yuliang Yan, Jiahua Lu, Huaxiao Liu +1 more

The paper introduces R$^2$A, an adversarial attack that uses suffix optimization to mislead black-box LLM routers into consistently selecting expensive, high-capability models.

View →
cs.CRRecentApr 27, 2026

Extended Abstract: Shaperd: Easily Adoptable Real-Time Traffic Shaper for Fully Encrypted Protocols

Sarah Wilson, Stella Tian, Sina Kamali

The paper proposes Shaperd, a real-time traffic shaper designed to enhance the resilience of fully encrypted protocols against censorship by allowing users to generate traffic flows with customizable…

View →
cs.CRRecentMay 30, 2026

One (Thread) Can Keep a (PRNG) Secret, but not Two

Ehood Porat, Amit Klein, Benny Pinkas

The paper details a novel, practical cryptanalytic attack exploiting a race-condition vulnerability in the XNU kernel's IPv6 Fragment ID PRNG, allowing attackers to predict and spoof fragment IDs.

View →
cs.NITheoreticalRecentJun 30, 2026

Latency-Sensitive 5G RAN Slicing for Deterministic Aperiodic Traffic in Smart Manufacturing

M. Carmen Lucas-Estañ, Jan García-Morales, Javier Gozalvez

This paper proposes a new approach for designing Radio Access Network (RAN) slices in 5G and beyond networks using descriptors that consider both transmission rate and latency requirements to support…

View →
cs.LGcs.AREmpiricalRecentJul 22, 2026

AlphaRoute: Large Language Models as Semantic Optimizers for Multi-Objective Routing

Kabir Murjani, Mishri Bhavsar, Manish I. Patel, Jonti Talukdar

This paper presents AlphaRoute, a multi-objective adaptive search framework for VLSI global routing using Large Language Models as semantic policy optimizers.

View →
cs.NIcs.CRcs.DCRecentMay 25, 2026

TIP: A Decentralized Intent-Based Protocol for Declarative IoT Interoperability and Sandboxed Schema Adaptation

Yeison David Mejia Mosquera

TIP introduces a decentralized, declarative protocol that enables flexible IoT interoperability by resolving abstract intents and performing on-the-fly, sandboxed schema adaptation across heterogeneou…

View →
cs.CRRecentApr 17, 2026

ProcRoute: Process-Scoped Authorization of Split-Tunnel Routes

Arul Thileeban Sagayam

ProcRoute is a system that restricts internal network route access to specific, authorized applications, preventing unprivileged processes from exploiting split-tunnel VPN routes.

View →
cs.CGcs.DSTheoreticalRecentJul 3, 2026

Shortest Path Map Equivalence Decompositions and Applications

Haitao Wang

This paper provides new upper bounds and algorithms for the shortest path map equivalence decomposition of a polygonal domain, leading to solutions for two-point shortest path queries, geodesic diamet…

View →
cs.NIEmpiricalRecentJul 24, 2026

Fewer Paths, Better Performance: Understanding the ZCube Topology through Braess's Paradox

Li Chen

The ZCube topology, which eliminates path multiplicity and reduces switching hardware, delivers better performance for large model training and inference than traditional multipath datacenter networks…

View →
cs.NIEmpiricalRecentJun 23, 2026

Overconfident Coordinates: Quantifying Confidence in Traceroute Geolocation

Santiago Klein, Caleb J. Wang, Fabián E. Bustamante

This paper introduces Path Consistency Scoring (PCS), a framework that evaluates router geolocation as a path-level consistency problem and produces a path consistency score based on a Hidden Markov M…

View →
cs.CRcs.NIEmpiricalRecentJul 24, 2026

Cleaning the NTP Pool: Detecting and Mitigating NTP-Sourced IPv6 Scanning

Erik Rye, Robert Beverly

This paper identifies and characterizes NTP Pool servers that harvest IPv6 client addresses and uses them for reconnaissance, port scanning, and service enumeration.

View →
cs.CRcs.AIRecentMay 28, 2026

KBF: Knowledge Boundary as Fingerprint for Language Model and Black-Box API Auditing

Yijia Fang, Yiqing Feng, Bingyu Li, Mingxun Zhou

The paper introduces KBF, a low-cost black-box auditing protocol that fingerprints LLM APIs by analyzing stable numerical recall near the knowledge boundary, successfully detecting numerous model subs…

View →
cs.CRcs.AIRecentMay 28, 2026

KBF: Knowledge Boundary as Fingerprint for Language Model and Black-Box API Auditing

Yijia Fang, Yiqing Feng, Bingyu Li, Mingxun Zhou

The paper introduces KBF, a novel black-box auditing protocol that fingerprints LLM APIs by analyzing stable numerical recall near the knowledge boundary, effectively detecting model substitutions and…

View →
cs.CRRecentMay 20, 2026

Onion-Routed Multi-Circuit Key Establishment for Quantum-Resilient Sessions

Tushin Mallick, Ashish Kundu, Ramana Kompella

The paper proposes a quantum-resilient session-key establishment scheme that fragments a new key across multiple, independently encrypted Tor circuits, requiring an adversary to compromise many circui…

View →
cs.CRcs.AIRecentApr 17, 2026

Privacy-Preserving LLMs Routing

Xidong Wu, Yukuan Zhang, Yuqiong Ji, Reza Shirkavand +2 more

The paper proposes PPRoute, a privacy-preserving LLM routing framework that significantly speeds up secure model selection while maintaining high performance comparable to non-private methods.

View →
cs.DSmath.COmath.OCTheoreticalRecentJun 12, 2026

Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem

Johnson Phosavanh, Dmytro Matsypura

This paper introduces the $k$-Step-Central Shortest Path problem to maximize reachability in transportation networks and provides a polynomial-time algorithm for unweighted graphs.

View →
cs.CRcs.CLcs.IRRecentMay 27, 2026

A Wolf in Sheep's Clothing: Targeted Routing Hijacking in Federated RAG

Junjie Mu, Qiongxiu Li

The paper introduces 'Routing Hijacking,' a severe attack where malicious clients forge semantic profiles in Federated RAG systems to misroute target queries, and proposes a trust-aware post-routing f…

View →