---
title: Dropless Routing in Deterministic Networks
url: https://www.emergentmind.com/topics/dropless-routing
type: topic
---

# Dropless Routing in Deterministic Networks

Dropless routing denotes a class of techniques and architectures that guarantee—within clearly defined system assumptions—zero packet loss (or loss bounded to in-flight packets at microsecond scale) during network failures, reconfiguration, or path changes. The dropless property is fundamental for deterministic networking (DetNet), high-availability fabrics, and ultra-reliable low-latency use cases, and is achieved through fully data-plane rerouting, engineered multipath diversity (1+1 protection), or source-embedded alternate paths. Unlike classical routing methods, which drop packets during control-plane convergence or rely on pre-installed backup state, dropless systems ensure that packets are always forwarded to their destination along a policy-compliant, feasible path, provided connectivity remains.

## 1. Mathematical Foundations and Problem Formulations

At the core of dropless routing for DetNet lies the Delay-Range Constrained Routing (DRCR) problem, formulated as follows: For a network $G = (V,E)$, each link $e\in E$ is assigned a cost $c(e)\geq0$ and delay $d(e)\geq0$. A path $P$ from $s$ to $t$ has total cost $c(P) = \sum_{e\in P} c(e)$ and delay $d(P) = \sum_{e\in P} d(e)$. The DRCR problem is:
\[
\min_{P} c(P) \quad \text{subject to} \quad P \text{ is elementary } s\to t,\; L \leq d(P) \leq U
\]
where $[L, U]$ is an end-to-end delay range. This problem is NP-complete; restriction to $L=0$ yields the classical constrained shortest path problem [2303.00527].

DetNet 1+1 protection layers a further constraint: the selection of two Srlg-disjoint (shared-risk link group) $s\to t$ paths $(P_a, P_b)$ with $d(P_a)\leq U$ and $|d(P_a) - d(P_b)| \leq \delta$, essential to avoid egress packet reordering or buffer overflow during failover.

In decoupled architectures, the dropless guarantee depends on supporting on-the-fly routing with arbitrary dynamic policies, as captured in the forward progress predicate: If a policy-compliant path exists in the failure-pruned network $G-F_0$, all packets reach $t$ without mid-route discard due to topological change [1912.02402].

## 2. Algorithms and Mechanisms for Dropless Operation

### 2.1 Branch-and-Bound Routing: Pulse⁺ and CoSE-Pulse⁺

Pulse⁺ implements an aggressive branch-and-bound DFS for the DRCR problem. The algorithm prunes the search space using two main conditions:

- **Feasibility pruning**: If the cumulative delay of the partial path plus the minimum-delay suffix from the current node to $t$ exceeds $U$, the path is pruned.
- **Optimality pruning**: If the cumulative cost plus minimal remaining cost is no better than the current $tmp\_min$, the path is discarded.

Pulse⁺ disables "dominance" pruning for $L > 0$, preserving full optimal solution space coverage. Partial paths are extended in largest-delay-first order to encourage early discovery of low-cost feasible solutions, expediting global pruning. Pulse⁺ guarantees optimality upon termination [2303.00527].

CoSE-Pulse⁺ generalizes this methodology for the Srlg-disjoint DRCR: it recursively partitions the Srlg inclusion/exclusion space based on detected conflict sets, using Active-Path Pulse⁺ and backup search to jointly construct feasible $(P_a, P_b)$ pairs. The algorithm applies conflict set-driven subproblem splitting, systematically excluding unsatisfiable combinations.

### 2.2 Data-Plane-Only Policy-Compliant Routing: D2R

D2R achieves dropless forwarding in a fundamentally different architectural setting: all routing computation occurs in the data plane. The architecture decomposes into three planes:

- **Policy Plane**: Operators define per-flow path policies. Policies and topology encodings are distributed to the data plane.
- **Switch Control Plane**: Minimal, only responsible for reacting to physical link state changes.
- **Data Plane**: On each packet, programmable ASICs execute a graph traversal (BFS for hop-optimality, or IDDFS for bounded state) starting from the current node, subject to the packet’s failed-link bit vector and switch-local port status. The first discovered policy-compliant path is written into the packet as a source route.

Failure propagation leverages Failure-Carrying-Packets (FCP): packets accumulate a bit vector of observed failures; as they traverse, each switch marks locally failed links, ensuring network-wide failure awareness without broadcast. The algorithm ensures that, as long as some compliant path exists, all packets are rerouted in hardware—dropping only those at in-flight failure instant [1912.02402].

### 2.3 Source-Controlled Alternate Paths: SlickPackets

SlickPackets eliminates forwarding plane dependency by embedding both the primary and alternate paths as a directed acyclic forwarding subgraph (FS) directly in the per-packet header. The FS provides, for each primary path edge, a disjoint alternate to the destination. The receiving router, upon detecting a failed next-hop, immediately transfers the packet to the embedded alternate, with no FIB recomputation or signaling required.

Header size is tightly bounded: for typical large ISP topologies (e.g., Sprint with 315 nodes), median header is $14$–$25$ bytes; even router-level topologies with $191k$ nodes show $<$132 byte headers. For $k$-hop primary paths and $l$-length alternates, $H_{bits} = k(b_\ell + b_c)+ \sum_{i=1}^k l_i b_\ell + b_h$ [1201.1661].

No cycles can arise due to the FS being a DAG, ensuring strict loop-freedom and that forwarding always terminates at $d$ within $|V|$ steps or is dropped only at a bona-fide disconnected failure.

## 3. Empirical Results and Performance Analysis

The empirical evaluation of dropless routing systems reveals substantial superiority in both failover time and completion rates:

| Algorithm         | DRCR Solves (10k nodes) | Srlg-Disjoint Solves (10k nodes) | Typical Runtime          |
|-------------------|------------------------|-------------------------------|--------------------------|
| Pulse⁺           | 100%                   | 100% (CoSE-Pulse⁺)             | <200 ms / <10 ms         |
| Cost-KSP         | ~67%                   | <50%                           | Often >10 s, many time out|
| Delay-KSP        | ~15%                   | <50%                           | Often >10 s              |
| Lagrangian-KSP   | ~95%                   | <50%                           | 10–100× slower than Pulse⁺|

Pulse⁺ and CoSE-Pulse⁺ maintain performance sufficient for real-time control-plane reaction at Internet scale (networks up to $10^4$ nodes), critical for large DetNet fabrics [2303.00527].

D2R achieves sub-microsecond rerouting on physical failure, maintaining throughput at $>99\%$ line-rate. Empirical loss is $<1$ packet per failure, orders of magnitude superior to SDN or OSPF/BGP reconvergence mechanisms (200–1000 ms convergence, hundreds of packets lost). Recirculation requirements are modest (median $1$–$7$ for BFS, $1$–$5$ for IDDFS) even under multiple failures on 70-node topologies [1912.02402].

SlickPackets demonstrates that even for extremely large networks, the compactness of header encoding and immediate local reroute enable $>99.99\%$ delivery under persistent single-link failures. Failure-recovery latency is governed by hardware link failure detection ($<1$ ms) rather than control-plane reaction [1201.1661].

## 4. System Design and Deployment Trade-offs

Dropless routing entails several context-dependent trade-offs:

- **Computation Time**: Branch-and-bound solvers grow super-polynomially in the worst case but are empirically practical for networks with tens of thousands of nodes. Algorithmic engineering (Pulse⁺ pruning, LDF order, hierarchical partitioning) is key [2303.00527].
- **Data-plane Overhead**: D2R requires modest additional header and register state (two 64-bit registers per port; up to $8\times8$-bit per-packet source route; line-rate preserved for up to $10$ recirculations) [1912.02402]. SlickPackets’ encoding overhead is sub-30 bytes in practice but can inflate under $k$-fail alternates [1201.1661].
- **Policy Compliance**: All approaches ensure that path policies (e.g., middle-box chain traversal, weighted next-hop) are strictly enforced, not merely best-effort, during failure scenarios.
- **Legacy Interoperability and Incremental Deployment**: Source-embedded alternate path systems (e.g., SlickPackets) may be difficult to incrementally deploy due to reliance on per-packet encoding and format support. D2R and Pulse⁺-style mechanisms typically require hardware or firmware updates in core routers or switches, but work with standard DetNet/Segment Routing abstractions.

A plausible implication is that dropless architectures impose requirements on network management tooling: policy distribution, topology encoding, and coordination between central controllers and data plane become critical for frictionless operation at scale.

## 5. Implications, Limitations, and Open Problems

Dropless routing realizes the theoretical ideal of convergence-free, lossless packet delivery through path failures, but several limitations and research directions remain:

- **Multifailure Scalability**: Encoding full $k$-fail alternate sets can cause header bloat [1201.1661]. Hierarchical partitioning and area-based routing mitigate recirculation and state growth [1912.02402].
- **Control-plane Stress**: Rapid failure bursts necessitate fast recomputation and distribution of alternate path (FS) structures or updated policies.
- **ASIC/Hardware Feasibility**: Fully hardware-based implementations are empirically demonstrated (D2R on Tofino), but alternative designs (especially source-code-based recoding in SlickPackets) may require further advances in network-processor platforms.
- **Admission Control**: To preserve dropless guarantees under heavy or changing load, admission control is necessary: e.g., link utilization costs are raised dynamically to prevent congestion violating per-path delay/jitter bounds [2303.00527].
- **Queue Management and Cycle Assignment**: Dropless DetNet mandates careful queue-per-cycle allocation (e.g., CSQF), requiring compatible route computation and downstream cycle assignment [2303.00527].

## 6. Research Landscape and Comparative Overview

Research on dropless routing spans centralized (optimal) path-computation engines (Pulse⁺/CoSE-Pulse⁺) [2303.00527], data-plane-only policy-compliant reroute (D2R) [1912.02402], and source-controlled approaches (SlickPackets) [1201.1661], with complementary strengths:

| Approach             | Optimization Target     | Failure Model      | Policy Compliance | Hardware Dependencies        |
|----------------------|------------------------|--------------------|-------------------|-----------------------------|
| Pulse⁺/CoSE-Pulse⁺  | Min-cost delay-bounded | Srlg, arbitrary    | Centralized       | Standard controller + ASICs |
| D2R                  | Policy-compliant path  | Arbitrary          | Per-packet        | P4-programmable ASIC        |
| SlickPackets         | Source-specified FS    | Single-link        | Per-packet        | Labeling, header parsing    |

The emergence of these techniques enables deployment of deterministic, lossless-by-design networks at Internet backbone scale and offers frameworks for future research in multi-failure protection, ultra-low-latency fabrics, and hybrid control/data-plane routing integration.

Source: https://www.emergentmind.com/topics/dropless-routing