# routing-system

A routing system directs network datagrams toward their destinations using routing protocols and information exchanged among gateways and hosts.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## VCF 9.1 VPC Networking, Part 2: IP Blocks, External Connections, Transit Gateways, Subnets, and NAT

DevFeed: [VCF 9.1 VPC Networking, Part 2: IP Blocks, External Connections, Transit Gateways, Subnets, and NAT](<https://devfeed.tech/articles/vcf-9-1-vpc-networking-part-2-ip-blocks-external-connections-transit-gateways-subnets-and-nat-145842.md>)

Original publisher: [Read original article](<https://blogs.vmware.com/cloud-foundation/2026/11/19/vcf-9-1-vpc-networking-part-2-ip-blocks-external-connections-transit-gateways-subnets-and-nat/>)

Author: vmwareblogs

Published: 2026-11-20T06:09:37Z

Content type: article

Language: en

Sources: [VMware](<https://devfeed.tech/sources/vmware-blogs.md>)

Topics: [vcf networking](<https://devfeed.tech/topics/vcf-networking.md>), [NAT and SNAT](<https://devfeed.tech/topics/nat-and-snat.md>), [CIDR and subnets](<https://devfeed.tech/topics/cidr-and-subnets.md>), [VMware Cloud Foundation](<https://devfeed.tech/topics/vcf-9-1.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>)

Tags: [active-directory](<https://devfeed.tech/tags/active-directory.md>), [application](<https://devfeed.tech/tags/application.md>), [avi-load-balancer](<https://devfeed.tech/tags/avi-load-balancer.md>), [back-end](<https://devfeed.tech/tags/back-end.md>), [blocks](<https://devfeed.tech/tags/blocks.md>), [boundary](<https://devfeed.tech/tags/boundary.md>), [broadcom](<https://devfeed.tech/tags/broadcom.md>), [cloud-infrastructure](<https://devfeed.tech/tags/cloud-infrastructure.md>), [communication](<https://devfeed.tech/tags/communication.md>), [data-centre](<https://devfeed.tech/tags/data-centre.md>), [database](<https://devfeed.tech/tags/database.md>), [dhcp](<https://devfeed.tech/tags/dhcp.md>), [external](<https://devfeed.tech/tags/external.md>), [ip](<https://devfeed.tech/tags/ip.md>), [nat](<https://devfeed.tech/tags/nat.md>), [networking](<https://devfeed.tech/tags/networking.md>), [nsx](<https://devfeed.tech/tags/nsx.md>), [subnets](<https://devfeed.tech/tags/subnets.md>), [transit](<https://devfeed.tech/tags/transit.md>), [vcf](<https://devfeed.tech/tags/vcf.md>), [vcf-9-1](<https://devfeed.tech/tags/vcf-9-1.md>), [vcf-platform](<https://devfeed.tech/tags/vcf-platform.md>), [vpc](<https://devfeed.tech/tags/vpc.md>)

### AI overview

VCF 9.1 VPC networking separates address ownership, routing paths and visibility: IP blocks supply addresses, External Connections connect a Transit Gateway to outside networks, and Connectivity Profiles bind that routing and address model to each VPC. Subnets define reach: Private VPC stays within one VPC, Private TGW reaches VPCs on the same Transit Gateway, and Public is reachable from the outside data centre network. NAT provides outbound access or address translation; it does not replace route visibility decisions. The excerpt distinguishes centralized connections through NSX Edge and Tier-0, distributed VLAN connections without Edge nodes or dynamic routing, and distributed VXLAN connections requiring EVPN components in 9.1.1 and later. It also details advertisement controls, project sharing constraints, and design checks for route uniqueness, CIDR overlap, return paths and NAT configuration.

### Source excerpt

Series - Part 2 of 6 The VCF 9.1 VPC Networking Mental Model 1VCF 9.1 VPC Networking, Part 1: From External Connection to VPC 2VCF 9.1 VPC Networking, Part 2: IP Blocks, External Connections, Transit Gateways, Subnets, and NATYou are here 3VCF 9.1 VPC Networking, Part 3: The Distributed Transit GatewayComing soon 4VCF 9.1 VPC ... Continued The post VCF 9.1 VPC Networking, Part 2: IP Blocks, External Connections, Transit Gateways, Subnets, and NAT appeared first on VMware Blogs.

## Software-Defined Internet Integration of Satellite Networks (SDISN)

DevFeed: [Software-Defined Internet Integration of Satellite Networks (SDISN)](<https://devfeed.tech/articles/software-defined-internet-integration-of-satellite-networks-sdisn-146148.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25837>)

Author: Michael Menth, Moritz Fl\\"uchter, Jens Haala

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Software-defined networking](<https://devfeed.tech/topics/sdn.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [gateway](<https://devfeed.tech/topics/gateway.md>), [Internet](<https://devfeed.tech/topics/internet.md>), [network security](<https://devfeed.tech/topics/network-security.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [communication](<https://devfeed.tech/tags/communication.md>), [controller](<https://devfeed.tech/tags/controller.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [gateways](<https://devfeed.tech/tags/gateways.md>), [integration](<https://devfeed.tech/tags/integration.md>), [internet](<https://devfeed.tech/tags/internet.md>), [ip](<https://devfeed.tech/tags/ip.md>), [latency](<https://devfeed.tech/tags/latency.md>), [links](<https://devfeed.tech/tags/links.md>), [network](<https://devfeed.tech/tags/network.md>), [network-design](<https://devfeed.tech/tags/network-design.md>), [networks](<https://devfeed.tech/tags/networks.md>), [orbit](<https://devfeed.tech/tags/orbit.md>), [routing](<https://devfeed.tech/tags/routing.md>), [satellite](<https://devfeed.tech/tags/satellite.md>), [satellites](<https://devfeed.tech/tags/satellites.md>), [security](<https://devfeed.tech/tags/security.md>), [serving](<https://devfeed.tech/tags/serving.md>), [software](<https://devfeed.tech/tags/software.md>), [solution](<https://devfeed.tech/tags/solution.md>)

### AI overview

SDISN addresses changing reachability as user terminals (UTs) and gateways (GWs) switch serving satellites in a fast-moving constellation. GWs and serving satellites encapsulate traffic with forwarding information, which a controller continually updates to reflect serving-satellite changes and possible topology changes. The design aims to keep satellite complexity low, enable traffic engineering, and leave UTs outside the routing system. Proposed extensions support UTs whose traffic must stay within the constellation, and reduce latency from triangle routing through a fixed Home GW when a UT roams. UTs can instead receive dynamic IP addresses from a nearby GW/PoP as they roam. Traffic engineering can use alternate GWs and serving satellites.

### Source excerpt

arXiv:2611.25837v1 Announce Type: new Abstract: This paper proposes SDISN, a software-defined Internet integration of satellite networks. It facilitates the transmission of IP traffic from user terminals (UTs) or Internet nodes over a satellite network with inter-satellite links (ISLs). Gateways (GWs) together with Points of Presence (PoPs) support the transition between the satellite network and the Internet. UTs and GWs connect to the satellite network via serving satellites (SrvSats). As the satellites orbit the Earth at high speed, UTs and GWs frequently change their SrvSats. This causes frequent changes to their reachability, which poses a major challenge for integration. In the proposed solution, GWs and SrvSats encapsulate traffic with forwarding information so that the traffic can be carried over the satellite network towards appropriate SrvSats of UTs or GWs. The forwarding information on the encapsulating nodes is continuously updated by a controller to reflect changed SrvSats and possibly changed topology of the satellite network. Design goals for the proposed architecture were low complexity on satellites, high ability for traffic engineering, and keeping UTs out of the routing system for security and compatibility reasons. UTs may have increased security requirements (ISRs) such that their traffic should be carried within the constellation to avoid non-trusted terrestrial infrastructure. Extensions are proposed to support such ISRs. UTs may obtain either dynamic IP addresses from a nearby GW/PoP wherever they roam or they may obtain static IP addresses from a fixed Home GW/PoP. In the latter case, triangle routing via the Home GW occurs when the UT roams away from the Home GW. As this adds latency to the communication, we investigate architectural extensions for latency reduction. In addition, we show how traffic engineering can be performed in such an architecture with the help of alternate GWs and SrvSats.

## Provable Mixing Properties of Parallel Mixnets Revisited

DevFeed: [Provable Mixing Properties of Parallel Mixnets Revisited](<https://devfeed.tech/articles/provable-mixing-properties-of-parallel-mixnets-revisited-141496.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22732>)

Author: Pierfrancesco Ingo, Peter Druschel, Deepak Garg

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [network security](<https://devfeed.tech/topics/network-security.md>), [tor](<https://devfeed.tech/topics/tor.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [reliability-engineering](<https://devfeed.tech/topics/reliability-engineering.md>)

Tags: [anonymity](<https://devfeed.tech/tags/anonymity.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [differential-privacy](<https://devfeed.tech/tags/differential-privacy.md>), [latency](<https://devfeed.tech/tags/latency.md>), [mixing](<https://devfeed.tech/tags/mixing.md>), [parallel](<https://devfeed.tech/tags/parallel.md>)

### AI overview

The paper analyzes how horizontally scalable parallel mixnets can provide formal message indistinguishability without adding noise or chaff messages. It bounds the variance of an adversary's posterior likelihood of a message's location, then applies concentration bounds to show that, under reasonable operating conditions, the mixnets meet a differential-indistinguishability guarantee with small ε and very small failure probability δ. The model also lets the authors examine trade-offs among anonymity, latency, and per-router bandwidth. The supplied abstract does not give specific operating thresholds or quantitative trade-off results.

### Source excerpt

arXiv:2611.22732v1 Announce Type: new Abstract: A mix-network (mixnet) is a routing network that breaks source-to-destination message trackability by indistinguishably mixing the routes of concurrently transmitted messages, thus providing anonymity to senders, receivers and sender-receiver pairs. Given their potential use in high-stakes scenarios like protecting whistleblowers, one would like to prove formally that sender anonymity holds in a mixnet, even against strong adversaries that can compromise subsets of mixnet servers. However, existing work on anonymity in mixnets is either limited to linear mixnets (which do not scale horizontally), relies on special provisions such as additional noise or chaff messages, or is empirical -- typically based on entropy, which does not provide strong guarantees if the adversary has auxiliary information. In this paper, we present a new analysis of parallel mixnets which scale horizontally, showing that these networks can provide strong indistinguishability for messages even without additional noise messages. Our analysis works by bounding the statistical variance of the adversary's posterior likelihood of where a message of interest is at a given point in time. Using concentration bounds on this distribution, we show that parallel mixnets satisfy $(\varepsilon, \delta)$-differential indistinguishability for messages routed through the mixnet (similar to $(\varepsilon, \delta)$-differential privacy) with very small failure probabilities $\delta$ and small privacy parameters $\varepsilon$ under reasonable operating conditions. Our model also enables an examination of the quantitative trade-off between anonymity, latency and per-router bandwidth in parallel mixnets.

## IZM-DSR: A New Zone-Disjoint Multi-path Routing Algorithm for Mobile Ad-Hoc Network

DevFeed: [IZM-DSR: A New Zone-Disjoint Multi-path Routing Algorithm for Mobile Ad-Hoc Network](<https://devfeed.tech/articles/izm-dsr-a-new-zone-disjoint-multi-path-routing-algorithm-for-mobile-ad-hoc-network-137029.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20165>)

Author: Nastooh Taheri Javan

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [IP routing](<https://devfeed.tech/topics/ip-routing.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [antenna](<https://devfeed.tech/tags/antenna.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [delay](<https://devfeed.tech/tags/delay.md>), [fault-tolerance](<https://devfeed.tech/tags/fault-tolerance.md>), [mobile](<https://devfeed.tech/tags/mobile.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [network](<https://devfeed.tech/tags/network.md>), [overhead](<https://devfeed.tech/tags/overhead.md>), [routing](<https://devfeed.tech/tags/routing.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

IZM-DSR selects zone-disjoint paths for multipath routing in mobile ad hoc networks using omnidirectional antennas. The abstract argues that node-disjoint paths may still experience coupled delays: under neighborhood-dependent medium access such as CSMA/CA, intermediate nodes may need to remain silent while neighbors communicate. Zone-disjoint routing is proposed to address this interaction. Simulations across several scenarios reportedly show reduced routing overhead and end-to-end delay; the excerpt provides no quantitative results or scenario details.

### Source excerpt

arXiv:2611.20165v1 Announce Type: new Abstract: Some of multi-path routing algorithms in MANETs use multiple paths simultaneously. These algorithms can attempt to find node-disjoint to achieve higher fault tolerance. By using node-disjoint paths, it is expected that the end-to-end delay in each case should be independent of each other. However, because of natural properties and medium access mechanisms in ad hoc networks, such as CSMA/CA, the endto-end delay between any source and destination depends on the pattern of communication in the neighborhood region. In this case some of the intermediate nodes should be silent to reverence their neighbors and this matter increases the end-toend delay. To avoid this problem, multi-path routing algorithms can use zone-disjoint paths instead of node-disjoint paths. In this paper we propose a new multi-path routing algorithm that selects zone-disjoint paths, using omnidirectional antenna. We evaluate our algorithm in several different scenarios. The simulation results show that our approach is very effective in decreasing routing overhead and end-to-end delay.

## HERO-D3QN: Inter-Cluster Routing with Energy-Aware Soft Constraints in Wireless Sensor Networks

DevFeed: [HERO-D3QN: Inter-Cluster Routing with Energy-Aware Soft Constraints in Wireless Sensor Networks](<https://devfeed.tech/articles/hero-d3qn-inter-cluster-routing-with-energy-aware-soft-constraints-in-wireless-sensor-networks-127844.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.13943>)

Author: Weihao Wang, Heng Yang, Guangbo Chen, Shanshan Li, Jiulin Guo, Ajay Kaushik, Fangwei Li, Junrui Hao, Sixue Liu

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [routing-system](<https://devfeed.tech/topics/routing-system.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Sustainable Computing](<https://devfeed.tech/topics/sustainable-computing.md>), [IP routing](<https://devfeed.tech/topics/ip-routing.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [adaptive](<https://devfeed.tech/tags/adaptive.md>), [cluster](<https://devfeed.tech/tags/cluster.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [deep](<https://devfeed.tech/tags/deep.md>), [energy](<https://devfeed.tech/tags/energy.md>), [energy-consumption](<https://devfeed.tech/tags/energy-consumption.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [failure](<https://devfeed.tech/tags/failure.md>), [hotspot](<https://devfeed.tech/tags/hotspot.md>), [learning](<https://devfeed.tech/tags/learning.md>), [load](<https://devfeed.tech/tags/load.md>), [network](<https://devfeed.tech/tags/network.md>), [networks](<https://devfeed.tech/tags/networks.md>), [node](<https://devfeed.tech/tags/node.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [progress](<https://devfeed.tech/tags/progress.md>), [relay](<https://devfeed.tech/tags/relay.md>), [routing](<https://devfeed.tech/tags/routing.md>), [sensor](<https://devfeed.tech/tags/sensor.md>), [wireless](<https://devfeed.tech/tags/wireless.md>)

### AI overview

HERO-D3QN combines direction- and cost-based relay screening with adaptive energy-aware soft constraints for inter-cluster wireless sensor routing. A relay below the energy threshold can still be selected if it meets other criteria. Its state representation includes relay energy, sink progress, forwarding load, and hotspot risk, while a multi-objective reward guides learning. Against D3QN on the same node locations, HERO-D3QN delayed first-node death from time step 629 to 1269 and reduced peak residual energy variance by 55.5%. In ablation tests, the full method achieved the latest first- and half-node death and the highest cumulative transmitted volume (170.52 Mbit) among tested variants. Across five seed settings that jointly varied node locations and training and evaluation random processes, reported coefficients of variation were 8.26% for first-node death, 2.75% for half-node death, and 3.88% for transmitted volume.

### Source excerpt

arXiv:2611.13943v1 Announce Type: new Abstract: Inter-cluster forwarding in wireless sensor networks can concentrate energy consumption on frequently selected relays, while hard energy thresholds restrict forwarding choices as residual energy declines. We propose Hierarchical Energy-balanced Routing Optimization based on a dueling double deep Q-network (D3QN), termed HERO-D3QN. Given the cluster structure, the method combines direction- and cost-based relay screening with energy-aware soft constraints. Relays below an adaptive energy threshold remain eligible if the other selection criteria are met. An enhanced state representation captures relay energy, progress toward the sink, potential forwarding load, and hotspot risk, and a multi-objective reward guides learning. In the comparison with D3QN using the same node locations, HERO-D3QN delayed first-node death (FND) from time step 629 to 1269 and reduced peak residual energy variance by 55.5%. In the ablation study, the full method achieved the latest FND and half-node death (HND) and the largest cumulative transmitted volume (170.52 Mbit) among the tested variants. Across five seed settings in which node locations and the random processes used in training and evaluation varied jointly, the coefficients of variation of FND, HND, and transmitted volume were 8.26%, 2.75%, and 3.88%, respectively. These results demonstrate the effectiveness of HERO-D3QN in delaying early node failure and reducing peak energy dispersion.

## Beyond Quantum Messages: Toward Quantum-Native Network Functioning

DevFeed: [Beyond Quantum Messages: Toward Quantum-Native Network Functioning](<https://devfeed.tech/articles/beyond-quantum-messages-toward-quantum-native-network-functioning-121332.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.08298>)

Author: Angela Sara Cacciapuoti, Jessica Illiano, Caterina De Risi, Marcello Caleffi

Published: 2026-11-06T05:00:00Z

Content type: opinion

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Network](<https://devfeed.tech/topics/network.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>)

Tags: [coherence](<https://devfeed.tech/tags/coherence.md>), [coherent](<https://devfeed.tech/tags/coherent.md>), [connectivity](<https://devfeed.tech/tags/connectivity.md>), [control](<https://devfeed.tech/tags/control.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [entanglement](<https://devfeed.tech/tags/entanglement.md>), [functionality](<https://devfeed.tech/tags/functionality.md>), [generation](<https://devfeed.tech/tags/generation.md>), [graph](<https://devfeed.tech/tags/graph.md>), [manipulation](<https://devfeed.tech/tags/manipulation.md>), [network](<https://devfeed.tech/tags/network.md>), [operational](<https://devfeed.tech/tags/operational.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [routing](<https://devfeed.tech/tags/routing.md>), [space](<https://devfeed.tech/tags/space.md>), [spatial](<https://devfeed.tech/tags/spatial.md>), [stateful](<https://devfeed.tech/tags/stateful.md>), [superposition](<https://devfeed.tech/tags/superposition.md>), [time](<https://devfeed.tech/tags/time.md>), [visibility](<https://devfeed.tech/tags/visibility.md>)

### AI overview

The Perspective argues that the Quantum Internet can use quantum phenomena to realize network functions, beyond transporting quantum states and distributing entanglement. It treats entanglement as a changing, non-locally distributed resource that is manipulated or consumed and degrades through decoherence, so its state must be visible to network functions. Two examples illustrate quantum-native functioning: entanglement generated during propagation through coherent spatial-path superposition, and shared entanglement creating operational connectivity that can differ from the physical graph. Quantum Addressing is proposed to represent these relations while complementing classical addressing and signaling. The abstract frames routing, forwarding, control, and functionality placement as areas this broader perspective could affect.

### Source excerpt

arXiv:2611.08298v1 Announce Type: cross Abstract: The Quantum Internet is commonly envisioned as a network that transports quantum states and distributes entanglement as the key resource underpinning distributed quantum applications. This view is necessary but incomplete if quantum phenomena are confined to what the network carries or manages, while network functionalities remain grounded predominantly in classical abstractions. This Perspective advances a broader thesis: quantum phenomena can also participate directly in the realization of network functionalities. We first establish the architectural baseline by introducing entanglement as a stateful network resource whose operational condition is non-locally distributed across remote nodes, evolves through manipulation or consumption, and degrades over time through decoherence. Its evolving state must therefore remain visible to the functionalities acting on it. We then move beyond resource visibility and use two mechanisms as proof points of a broader quantum-native functional design space: entanglement generation during propagation through coherent spatial-path superposition, and operational connectivity induced by shared entanglement that can depart from the physical graph. These examples show that paths, neighbors, or participating nodes may become operationally relevant in ways determined by quantum coherence and shared entanglement, rather than by physical connectivity alone. We identify Quantum Addressing as a transversal abstraction capable of representing such relations while complementing, rather than replacing, classical addressing and signaling. The resulting perspective broadens the Quantum Internet from transporting quantum information and distributing entanglement to exploiting quantum phenomena in network functioning, opening a coupled frontier spanning routing, forwarding, control, and functionality placement.

## ZeroRAG: Adaptive Semantic Peer Routing for Decentralized Retrieval-Augmented Generation

DevFeed: [ZeroRAG: Adaptive Semantic Peer Routing for Decentralized Retrieval-Augmented Generation](<https://devfeed.tech/articles/zerorag-adaptive-semantic-peer-routing-for-decentralized-retrieval-augmented-generation-120269.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.07928>)

Author: Petru Neague, Quinten Stokkink, Martijn de Vos, Rafael Pires, Mathis Randl, Anne-Marie Kermarrec, Johan Pouwelse

Published: 2026-11-06T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>), [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [AI-driven information retrieval](<https://devfeed.tech/topics/ai-driven-information-retrieval.md>), [Vectors & LLMs](<https://devfeed.tech/topics/vectors-llms.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [decentralized](<https://devfeed.tech/tags/decentralized.md>), [generation](<https://devfeed.tech/tags/generation.md>), [peer](<https://devfeed.tech/tags/peer.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [retrieval-augmented-generation](<https://devfeed.tech/tags/retrieval-augmented-generation.md>), [routing](<https://devfeed.tech/tags/routing.md>), [semantic](<https://devfeed.tech/tags/semantic.md>)

### AI overview

ZeroRAG routes RAG queries across peers while documents remain with their owners, avoiding centralized orchestration and globally coordinated data structures. Each peer keeps a bounded set of neighbor advertisements and a cache of recent queries; a best-first walk uses this local state to route queries and gradually rewire the overlay toward semantically relevant peers. The abstract reports tests on three real-world workloads against two decentralized baselines: ZeroRAG improved recall while requiring fewer network messages, approached a centralized store's recall and LLM answer accuracy, recovered after catastrophic peer failures, and scaled to 100,000 peers.

### Source excerpt

arXiv:2611.07928v1 Announce Type: cross Abstract: Retrieval-augmented generation (RAG) is a standard approach to enhance the reliability of large language model (LLM) outputs by retrieving documents relevant to a query and supplying them in the LLM prompt. Today's RAG systems collect, index, and serve these documents from centralized stores. In practice, however, documents are owned by organizations, devices, and individuals who cannot or will not surrender custody of them to a central party, e.g., because of privacy, copyright or regulatory compliance. Existing modern decentralized retrieval techniques either reintroduce a coordinating authority, or rely on a global data structure that requires continuous network-wide coordination (e.g., DHTs). We present ZeroRAG, a decentralized routing layer for document retrieval in RAG that performs semantic query routing across an overlay of peers with- out global data structures or centralized orchestration. Documents remain with the peers that own them, and each peer keeps only lightweight local state: a bounded set of neighbor advertisements and a cache of recently routed queries. Using these, ZeroRAG steers each query through a best-first walk that progressively rewires the overlay toward semantically relevant neighbors, so recall improves over time as the network self-organizes. We evaluate ZeroRAG using three real-world workloads and two decentralized baselines. We find that ZeroRAG outperforms baselines in terms of recall and required network messages, approaches the recall and LLM answer accuracy of a centralized document store, self-heals after catastrophic peer failures, and scales to 100 000 peers.

## Optimal (Randomized) Compact Routing Schemes

DevFeed: [Optimal (Randomized) Compact Routing Schemes](<https://devfeed.tech/articles/optimal-randomized-compact-routing-schemes-116524.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.04744>)

Author: Shiri Chechik, Avi Kadria, Gur Lifshitz, Liam Roditty

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [routing-system](<https://devfeed.tech/topics/routing-system.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Routing (disambiguation)](<https://devfeed.tech/topics/routing.md>)

Tags: [cs-ds](<https://devfeed.tech/tags/cs-ds.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [routing](<https://devfeed.tech/tags/routing.md>)

### AI overview

The paper improves stretch bounds for compact routing in undirected graphs across labeled and name-independent schemes, with average or worst-case local storage. Its main result is a labeled scheme with expected stretch 2k−1 and Õ(n^(1/k)) average storage, where only routing is randomized; under the Erdős girth conjecture, this is optimal up to polylogarithmic storage factors. A deterministic version achieves stretch about 2.47k. For unweighted graphs with worst-case storage, the schemes achieve expected stretch (8k+O(1), O(k)) for name-independent routing and (8/3 k+O(1), O(k)) for labeled routing; deterministic labeled routing reaches about 3.05k. Name-independent routing with average storage achieves expected stretch 4k−5. The unweighted schemes extend to weighted graphs with a small stretch loss.

### Source excerpt

arXiv:2611.04744v1 Announce Type: cross Abstract: Compact routing schemes route messages along short paths while every vertex stores little information. We study the trade-off between the stretch and the storage of compact routing schemes in undirected graphs, in four models: labeled and name-independent schemes, with average or worst-case local storage. We improve the best known stretch in all four models. Our main result is a labeled routing scheme with expected stretch $2k-1$ and $\widetilde O(n^{1/k})$ average local storage, in which only the routing is randomized. Under the Erd\H{o}s girth conjecture, no scheme with this storage has stretch below $2k-1$, so our scheme is optimal, up to polylogarithmic factors in the storage. With deterministic routing, we obtain stretch $\approx2.47k$, the best known deterministic stretch with average storage. Worst-case local storage is the classical setting of compact routing. The leading coefficient $4$ in the stretch $4k-5$ of Thorup and Zwick~[SPAA'01] was improved only by Chechik~[PODC'13], to $\approx3.68$ in unweighted graphs. In unweighted graphs, we obtain expected stretch $(\frac83k+O(1),O(k))$, and deterministic stretch $\approx3.05k$. Name-independent routing is harder, since the source knows only the name of the destination. The best known stretch with $\widetilde O(n^{1/k})$ local storage in unweighted graphs was $96k$, by Abraham, Gavoille, and Malkhi~[DISC'04]. We improve it by more than a factor of $8$. With average storage, we obtain expected stretch $4k-5$, which matches the labeled scheme of Thorup and Zwick. With worst-case storage in unweighted graphs, we obtain expected stretch $(8k+O(1),O(k))$. All our schemes for unweighted graphs extend to weighted graphs with a small loss in the stretch, and still improve the previous unweighted bounds.

## Spatial-Temporal Learning-Based Distributed Routing for Dynamic LEO Satellite Networks

DevFeed: [Spatial-Temporal Learning-Based Distributed Routing for Dynamic LEO Satellite Networks](<https://devfeed.tech/articles/spatial-temporal-learning-based-distributed-routing-for-dynamic-leo-satellite-networks-113842.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2605.02413>)

Author: Po-Heng Chou, Chiapin Wang, Shou-Yu Chen, Hsiang-Ming Wang, Kuan-Fu Chen

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [routing-system](<https://devfeed.tech/topics/routing-system.md>), [AI Networking](<https://devfeed.tech/topics/ai-networking.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Deep learning](<https://devfeed.tech/topics/deep-learning.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [attention](<https://devfeed.tech/tags/attention.md>), [based](<https://devfeed.tech/tags/based.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [deep](<https://devfeed.tech/tags/deep.md>), [delay](<https://devfeed.tech/tags/delay.md>), [delivery](<https://devfeed.tech/tags/delivery.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [distributed-routing](<https://devfeed.tech/tags/distributed-routing.md>), [earth](<https://devfeed.tech/tags/earth.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [features](<https://devfeed.tech/tags/features.md>), [learning](<https://devfeed.tech/tags/learning.md>), [leo](<https://devfeed.tech/tags/leo.md>), [networks](<https://devfeed.tech/tags/networks.md>), [routing](<https://devfeed.tech/tags/routing.md>), [satellite](<https://devfeed.tech/tags/satellite.md>), [spatial](<https://devfeed.tech/tags/spatial.md>), [temporal](<https://devfeed.tech/tags/temporal.md>)

### AI overview

The proposed routing framework lets each satellite choose its next hop from local network-state observations and destination information. It combines a graph attention network to represent changing topology and queue states, an LSTM to capture their evolution over time, and a deep Q-network for routing, without a separate traffic-prediction stage. In simulations of a 45-satellite constellation with normal and bursty traffic, packet delivery was comparable to a GNN-enhanced baseline, but the proposed method had higher delay and queue occupancy. Ablations indicated that spatial and temporal learning each contributed benefits.

### Source excerpt

arXiv:2605.02413v2 Announce Type: replace Abstract: This paper proposes a spatial-temporal learning-based routing framework for dynamic low Earth orbit (LEO) satellite networks. The routing problem is formulated as a partially observable Markov decision process (POMDP), where each satellite independently selects its next hop using network-state observations and destination information. A graph attention network (GAT) extracts spatial features from the dynamic satellite topology and queue states, while a long short-term memory (LSTM) network captures their temporal evolution. The resulting representation is integrated into a deep Q-network (DQN) for destination-aware next-hop selection without a separate traffic-prediction stage. Simulations in a 45-satellite LEO constellation under normal and bursty traffic demonstrate packet delivery performance comparable to a graph neural network (GNN)-enhanced routing baseline, although the proposed method incurs higher delay and queue occupancy. Ablation studies further demonstrate the complementary benefits of spatial and temporal learning.

## Energy-Efficient Geographic Multicast Routing in Cognitive Wireless Sensor Networks

DevFeed: [Energy-Efficient Geographic Multicast Routing in Cognitive Wireless Sensor Networks](<https://devfeed.tech/articles/energy-efficient-geographic-multicast-routing-in-cognitive-wireless-sensor-networks-113859.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.01212>)

Author: Farzan Heidari, Farzaneh Heidari

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [multicast](<https://devfeed.tech/topics/multicast.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [Sustainable Computing](<https://devfeed.tech/topics/sustainable-computing.md>)

Tags: [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [energy](<https://devfeed.tech/tags/energy.md>), [multicast](<https://devfeed.tech/tags/multicast.md>), [networks](<https://devfeed.tech/tags/networks.md>), [routing](<https://devfeed.tech/tags/routing.md>), [sensor](<https://devfeed.tech/tags/sensor.md>), [wireless](<https://devfeed.tech/tags/wireless.md>)

### AI overview

CCast and PCast are geographic multicast protocols for cognitive wireless sensor networks that use local neighbor information and destination coordinates, without a complete topology map. CCast combines multicast-tree construction with a latency-oriented spectrum-selection metric; PCast selects routes using normalized link-power cost and can avoid regions where primary users occupy lower-frequency bands. Simulations report 21% and 26% lower energy consumption than GMP, respectively, at the cost of longer per-destination routes and higher delivery delay.

### Source excerpt

arXiv:2611.01212v1 Announce Type: new Abstract: Energy consumption is a major design concern in wireless sensor networks. Cognitive radio provides opportunistic access to licensed spectrum, while multicast routing allows several destinations to share forwarding paths. In this paper, we propose two geographic multicast routing protocols for cognitive wireless sensor networks, CCast and PCast. CCast combines multicast-tree construction with a latency-oriented spectrum-selection metric. PCast uses a normalized link-power cost to select routes and can avoid regions where primary users occupy lower-frequency bands. Both protocols use local neighbor information and destination coordinates, without requiring a complete network-topology map. Simulations compare the proposed protocols with geographic multicast routing (GMP) and multiple unicast routing. In simulations, CCast and PCast reduce energy consumption by 21\% and 26\% relative to GMP, at the cost of longer per-destination routes and higher delivery delay.

## Garlic in a Box: I2P Network Emulator

DevFeed: [Garlic in a Box: I2P Network Emulator](<https://devfeed.tech/articles/garlic-in-a-box-i2p-network-emulator-101668.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.34004>)

Author: Siddique Abubakr Muntaka, Faiza Hussein, Boutros Farah, Anthony Kashi, Jacques Bou Abdo, Jacques Demerjian

Published: 2026-10-27T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [routing-system](<https://devfeed.tech/topics/routing-system.md>), [IP routing](<https://devfeed.tech/topics/ip-routing.md>), [Network Segmentation](<https://devfeed.tech/topics/network-segmentation.md>)

Tags: [attack](<https://devfeed.tech/tags/attack.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [emulator](<https://devfeed.tech/tags/emulator.md>), [linux](<https://devfeed.tech/tags/linux.md>), [network](<https://devfeed.tech/tags/network.md>), [security-research](<https://devfeed.tech/tags/security-research.md>), [selection](<https://devfeed.tech/tags/selection.md>)

### AI overview

Garlic-in-a-Box emulates isolated networks of unmodified I2P Java routers for reproducible security research. Routers run in Linux network namespaces; filesystem bootstrapping avoids signed reseed servers, while synthetic geographic diversity exercises live-network location-aware peer-selection code. A 50-router deployment across five locations stabilized in about 25 minutes and used roughly 21 GB of memory. In five trials of a modeled reputation attack, the adversary consistently entered the victim's eligible selection set and was selected for 1.38 times as many tunnels as matched controls. The authors say the platform and measurement pipeline are released for research and cyber-defence training.

### Source excerpt

arXiv:2610.34004v1 Announce Type: new Abstract: The Invisible Internet Project (I2P) is a peer-to-peer anonymity network whose routing and peer-selection mechanics underlie a growing family of state-sponsored covert relay architectures. Studying these mechanics demands a controlled, reproducible environment. We present Garlic-in-a-Box, an installable emulator that deploys a fully isolated network of unmodified I2P Java routers on a single host or cluster of hosts. Each router runs in its own Linux network namespace. A filesystem bootstrap removes the dependency on signed reseed servers, and synthetic geographic diversity activates the same location-aware peer-selection code paths present on the live network. A fifty-router deployment across five geographic locations stabilises in about twenty-five minutes and uses roughly 21 GB of memory. To demonstrate the platform's value, we model I2P peer selection as a two-stage process and conduct a reputation attack. Across five independent trials, the attack promotes the adversary into the victim's eligible selection set with perfect consistency, and the adversary is chosen for 1.38x more tunnels than matched controls. The platform and its measurement pipeline are released to support reproducible I2P security research and hands-on cyber-defence training.

## Architecting Secure Identity: Extending Auth0 PrivateLink with Intelligent Gateways

DevFeed: [Architecting Secure Identity: Extending Auth0 PrivateLink with Intelligent Gateways](<https://devfeed.tech/articles/architecting-secure-identity-extending-auth0-privatelink-with-intelligent-gateways-64134.md>)

Original publisher: [Read original article](<https://auth0.com/blog/extending-auth0-privatelink-with-intelligent-gateways/>)

Author: Daryl Martis

Published: 2026-10-02T00:00:00Z

Content type: article

Language: en

Sources: [Auth0 Blog](<https://devfeed.tech/sources/auth0-blog.md>)

Topics: [Auth0](<https://devfeed.tech/topics/auth0.md>), [Amazon VPC](<https://devfeed.tech/topics/amazon-vpc.md>), [Cloud Networking](<https://devfeed.tech/topics/cloud-networking.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>)

Tags: [api-gateway](<https://devfeed.tech/tags/api-gateway.md>), [auth0](<https://devfeed.tech/tags/auth0.md>), [aws-privatelink](<https://devfeed.tech/tags/aws-privatelink.md>), [cloud-native](<https://devfeed.tech/tags/cloud-native.md>), [infrastructure](<https://devfeed.tech/tags/infrastructure.md>), [routing](<https://devfeed.tech/tags/routing.md>), [traffic](<https://devfeed.tech/tags/traffic.md>)

### AI overview

Auth0's Intelligent Gateway pattern routes outbound PrivateLink traffic from one secure tunnel to services in multiple isolated AWS VPCs. Auth0 Actions can add headers, URL paths, or JWT claims that a gateway uses to direct traffic to staging or production environments.

### Source excerpt

Route Auth0 Outbound PrivateLink traffic across multiple isolated VPCs from a single secure tunnel -- using an API Gateway as a fan-out layer with Auth0 Actions for context-based routing.

## Incident Report: September 30, 2026: Domain Routing Disruption

DevFeed: [Incident Report: September 30, 2026: Domain Routing Disruption](<https://devfeed.tech/articles/incident-report-september-30-2026-domain-routing-disruption-95598.md>)

Original publisher: [Read original article](<https://blog.railway.com/p/incident-report-sept-30-2026-routing-disruption>)

Author: Angelo Saraceno

Published: 2026-09-30T22:42:12Z

Content type: news

Language: en

Sources: [Railway](<https://devfeed.tech/sources/railway.md>)

Topics: [incident](<https://devfeed.tech/topics/incident.md>), [Post Mortem](<https://devfeed.tech/topics/post-mortem.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [CI/CD](<https://devfeed.tech/topics/cicd.md>), [Resilience](<https://devfeed.tech/topics/resilience.md>), [Deployment Strategies](<https://devfeed.tech/topics/deployment-strategies.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [disruption](<https://devfeed.tech/tags/disruption.md>), [domain](<https://devfeed.tech/tags/domain.md>), [domains](<https://devfeed.tech/tags/domains.md>), [errors](<https://devfeed.tech/tags/errors.md>), [incident](<https://devfeed.tech/tags/incident.md>), [incident-report](<https://devfeed.tech/tags/incident-report.md>), [minutes](<https://devfeed.tech/tags/minutes.md>), [platform](<https://devfeed.tech/tags/platform.md>), [railway](<https://devfeed.tech/tags/railway.md>), [routing](<https://devfeed.tech/tags/routing.md>), [utc](<https://devfeed.tech/tags/utc.md>)

### AI overview

On September 30, 2026, a rollout race left Railway's distributed routing service querying a database schema that had not yet been updated. Route lookups failed for about five minutes, and origin proxies treated failures like nonexistent domains rather than using the last known route. New connections to Railway-hosted domains returned HTTP 404 in all regions; some private-network lookups also failed. Existing connections and workloads continued running, and Railway reports no data loss. Routing recovered after the migration completed and the service retried its lookups. Planned safeguards include serializing migration rollouts, validating schema compatibility before a binary's blue/green rollout goes live, and adding shard-based regional rollouts to limit impact.

### Source excerpt

Railway experienced a platform-wide disruption to domain routing on September 30, 2026. For roughly five minutes, between about 07:35 and 07:40 UTC, new connections to domains hosted on Railway returned 404 errors.

## The "simple" 38 step journey to getting an RFC

DevFeed: [The "simple" 38 step journey to getting an RFC](<https://devfeed.tech/articles/the-simple-38-step-journey-to-getting-an-rfc-41628.md>)

Original publisher: [Read original article](<https://blog.benjojo.co.uk/post/rfc-in-38-simple-steps>)

Author: ben@benjojo.co.uk

Published: 2024-12-05T10:43:41Z

Content type: opinion

Language: en

Sources: [Benjojo](<https://devfeed.tech/sources/benjojo-blog.md>)

Topics: [Internet Engineering Task Force (IETF)](<https://devfeed.tech/topics/ietf.md>), [protocols](<https://devfeed.tech/topics/protocols.md>), [Network](<https://devfeed.tech/topics/network.md>), [routing-system](<https://devfeed.tech/topics/routing-system.md>), [Internet](<https://devfeed.tech/topics/internet.md>)

Tags: [ietf](<https://devfeed.tech/tags/ietf.md>), [network](<https://devfeed.tech/tags/network.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [rfc](<https://devfeed.tech/tags/rfc.md>), [routing](<https://devfeed.tech/tags/routing.md>), [routing-system](<https://devfeed.tech/tags/routing-system.md>), [tcp](<https://devfeed.tech/tags/tcp.md>), [tcp-ip](<https://devfeed.tech/tags/tcp-ip.md>), [udp](<https://devfeed.tech/tags/udp.md>)

### AI overview

A firsthand account of the three-and-a-half-year process of developing RFC9687 and navigating the Internet Engineering Task Force process. It explains when pursuing IETF standardization is appropriate, including cases involving changes to established protocols that affect the broader Internet routing system.

### Source excerpt

The "simple" 38 step journey to getting an RFC The Internet is built on the mutual understanding of network protocols and practices, and most of those protocols are defined using Request For Comments (RFC) or Best Common Practices (BCP) documents.

## Copilot subscription-based network routing is now enforced

DevFeed: [Copilot subscription-based network routing is now enforced](<https://devfeed.tech/articles/copilot-subscription-based-network-routing-is-now-enforced-72892.md>)

Original publisher: [Read original article](<https://github.blog/changelog/2024-11-04-copilot-subscription-based-network-routing-is-now-enforced>)

Author: Allison

Published: 2024-11-04T16:40:36Z

Content type: release

Language: en

Sources: [GitHub Changelog](<https://devfeed.tech/sources/github-changelog.md>)

Topics: [routing-system](<https://devfeed.tech/topics/routing-system.md>), [IP routing](<https://devfeed.tech/topics/ip-routing.md>), [Opnsense](<https://devfeed.tech/topics/opnsense.md>)

Tags: [all](<https://devfeed.tech/tags/all.md>), [based](<https://devfeed.tech/tags/based.md>), [block](<https://devfeed.tech/tags/block.md>), [business](<https://devfeed.tech/tags/business.md>), [can](<https://devfeed.tech/tags/can.md>), [change](<https://devfeed.tech/tags/change.md>), [connect](<https://devfeed.tech/tags/connect.md>), [copilot](<https://devfeed.tech/tags/copilot.md>), [customers](<https://devfeed.tech/tags/customers.md>), [data](<https://devfeed.tech/tags/data.md>), [ensuring](<https://devfeed.tech/tags/ensuring.md>), [enterprise](<https://devfeed.tech/tags/enterprise.md>), [enterprise-users](<https://devfeed.tech/tags/enterprise-users.md>), [network](<https://devfeed.tech/tags/network.md>), [route](<https://devfeed.tech/tags/route.md>), [routing](<https://devfeed.tech/tags/routing.md>), [subscription](<https://devfeed.tech/tags/subscription.md>), [this](<https://devfeed.tech/tags/this.md>), [user](<https://devfeed.tech/tags/user.md>), [users](<https://devfeed.tech/tags/users.md>)

### AI overview

Copilot requests now route through endpoints tied to the user's subscription: Individual, Business, or Enterprise. Enforcement on the new endpoints allows only Copilot Business users to connect to Business endpoints and only Enterprise users to Enterprise endpoints. Organizations can use firewall rules to allow Business or Enterprise access and block Individual access, helping ensure users on their networks use the organization's subscription and that their data is handled under its agreement.

### Source excerpt

Network requests for Copilot are routed based on a user's Copilot subscription. Requests for Copilot Individual, Copilot Business, and Copilot Enterprise users now route through different endpoints. This change enables...