betaFeedback

WorksComputer Science

INC-SRv6: In-Network Route Exploration and Fast Failover Using Segment Routing Headers in Dynamic UAV Networks

Abstract

Unmanned aerial vehicle (UAV) networks require a network provisioning mechanism that guarantees delivery and latency quality of service (QoS) under dynamic conditions in next-generation airborne mesh networks by continuously learning and repairing multi-hop paths under rapid link turnover without flooding the control plane. This paper presents INC-SRv6, an in-network computing routing mechanism that repurposes the IPv6 Segment Routing Header (SRH) and its Segments Left (SL) pointer into a self-learning, fast-failover distributed control plane. Rather than treating the SRH as a static source-committed vector, INC-SRv6 uses the active SL pointer to partition the segment list in flight: slots ahead of SL provide capacity for hop-by-hop next-hop recording, while the suffix behind SL serves as an in-band multi-destination reachability vector. Through this dual-zone header discipline, transit routers extract distance-weighted reachability updates from arriving suffixes, gate admission by single-pass confidence with bounded binary probing, advance or reverse SL deterministically, and restore pre-transmission SRH state for local failover upon link loss. Simulations across 200-node 3D UAV networks show that under high-speed flight and repeated 20% relay outages, INC-SRv6 improves packet delivery over reactive routing (92.12% versus 89.12%) while cutting 95th-percentile tail delay from 121.26 to 8.84 ms and control packets by 35.8%, with a 4-byte compact uSID stride model reducing SRv6 control bytes by over 52%.

Introduction

Unmanned aerial vehicle (UAV) swarms provide rapidly deployable, infrastructure-less communication backbones for emergency response, disaster relief, and wide-area sensing [1, 2, 3, 4]. In a large-scale multi-hop aerial mesh, end-to-end connectivity depends on intermediate UAV relays whose geometric positions and operational states change continuously during flight. Even when a source–destination pair remains topologically connected through alternative trajectories, high-speed maneuvers or sudden relay outages can sever active forwarding links on the sub-second timescale. Sustaining reliable low-latency communication and statistical quality-of-service (QoS) guarantees in such dynamic non-terrestrial environments [5] requires a routing architecture that discovers feasible multi-hop paths without broadcast storms, refreshes local forwarding state continuously as contacts evolve, and repairs broken next hops locally without stalling active flows.

Existing routing paradigms struggle to satisfy these requirements simultaneously [6, 7, 8]. Proactive link-state protocols disseminate periodic topology advertisements across the swarm, incurring heavy background overhead while leaving computed paths vulnerable to topological staleness between update intervals. Reactive distance-vector protocols suppress idle overhead by discovering routes on demand, but rely on network-wide request flooding and upstream route-error notifications (RERR) that stall source transmission during link breaks and inflate tail latency into the hundred-millisecond regime. Classical source routing records explicit route vectors during discovery, yet commits each data packet at the source to a fixed end-to-end path that frequently breaks in flight under high mobility. Meanwhile, online reinforcement learning schemes using one-hop delay feedback propagate multi-hop reachability too slowly to track rapid 3D link turnover, whereas continuous multi-agent swarm probing generates prohibitive control packet volumes.

To overcome this fundamental tension, we look to a standardized protocol header already present in modern IPv6 data planes: the Segment Routing Header (SRH, RFC 8754) in Segment Routing over IPv6 (SRv6) [9, 10, 11, 12, 13]. In conventional SRv6 deployments, the SRH is treated as a static, read-only instruction list computed by a centralized controller or link-state database [14, 15]: the source preloads an explicit sequence of 128-bit Segment Identifiers (SIDs) into SRH.segment_list, and transit routers merely decrement the Segments Left (SL) pointer to read the next hop. Under rapid UAV churn, such source-locked segment lists quickly become obsolete.

The central insight of this paper is that the standard RFC 8754 SRH structure, through the interaction between SRH.segment_list and the SL pointer, can be repurposed into a dynamic, in-flight state register for in-network routing computation [16, 17]. While preserving the standard forwarding invariant IPv6.DA=SRH.segment_list[SL]\mathrm{IPv6.DA} = \texttt{SRH.segment\_list[SL]} at every hop, the active SL cursor naturally partitions the segment list into two functional regions during packet traversal. Slots ahead of SL (segment_list[1..SL − 1]) provide pre-allocated capacity where transit routers dynamically record selected next-hop SIDs as they decrement SL, rather than following a rigid source-committed route. Simultaneously, the traversed suffix behind SL (segment_list[SL + 1..LastEntry]) preserves the exact sequence of visited routers. Every arriving packet therefore carries an in-band multi-destination reachability vector: for any suffix index k>SLk > \mathrm{SL}, the receiving router observes that node segment_list[k] is reachable via neighbor segment_list[SL + 1] at an exact hop distance of h=k−SLh = k - \mathrm{SL}.

Building on this dual-zone SRH representation, we propose INC-SRv6, an in-network computing mechanism that unifies distributed route exploration, multi-destination learning, loop-free forwarding, and local fast failover within the SRv6 data plane. In INC-SRv6, transit routers continuously extract distance-attenuated reachability updates for all intermediate nodes in arriving packet suffixes, amortizing discovery traffic across intersecting flows and pre-populating backup next hops before links break. When a source lacks a confident route, it launches a bounded binary exploration wave whose branches exclude nodes already present in their SRH suffix to guarantee loop freedom, while the destination reverses the compacted SRH array once so that the acknowledgment retraces the discovered path strictly by decrementing SL without routing lookups. During subsequent data forwarding, routers make fresh hop-by-hop decisions using locally learned weights; if an outbound link fails just before transmission, the detecting router rolls back the packet’s pre-hop SRH state to expunge the untraversed hop and immediately rewrites an alternate loop-free next hop, avoiding upstream route-error propagation and source rediscovery stalls.

The main contributions of this work are summarized as follows:

  1. Dual-zone SRH state representation for in-network routing: We formulate a unified SRH state representation and pointer discipline that transforms SRH.segment_list and SL from a static source-route header into a dual-zone in-band telemetry and control structure supporting hop-by-hop next-hop recording, multi-destination suffix extraction, loop-free candidate filtering, and lookup-free reverse acknowledgments.

  1. Closed-loop exploration, confidence gating, and local failover: We design a self-learning forwarding mechanism that couples single-pass confidence-calibrated reinforcement (α(h)>θ\alpha(h) > \theta), least-probed binary exploration cloning (≤4\le4 leaves per generation), and pre-transmission SRH snapshot rollback (σ\sigma) for immediate loop-free local repair.

  1. Large-scale 3D UAV network evaluation: Across 1,100 simulation runs spanning 10 mobility and fault scenarios in 200-node 3D UAV networks, we benchmark INC-SRv6 against five protocol families (OSPF-SRv6, OLSR-L3, AODV-L3, Q-Routing-L3, and AntHocNet-L3), four mechanism ablations, and a 4-byte compact uSID variant, quantifying the impact of each design component and demonstrating a 52.1%–54.7% control-byte reduction via 4-byte compact uSID stride encoding.

The remainder of this paper is organized as follows. § 2 reviews related work. § 3 defines the 3D UAV network model and programmable SRH state representation. § 4 details the INC-SRv6 processing workflow. § 5 presents the simulation evaluation, ablation study, and CPU microbenchmark. § 6 concludes the paper.

Related Work

Table 1 summarizes the routing state representations, discovery mechanisms, and failure recovery strategies of representative routing protocols compared with INC-SRv6.

ProtocolRouting stateDiscovery / updatesFailure handling
OSPF-SRv6Local link-state database; source SRHPeriodic LSA disseminationLocal alternate from cached link-state paths
OLSR-L3Two-hop and MPR topologyHELLO and MPR-relayed TCNeighbor expiry and route recomputation
AODV-L3Scalar next-hop and precursor entriesRREQ flood; reverse-hop RREPRERR and source rediscovery
DSRCached route vectors; source-route headerRREQ flood; route-carrying RREPCached-route packet salvaging
Q-Routing-L3Per-destination/neighbor delay estimatesOne-hop feedbackNext-best eligible neighbor
AntHocNet-L3Pheromone tables and recorded agent pathsReactive/proactive probes and diffusionLocal fallback and renewed exploration
INC-SRv6Multi-destination weights from SRH suffixesBounded cloning; reverse-path ACKPre-hop restoration and local next-hop selection

Table 1. Comparison of routing-state representations, discovery mechanisms, and failure handling strategies across protocols. Baseline engineering parameters are specified in § 5.

SRv6 Network Programming and Fast Reroute

Segment Routing over IPv6 (SRv6) encodes forwarding instructions as an ordered list of 128-bit Segment Identifiers (SIDs) inside the Segment Routing Header (SRH, Routing Type 4), using the Segments Left (SL) pointer to index the active segment [9, 10, 11, 18]. Beyond static source-routed traffic engineering and service function chaining embedding [12, 15, 19], SRv6 Network Programming allows transit routers to execute lightweight header inspection, in-band performance monitoring, and state manipulation in eBPF or P4 pipelines [20, 21], while recent IETF standards and micro-SID architectures specify compact SID addressing [22, 23] and compressed segment-list encodings (uSID / NEXT-C-SID) [24] to reduce 128-bit header overhead.

For fault recovery and deterministic low-latency delivery [13], IP Fast Reroute mechanisms such as Loop-Free Alternates (LFA) [25], Topology Independent LFA (TI-LFA) [26], and SDN-assisted UAV architectures [14] precompute backup repair paths from a Link-State Database (LSDB) or centralized controller. However, under rapid 3D UAV mobility and simultaneous multi-relay churn, periodic Link-State Advertisements (LSAs) lag behind sub-second link transitions, causing source-computed SRHs and precomputed TI-LFA repair paths to steer packets into broken links. INC-SRv6 eliminates this dependency on global link-state synchronization by repurposing the SRH itself as an in-flight path-recording and learning structure, updating next-hop weights directly from arriving suffixes and repairing broken links locally.

Routing in Dynamic UAV Networks

Flying Ad Hoc Network (FANET) routing protocols span proactive, reactive, and learning-based designs [1, 2, 3, 6]. Proactive protocols such as OLSR [27] use Multipoint Relays (MPRs) to disseminate Topology Control (TC) messages; while providing immediate lookups in quasi-static topologies, periodic TC snapshots suffer severe blackholing when links change faster than the broadcast interval. Reactive protocols such as AODV [28] discover scalar routes on demand via flooded Route Requests (RREQ) and unicast Route Replies (RREP), using upstream Route Errors (RERR) upon link failure to trigger fresh source flooding. Under repeated relay churn, this drop-invalidate-reflood cycle introduces recurrent discovery stalls that inflate tail latency by an order of magnitude.

Dynamic Source Routing (DSR) [29] records traversed node addresses during discovery for route caching and salvaging, but commits each data packet at the source to a fixed end-to-end route vector that frequently breaks in flight as UAV speed and path length grow. INC-SRv6 differs fundamentally from DSR: (i) rather than locking data packets to source-selected vectors, it converts observed SRH suffixes into normalized per-destination weight tables for fresh hop-by-hop decisions; (ii) it bounds unconfident exploration to a binary tree of at most four leaves rather than network-wide flooding; and (iii) Stage 4 restores the pre-transmission SRH snapshot before local rerouting so failed hops never pollute the recorded suffix.

Reinforcement learning and swarm-intelligence protocols replace rigid tables with adaptive estimates [7, 8, 30, 31, 32, 33]. Q-Routing and recent multi-agent FANET extensions [7, 8, 30, 32, 33] update neighbor quality estimates via one-hop feedback, which bootstraps multi-hop reachability by only a single hop per transmission and converges too slowly under 3D mobility without external geographic beacons. AntHocNet [31] accelerates convergence via reactive/proactive ants and neighbor pheromone diffusion, but incurs millions of control packets in 200-node swarms. INC-SRv6 achieves rapid multi-hop convergence without swarm flooding by extracting up to Hmax⁡H_{\max} destination updates per arriving SRH suffix and calibrating its single-pass reinforcement step so that one validated acknowledgment immediately opens the source confidence gate.

In-Network Computing and Path-Carried State

In-network computing (INC) shifts state processing and inference into forwarding elements [16, 17, 34], while In-band Network Telemetry (INT) and its low-overhead variants [35, 36] append device state to packets for passive monitoring. INC-SRv6 turns this in-band state paradigm into an active, closed-loop routing control plane built entirely within standard RFC 8754 SRH fields: every packet’s traversed SRH suffix acts as a multi-destination reachability vector, and each router executes a four-stage pipeline that learns from the suffix, gates or branches outbound traffic, updates the SL pointer, and repairs local link failures in place.

System Model and SRv6 Header State Representation

3D Dynamic UAV Network Pure-L3 Model

We consider a pure network-layer (L3) model of N=200N = 200 airborne SRv6 routers V={0,1,…,N−1}\mathcal{V} = \{0, 1, \ldots, N - 1\} moving inside a 3D operational volume A=[0,1500]\mathcal{A} = [0, 1500] m ×\times [0,1500][0, 1500] m ×\times [0,300][0, 300] m (Figure 1), capturing rapid 3D aerial mobility and link transitions characteristic of emergency UAV deployments [37]. Each UAV u∈Vu \in\mathcal{V} follows a continuous, piecewise-linear 3D random waypoint trajectory pu(t)∈A\mathbf{p}_u(t) \in\mathcal{A} under nominal speed profiles vnom∈{15,25,35,45}v_{\mathrm{nom}} \in\{15, 25, 35, 45\} m/s (sampling per-leg speeds uniformly from [10,20][10, 20], [20,30][20, 30], [30,40][30, 40], and [35,50][35, 50] m/s, respectively).

3D dynamic UAV mesh network scenario

Figure 1. 3D dynamic UAV mesh network scenario (N=200N = 200 UAVs in 1500×1500×3001500 \times1500 \times300 m airspace, R=220R = 220 m L3 contact range) experiencing a central L3 relay/link outage zone. Bounded EXPLORE packets (split_rem = 2, solid blue arrows, ≤4\le4 leaf branches) detour around the outage while recording traversed SIDs into SRH.segment_list[SL]. Destination DD returns a deterministic unicast SRH-ACK (dashed magenta arrows) along IPv6.DA = SRH.segment_list[SL], and high-confidence DATA packets (solid green arrows) forward along the reinforced trajectory.

Connectivity between operational UAVs (u,v)(u, v) is governed by a contact range R=220R = 220 m:

E(t)={(u,v)∈V×V∣u≠v, up⁡u(t)=1, up⁡v(t)=1, ∥pu(t)−pv(t)∥2≤R},(1)\mathcal{E}(t) = \{(u,v) \in\mathcal{V} \times\mathcal{V} \mid u \ne v,\ \operatorname{up}_u(t) = 1,\ \operatorname{up}_v(t) = 1,\ \lVert\mathbf{p}_u(t) - \mathbf{p}_v(t) \rVert_2 \le R\}, \tag*{(1)}

where up⁡u(t)∈{0,1}\operatorname{up}_u(t) \in\{0,1\} denotes operational state. Because flight legs are piecewise-linear, exact link up/down boundary times at ∥pu(t)−pv(t)∥2=R\lVert\mathbf{p}_u(t) - \mathbf{p}_v(t) \rVert_2 = R are solved analytically via quadratic root finding for O(1)O(1) L3 link-state queries. Each directed link provides a 10 Mbps rate, 20 μ\mus processing delay, distance-dependent propagation delay, and a 128-packet FIFO queue. Link availability is checked at both enqueue and dequeue: failure at either check invokes Stage 4 local repair while the packet remains at the sender, whereas a break after dequeue causes an in-transit loss. In practical airborne wireless interfaces, this sender-side check corresponds to hardware transmit-failure callbacks (e.g., missing link-layer acknowledgment or fast BFD/beacon loss notification) while the pre-transmission header snapshot σ\sigma is retained in the transmit ring buffer.

Programmable SRH Path-State Representation and Byte-Accounting Model

INC-SRv6 operates within a trusted, homogeneous airborne SRv6 domain consistent with RFC 8754 [10], where all participating UAV routers implement the domain-local header conventions defined below. Every INC-SRv6 packet carries an outer IPv6 header (40 bytes) followed by a Segment Routing Header (SRH, Routing Type 4, 8-byte fixed header plus populated SID entries), as illustrated in Figure 2. Throughout forwarding, the Segments Left (SL) pointer satisfies the RFC 8754 invariant [10]:

INC-SRv6 in-network SRH and SL pointer dual-zone state mechanism across a three-hop path, showing forward exploration/data traversal from S through A and B to D with upstream route learning, and reverse SRH-ACK traversal from D through B and A to S with downstream multi-destination learning

Figure 2. INC-SRv6 in-network SRH and SL pointer dual-zone state mechanism across a three-hop path. (a) Forward EXPLORE/DATA traversal (S→A→B→DS \rightarrow A \rightarrow B \rightarrow D): relays decrement SL, write the selected next-hop SID into segment_list[SL], compact unused slots upon direct delivery to DD (see Table 2 for slot indices), and execute Stage 1 upstream route learning from the accumulated suffix ([S]→[A,S]→[B,A,S][S] \rightarrow[A,S] \rightarrow[B,A,S] at hop distances h=1,2,3h = 1, 2, 3). (b) Reverse SRH-ACK traversal (D→B→A→SD \rightarrow B \rightarrow A \rightarrow S): destination DD reverses the compacted array once, and each returning hop decrements SL deterministically without routing lookups while extracting multi-destination downstream routes from the suffix.

IPv6.DA=SRH.segment_list[SL],SRH.segment_list[0]=Target SID.(2)\mathrm{IPv6.DA} = \mathrm{SRH.segment\_list}[\mathrm{SL}], \qquad\mathrm{SRH.segment\_list}[0] = \text{Target SID}. \tag*{(2)}

To record paths up to Hmax⁡=16H_{\max} = 16 hops, a router allocates a 17-slot logical segment array. A forward packet originated by source SS toward target DD places DD at index 0, SS at index 16 (LastEntry = 16), and sets SL = 16. As the packet traverses the network, the suffix [SL..16] records visited routers in order, while unpopulated slots [1..SL − 1] provide local capacity for subsequent hops. At each transit relay, the router decrements SL and writes the selected next-hop SID into segment_list[SL]; when the selected next hop is the final target DD, unused intermediate slots are compacted out and SL is set to 0. Packet mode (EXPLORE, ACK, or DATA) and remaining split budget (b∈{0,1,2}b \in\{0, 1, 2\}) occupy domain-local bits of the 8-bit SRH Flags field, while the generation identifier (tracked as a monotonic 32-bit integer in the simulator) maps on the wire via modulo-2162^{16} reduction into the 16-bit SRH.Tag field (65,536 active generations far exceeding in-flight lifetime).

On the wire, only populated SID entries (NpopN_{\mathrm{pop}}) are serialized and charged bandwidth within the airborne SR domain:

LastEntrywire=Npop−1,SLwire={1,active hop differs from target,0,final hop,(3)\mathrm{LastEntry}_{\mathrm{wire}} = N_{\mathrm{pop}} - 1, \qquad \mathrm{SL}_{\mathrm{wire}} = \begin{cases} 1, & \text{active hop differs from target},\\ 0, & \text{final hop}, \end{cases} \tag*{(3)}

which maps back for forward packets at the receiving router to the logical pointer SL = 18−Npop18 - N_{\mathrm{pop}} when SLwire=1\mathrm{SL}_{\mathrm{wire}} = 1 (intermediate relay hop) and SL = 0 when SLwire=0\mathrm{SL}_{\mathrm{wire}} = 0 (final destination hop). A reverse ACK reverses the compacted segment array once at DD and decrements SL in place along the return path. The simulator maintains the logical SRH state transitions and charges exact serialized wire bytes and transmission times according to

Bwire=40+8+Bstride⋅Npop+Bpayload,(4)B_{\mathrm{wire}} = 40 + 8 + B_{\mathrm{stride}} \cdot N_{\mathrm{pop}} + B_{\mathrm{payload}}, \tag*{(4)}

with Bpayload=512B_{\mathrm{payload}} = 512 bytes for DATA and 0 bytes for EXPLORE/ACK. Standard INC-SRv6 uses 128-bit SIDs (Bstride=16B_{\mathrm{stride}} = 16 bytes), whereas INC-SRv6-uSID models a 4-byte compact locator stride (Bstride=4B_{\mathrm{stride}} = 4 bytes, abstracting 128-bit carrier boundary padding to isolate per-segment identifier width) [22, 23, 24]. Non-SRv6 baseline data packets carry the 40-byte IPv6 header plus 512-byte payload (552 bytes). Table 2 traces the logical and wire SRH states across a three-hop traversal S→A→B→DS \rightarrow A \rightarrow B \rightarrow D and its returning acknowledgment D→B→A→SD \rightarrow B \rightarrow A \rightarrow S.

HopLogical SLWire SLOutbound segment listSplit budgetBytes 16B / 4B
S→AS \rightarrow A151[D,A,S][D,A,S]196 / 60
A→BA \rightarrow B141[D,B,A,S][D,B,A,S]0112 / 64
B→DB \rightarrow D00[D,B,A,S][D,B,A,S]0112 / 64
D→BD \rightarrow B (ACK)22[S,A,B,D][S,A,B,D]0112 / 64
B→AB \rightarrow A (ACK)11[S,A,B,D][S,A,B,D]0112 / 64
A→SA \rightarrow S (ACK)00[S,A,B,D][S,A,B,D]0112 / 64

Table 2. Forward exploration and reverse acknowledgment header states. Byte columns give 128-bit / 4-byte-stride sizes with zero payload.

Proposed INC-SRv6 Four-Stage Packet and SL Pointer Workflow

Overview of the Four-Stage Processing Pipeline

Each INC-SRv6 router u∈Vu \in\mathcal{V} maintains a local neighbor set Nu(t)\mathcal{N}_u(t) (discovered via periodic link-local multicast HELLO beacons every 1.0 s with a 3.2 s expiration timeout evaluated on maintenance ticks) and a local normalized routing weight table wu(d,v)∈[0,1]w_u(d,v) \in[0,1] for each known destination d≠ud \ne u and active neighbor v∈Nu(t)v \in\mathcal{N}_u(t), satisfying ∑v∈Nu(t)wu(d,v)=1\sum_{v \in\mathcal{N}_u(t)} w_u(d,v) = 1. In addition, router uu tracks the learned hop distance hu(d,v)h_u(d,v), last reinforcement timestamp tlast(u,d)t_{\mathrm{last}}(u,d), and local repair status repairu(d)\mathrm{repair}_u(d) per destination.

Algorithm 1 gives normal packet processing; Algorithm 2 handles failed egress attempts. Stage 1 runs on arrival, Stage 2 selects forward next hops, Stage 3 writes the selected hop or advances an ACK, and Stage 4 restores and repairs a failed forward transmission. The predicate confident(d,C)(d,C) requires d∉repairud \notin\mathrm{repair}_u and max⁡v∈Cwu(d,v)>θ\max_{v \in C} w_u(d,v) > \theta.

Algorithm 1. Packet processing at router uu

Require: Packet pp, target dd, mode mm, and local routing state

  1. if pp arrives from a neighbor then

    1. Reconcile neighbors, age accessed rows, and learn suffix (Stage 1)

    2. Release non-expired pending DATA whose routes are confident

    3. end if

  2. if u=du=d then

    1. if m=DATAm=\mathrm{DATA} then

      1. Deliver payload

    2. else if m=EXPLOREm=\mathrm{EXPLORE} and first arrival of this generation then

      1. Reverse path; initialize ACK at SL = L−1L-1

      2. Enqueue ACK to its active hop with no rollback snapshot

    3. end if

    4. return

  3. end if

  4. if m=ACKm=\mathrm{ACK} then

    1. Decrement SL; enqueue to the indexed hop; return ▷ Stage 3

  5. end if

  6. if m=EXPLOREm=\mathrm{EXPLORE} and generation already forwarded then

    1. return

  7. end if

  8. If EXPLORE, mark generation forwarded; compute candidates CC (Stage 2)

  9. if C=∅C=\varnothing then

    1. Buffer source DATA; drop transit packet; return

  10. end if

  11. if m=DATAm=\mathrm{DATA} then

    1. if uu is source and route is unconfident then

      1. Buffer DATA; request cooldown-gated exploration; return

    2. end if

    3. Select best candidate; refresh confident-route activity

    4. If relay is unconfident, request exploration (250 ms cooldown)

  12. else if route is confident and uu is a transit relay then

    1. Select best candidate without consuming split budget

  13. else

    1. Rank by probe count, rounded weight, and seeded random tie-break

    2. Select two candidates if budget permits, otherwise one

    3. Increment selected probe counts; clone and reduce budget if splitting

  14. end if

  15. for all selected packet/next-hop pairs (q,v)(q,v) do

    1. If HopLimit ≤0\le0 or (v≠dv\ne d and SL ≤1\le1), drop qq; continue

    2. Save pre-hop snapshot σ\sigma; advance header toward vv (Stage 3)

    3. Enqueue (q,v,σ)(q,v,\sigma); check link at enqueue and dequeue

  16. end for

Algorithm 2. Egress-failure callback (Stage 4)

Require: Failed next hop vv, packet pp, target dd, pre-hop snapshot σ\sigma

  1. Remove vv; age and renormalize weights; mark target dd for repair

  2. if pp is ACK or σ\sigma is absent then

    1. Drop pp; return

    2. end if

  3. Restore the complete snapshot σ\sigma

  4. Recompute loop-free candidates CC from the restored history

  5. if pp is EXPLORE then

    1. Set split budget to zero and retain generation identity

    2. if C=∅C = \varnothing then

      1. Drop pp; return

      2. end if

    3. Select best candidate v′v'; if Stage 3 hop/SL bound fails, drop pp and return

    4. Save snapshot, advance toward v′v' (Stage 3), and enqueue checked transmission

  6. else if C=∅C = \varnothing then

    1. Buffer source DATA; drop relay DATA

  7. else if uu is the DATA source then

    1. Buffer DATA; originate exploration with cooldown bypass

  8. else

    1. Originate exploration with cooldown bypass; select best candidate v′v'

    2. If Stage 3 hop/SL bound fails, drop pp and return

    3. Save snapshot, advance relay DATA toward v′v' (Stage 3), and enqueue transmission

    4. end if

Stage 1: Ingress SRH Suffix Learning (Multi-Hop Path Extraction)

Before looking up or updating destination dd, router uu reconciles weight row wu(d,⋅)w_u(d,\cdot) with its active neighbor set Nu(t)\mathcal{N}_u(t) and applies lazy exponential aging toward the uniform prior 1/m1/m (m=∣Nu(t)∣m = |\mathcal{N}_u(t)|) over idle interval Δt=t−tlast(u,d)\Delta t = t - t_{\mathrm{last}}(u,d):

wu(d,v)←1m+(wu(d,v)−1m)exp⁡(−Δtτ),∀v∈Nu(t),(5)w_u(d,v) \leftarrow\frac{1}{m} + \left(w_u(d,v) - \frac{1}{m}\right)\exp\left(-\frac{\Delta t}{\tau}\right), \qquad\forall v \in\mathcal{N}_u(t), \tag*{(5)}

with τ=8.0\tau= 8.0 s, followed by normalization ∑v∈Nu(t)wu(d,v)=1\sum_{v\in\mathcal{N}_u(t)} w_u(d,v) = 1. If uu has forwarded DATA toward dd on a confident route within the preceding 250 ms activity window, aging on dd is suspended and tlast(u,d)t_{\mathrm{last}}(u,d) is refreshed. When knewk_{\mathrm{new}} new neighbors join Nu(t)\mathcal{N}_u(t) while uu holds a confident non-repair route to dd (d∉repairud \notin\mathrm{repair}_u and wmax⁡=max⁡vwu(d,v)>θw_{\max} = \max_v w_u(d,v) > \theta), their combined prior share is capped at min⁡(knew/m,0.08,max⁡(0,1−(θ+0.02)/wmax⁡))\min(k_{\mathrm{new}}/m, 0.08, \max(0, 1 - (\theta+ 0.02)/w_{\max})) to preserve the θ+0.02\theta+ 0.02 confidence margin.

For each arriving suffix index k>SLk > \mathrm{SL}, let xk=segment_list[k]x_k = \texttt{segment\_list}[k] denote the learned destination, vprev=segment_list[SL+1]v_{\mathrm{prev}} = \texttt{segment\_list}[\mathrm{SL} + 1] denote the immediate upstream sender, and h=k−SLh = k - \mathrm{SL} denote the exact hop distance from uu to xkx_k along that suffix. Forward EXPLORE and DATA suffixes teach routes toward upstream origins and relays, whereas returning ACK suffixes teach validated routes toward the target destination and downstream relays. Each tuple (generation, mode, xkx_k) is learned at most once per router, and an observation is ignored if uu already holds a confident, non-repair route to xkx_k with a strictly smaller recorded hop distance than hh.

When (xk,h)(x_k,h) passes deduplication and short-route protection, router uu reinforces neighbor vprevv_{\mathrm{prev}} using a distance-attenuated step size α(h)\alpha(h):

α(h)=min⁡(α0,0.52+max⁡(0,α0−0.52)h),α0=0.85,(6)\alpha(h) = \min\left(\alpha_0, 0.52 + \frac{\max(0,\alpha_0 - 0.52)}{h}\right), \qquad\alpha_0 = 0.85, \tag*{(6)}

and updates the routing weights via convex combination (clearing xkx_k from repairurepair_u once max⁡vwu+(xk,v)>θ\max_v w_u^+(x_k,v) > \theta):

wu+(xk,v)=(1−α(h))wu(xk,v)+α(h)I(v=vprev),∀v∈Nu(t).(7)w_u^+(x_k,v) = (1-\alpha(h))w_u(x_k,v) + \alpha(h)\mathbb{I}(v=v_{\mathrm{prev}}), \qquad\forall v \in\mathcal{N}_u(t). \tag*{(7)}

Because α(h)≥0.52+0.33/16=0.5406>θ=0.51\alpha(h) \ge0.52 + 0.33/16 = 0.5406 > \theta= 0.51 for all 1≤h≤161 \le h \le16, a single validated observation elevates vprevv_{\mathrm{prev}} strictly above θ\theta in one pass. For example, from a four-neighbor uniform prior (w=0.25w = 0.25), a two-hop ACK (h=2h = 2) applies α(2)=0.685\alpha(2) = 0.685 and raises the reinforced neighbor’s weight to w+=0.764w^+ = 0.764 in one RTT (Figure 3b).

Bounded binary exploration cloning and single-pass confidence gate

Figure 3. Stage 2: Bounded Exploration Cloning and Confidence-Gated Next-Hop Selection. (a) Least-probed bounded binary exploration cloning tree (split_rem:2→1→0\mathrm{split\_rem}: 2 \to1 \to0), restricting each unconfident exploration wave to at most 4 leaf branches while excluding visited suffix nodes. (b) Single-pass confidence gate (θ=0.51\theta= 0.51) crossed in one RTT (illustrated for a representative h=2h = 2 returning SRH-ACK with α(2)=0.685\alpha(2) = 0.685, elevating wS(D,A1)w_S(D,A_1) from 0.250 to 0.764; a three-hop h=3h = 3 return similarly yields α(3)=0.630\alpha(3) = 0.630 and w+=0.723>θw^{+} = 0.723 > \theta) to release buffered DATA.

Stage 2: Confidence-Gated Next-Hop Selection and Bounded Cloning

Figure 3 illustrates bounded exploration cloning and the single-pass confidence gate. For any transit packet (SL >0> 0, target d≠ud \ne u), Stage 2 forms the loop-free candidate set by excluding all routers already recorded in the traversed suffix Vvisited=SRH.segment_list[SL..LastEntry]V_{\mathrm{visited}} = \texttt{SRH.segment\_list[SL..LastEntry]}:

Cu(d)={v∈Nu(t)∣SID⁡(v)∉Vvisited}.(8)\mathcal{C}_u(d) = \{v \in\mathcal{N}_u(t) \mid\operatorname{SID}(v) \notin V_{\mathrm{visited}}\}. \tag*{(8)}

Router uu is confident for dd when d∉repairud \notin repair_u and max⁡v∈Cu(d)wu(d,v)>θ=0.51\max_{v \in\mathcal{C}_u(d)} w_u(d,v) > \theta= 0.51. For DATA packets, an unconfident source enqueues the payload in a per-destination FIFO buffer (bounded at 64 packets with 1.0-s expiration) and triggers an EXPLORE wave (50-ms source cooldown, retried every 250 ms on maintenance ticks); any Stage 1 update that renders dd confident immediately releases all buffered DATA. Transit relays forward DATA greedily along the highest-weight candidate in Cu(d)\mathcal{C}_u(d) and trigger a background EXPLORE probe (250-ms relay cooldown) if locally unconfident.

For EXPLORE packets, each generation is forwarded at most once per relay. A confident transit relay steers the probe along its single best candidate without decrementing the split budget bb. At the source or an unconfident relay, Stage 2 ranks Cu(d)\mathcal{C}_u(d) by ascending probe count cprobe(d,v)c_{\mathrm{probe}}(d,v), descending weight, and a seeded tie-breaker. When b>0b > 0 and ∣Cu(d)∣≥2|\mathcal{C}_u(d)| \ge2, the router clones the packet across the top two candidates and decrements the child budget:

bchild=b−1when splitting,cprobe(d,v)←cprobe(d,v)+1.(9)b_{\mathrm{child}} = b - 1 \quad\text{when splitting}, \qquad c_{\mathrm{probe}}(d,v) \leftarrow c_{\mathrm{probe}}(d,v) + 1. \tag*{(9)}

With bmax⁡=2b_{\max} = 2 at the source, binary splitting occurs at most twice along any path, bounding each discovery wave to at most 22=42^2 = 4 leaf branches (Figure 3a).

Stage 3: SL Pointer Advancement and Deterministic SRH-ACK Reversal

For each outbound forward branch (q,vnext)(q, v_{\mathrm{next}}) with positive HopLimit, Stage 3 saves a pre-transmission snapshot σ=(segment_list,SL,IPv6.DA,HopLimit)\sigma= (\mathrm{segment\_list}, \mathrm{SL}, \mathrm{IPv6.DA}, \mathrm{HopLimit}). If vnext=dv_{\mathrm{next}} = d, Stage 3 compacts unused slots into segment_list←[d]∪suffix\mathrm{segment\_list} \leftarrow[d] \cup\mathrm{suffix} and sets SL←0\mathrm{SL} \leftarrow0. Otherwise, if vnext≠dv_{\mathrm{next}} \ne d and SL≤1\mathrm{SL} \le1 (meaning the branch has exhausted the Hmax⁡=16H_{\max} = 16 intermediate segment capacity without reaching $d), or if HopLimit≤0\mathrm{HopLimit} \le0, the router drops the branch to enforce the strict path-depth bound. For a valid intermediate hop (vnext≠dv_{\mathrm{next}} \ne d and SL>1\mathrm{SL} > 1), Stage 3 advances the pointer, decrements HopLimit, and writes the next-hop SID:

SL←SL−1,segment_list[SL]←SID(vnext),IPv6.DA←segment_list[SL].(10)\begin{aligned} \mathrm{SL} &\leftarrow\mathrm{SL} - 1,\\ \mathrm{segment\_list}[\mathrm{SL}] &\leftarrow\mathrm{SID}(v_{\mathrm{next}}),\\ \mathrm{IPv6.DA} &\leftarrow\mathrm{segment\_list}[\mathrm{SL}]. \tag*{(10)} \end{aligned}

When the first EXPLORE branch of a generation reaches destination DD (SL=0\mathrm{SL} = 0) with compacted segment array [D,r1,…,rL−1,S][D,r_1,\ldots,r_{L-1},S], DD reverses the array once into

segment_listACK=[S,rL−1,…,r1,D],(11)\mathrm{segment\_list}_{\mathrm{ACK}} = [S,r_{L-1},\ldots,r_1,D], \tag*{(11)}

sets SL=L−1\mathrm{SL} = L - 1 and IPv6.DA=r1\mathrm{IPv6.DA} = r_1, and transmits the unicast ACK. Each returning hop executes Stage 1 suffix learning and decrements the pointer in place:

SL←SL−1,IPv6.DA←segment_listACK[SL],(12)\mathrm{SL} \leftarrow\mathrm{SL} - 1,\qquad\mathrm{IPv6.DA} \leftarrow\mathrm{segment\_list}_{\mathrm{ACK}}[\mathrm{SL}], \tag*{(12)}

until reaching source SS at SL=0\mathrm{SL} = 0 (Table 2).

Stage 4: Local Link-Down Failover and Table Aging

When the enqueue or dequeue check at router uu detects that next hop vfailv_{\mathrm{fail}} is unreachable, Stage 4 executes immediate local failover (Algorithm 2 and Figure 4). First, uu removes vfailv_{\mathrm{fail}} from Nu(t)\mathcal{N}_u(t), marks d∈repair⁡ud \in\operatorname{repair}_u, and renormalizes remaining neighbor weights:

Stage 4 local link-down failover and pre-transmission SRH snapshot restoration

Figure 4. Stage 4: Local Link-Down Failover and Pre-Transmission SRH Snapshot Restoration. (a) Relay RR detects a broken egress link to primary next hop BB, removes BB from NR(t)N_R(t), renormalizes surviving weights, and reroutes immediately to loop-free alternate EE while triggering a background probe (with idle entries aging exponentially at τ=8.0\tau= 8.0 s). (b) Three-step header rollback and rewrite along the logical traversal chain: the failed attempt at R→BR \to B had decremented SL from 14 to 13 (Step 1); restoring snapshot σ\sigma resets SL = 14 and expunges unsent hop BB (Step 2) before rewriting alternate EE at SL = 13 (Step 3).

wu(d,v)←{wu(d,v)/∑z∈Nu(t)wu(d,z),positive sum,1/∣Nu(t)∣,zero sum and nonempty set.(13)w_u(d,v) \leftarrow \begin{cases} w_u(d,v) / \sum_{z \in\mathcal{N}_u(t)} w_u(d,z), & \text{positive sum},\\ 1 / \lvert\mathcal{N}_u(t) \rvert, & \text{zero sum and nonempty set.} \end{cases} \tag*{(13)}

Second, for a forward packet carrying snapshot σ\sigma, Stage 4 restores σ\sigma (segment_list, SL, IPv6.DA, and HopLimit) to its exact pre-hop arrival state. Because Stage 3 had already decremented SL and written SID(vfailv_{\mathrm{fail}}) into the header prior to the link check, restoring σ\sigma prevents the untraversed node vfailv_{\mathrm{fail}} from polluting the suffix or consuming an extra segment slot. Third, uu recomputes the loop-free candidates Cu(d)C_u(d). A failed EXPLORE branch sets its split budget to zero and advances to the best surviving candidate; a failed DATA packet at a transit relay triggers a cooldown-bypassed EXPLORE probe and immediately re-advances the restored packet toward the highest-weight surviving candidate in Cu(d)C_u(d) (e.g., rerouting from failed hop BB to alternate EE in Figure 4).

Performance Evaluation

Pure-L3 Simulation Setup, Baselines, and Timing Definitions

We implement the pure-L3 discrete-event simulator, the proposed INC-SRv6 mechanism, all baseline protocols, and the evaluation pipeline in Python 3.10 (verified by 64 deterministic unit tests; open-source repository details are provided in the Data Availability Statement). Table 3 summarizes the physical, network-layer, and protocol parameters used across all experiments. Each simulation run spans 50.0 s (40.0 s of active traffic generation followed by a 10.0 s drain window) across N=200N = 200 UAVs. Traffic consists of 40 concurrent constant-bit-rate (CBR) flows between randomly sampled distinct source-destination pairs, each generating 512-byte UDP payloads at 8 packets/s (32.768 kbps payload rate per flow, 125 ms inter-packet interval), with flow start times staggered uniformly in [2.0, 4.0] s. All periodic control messages (HELLO, LSA, TC, and RREQ) are transmitted via link-local L3 multicast, charging one serialization event at the sender’s multicast FIFO and delivering independent copies to all currently connected L3 neighbors. Note that this collision-free pure-L3 multicast abstraction is intentionally conservative in favor of broadcast-heavy baselines (AODV-L3, OLSR-L3, OSPF-SRv6, and AntHocNet-L3): under realistic CSMA/CA wireless contention, network-wide RREQ and LSA/TC broadcasts suffer severe broadcast-storm collisions and contention backoffs, whereas INC-SRv6 relies on bounded unicast exploration (≤4\le4 leaf branches) and passive suffix extraction.

CategoryParameterValue / Engineering Description
3D UAV TopologyNumber of UAV routers (NN)200 airborne SRv6 routers
3D UAV TopologyOperational airspace (AA)1500 m ×\times 1500 m ×\times 300 m (3D Random Waypoint)
3D UAV TopologyL3 communication range (RR)220 m (mean geometric node degree ≈14.8\approx14.8–15.2)
3D UAV TopologySimulation horizon40.0 s active traffic + 10.0 s drain (50.0 s total)
3D UAV TopologyPaired random seeds10 paired seeds per scenario (seed ∈{1001,…,1010}\in\{1001, \ldots, 1010\})
Pure-L3 ForwardingDirected link capacity (ClinkC_{\mathrm{link}})10 Mbps point-to-point L3 pipe (zero MAC retry)
Pure-L3 ForwardingPer-hop SRH processing (dprocd_{\mathrm{proc}})20 μ\mus per forwarded packet
Pure-L3 ForwardingInterface FIFO queue (Qmax⁡Q_{\max})128 packets per directed interface
Pure-L3 ForwardingOffered CBR workload40 concurrent flows, 8 pkts/s/flow, 512 B payload
Pure-L3 ForwardingModeled byte accounting40 B IPv6 + 8 B SRH base + Bstride×NpopB_{\mathrm{stride}} \times N_{\mathrm{pop}} (16 B SID / 4 B uSID model)
INC-SRv6 ParametersConfidence gate (θ\theta)0.51 (strict majority confidence at source)
INC-SRv6 ParametersReinforcement step (α0,α(h)\alpha_0, \alpha(h))α0=0.85\alpha_0 = 0.85, α(h)=min⁡(α0,0.52+0.33/h)\alpha(h) = \min(\alpha_0, 0.52 + 0.33/h) (Equation (6))
INC-SRv6 ParametersBounded cloning budget (bmax⁡b_{\max})split_rem = 2 (≤4\le4 leaf branches per exploration wave)
INC-SRv6 ParametersMaximum SRH path depth (Hmax⁡H_{\max})16 hops (17 logical segment slots in SRH.segment_list)
INC-SRv6 ParametersTable aging & active refreshτ=8.0\tau= 8.0 s lazy exponential decay; 250 ms active DATA window
INC-SRv6 ParametersSource pending bufferMax 64 pkts/destination, 1.0 s wait expiration

Table 3. Pure-L3 3D UAV network simulation parameters and INC-SRv6 configuration.

Five pure-L3 engineering baselines share the common L3 forwarding engine (establishing controlled algorithmic reference baselines within the shared L3 discrete-event engine): (i) OSPF-SRv6 [38] disseminates neighbor LSAs every 2.0 s (batched over a 10-ms window), computes shortest-path source SRH segment lists from its local LSDB, and performs local LFA/TI-LFA style alternate repair upon egress link loss using a cached reverse shortest-path tree excluding the repair node; (ii) OLSR-L3 transmits 1.0-s HELLO beacons and 2.0-s MPR-relayed TC advertisements to maintain hop-by-hop shortest paths; (iii) AODV-L3 discovers scalar next-hop routes via flooded RREQ and unicast RREP messages (8.0-s active route lifetime, 500-ms per-destination request cooldown) and propagates RERR notifications to upstream precursors upon link failure to trigger source rediscovery; (iv) Q-Routing-L3 updates per-destination/neighbor delivery delay estimates via charged one-hop feedback packets (η=0.3\eta= 0.3, ϵ=0.1\epsilon= 0.1 exploration); and (v) AntHocNet-L3 combines reactive forward/backward ants with 2.0-s proactive path probing, periodic pheromone evaporation (0.9 factor), and neighbor pheromone diffusion.

To isolate the contribution of each design element in our workflow, four mechanism ablations modify exactly one component of full INC-SRv6: INC-SRv6-OriginOnly restricts Stage 1 suffix learning to the packet’s origin node (k=LastEntryk = \text{LastEntry}) rather than the full traversed suffix; INC-SRv6-NoClone disables Stage 2 binary exploration cloning (bmax⁡=0b_{\max} = 0, single-branch probing); INC-SRv6-SmallStep replaces the single-pass reinforcement rule in Equation (6) with a weak step size α(h)=0.35/h<θ\alpha(h) = 0.35/h < \theta; and INC-SRv6-NoFastFailover disables Stage 4 immediate neighbor invalidation, snapshot restoration, and local rerouting upon link-down events, relying instead on periodic HELLO expiration. In addition, INC-SRv6-uSID evaluates the 4-byte compact SID stride (Bstride=4B_{\mathrm{stride}} = 4 bytes).

End-to-end packet delivery ratio (PDR) is defined as unique delivered DATA payloads divided by total generated DATA payloads across the 40 flows. End-to-end delay tdeliver−tbornt_{\mathrm{deliver}} - t_{\mathrm{born}} is measured over all delivered DATA packets and includes source pending-buffer waiting time, interface FIFO queuing, 20 μ\mus per-hop processing, serialization, and propagation delay. Each table entry reports the arithmetic mean across the 10 paired seeds, where p95p_{95} delay is computed per seed and averaged across seeds. Control overhead counts all on-wire control hop transmissions (HELLO, EXPLORE, ACK, LSA, TC, RREQ, RREP, RERR, FANT, BANT, DIFFUSE, and QFEEDBACK) over the 50.0-s simulation horizon.

Table 4 defines the ten evaluation scenarios (S1–S10), covering pure mobility scaling from 15 to 45 m/s (S1–S4), central high-degree relay hub failures (S5–S6), contiguous spatial area blackouts (S7), repeated multi-wave relay churn (S8–S9), and combined high-speed flight with repeated 20% relay churn (S10). Relay failures affect only intermediate transit nodes while keeping all flow endpoints operational. Every protocol and variant executes on the exact same precomputed 3D trajectories, flow schedules, and failure cohorts for each seed, yielding 1, 100 paired simulation runs.

Scenario IDCategorySpeed Range (m/s)Relay OutageOperational / Fault Injection Description
S1Mobility15 ([10, 20])0%Normal patrol cruise speed, zero node failures
S2Mobility25 ([20, 30])0%Fast transit cruise speed, zero node failures
S3Mobility35 ([30, ?])0%High-speed dash maneuver, rapid link turnover
S4Mobility45 ([35, ?])0%Extreme aerial speed, severe link churn
S5Hub Outage25 ([20, 30])10% (20 relays)Top-20 highest-degree central relays fail at t=15.0t = 15.0 s
S6Hub Outage25 ([20, 30])20% (40 relays)Top-40 highest-degree central relays fail at t=15.0t = 15.0 s
S7Spatial Blackout25 ([20, 30])20% (40 relays)40 relays nearest a seeded reference UAV position fail at t=15.0t = 15.0 s
S8Churn25 ([20, 30])3×10%3 \times10\%Three 4-s relay outage waves (20 relays each) at t=12,22,32t = 12, 22, 32 s
S9Churn25 ([20, 30])3×20%3 \times20\%Three 4-s relay outage waves (40 relays each) at t=12,22,32t = 12, 22, 32 s
S10Combined35 ([30, 40])3×20%3 \times20\%High-speed flight (35 m/s) + three 4-s, 40-relay outage waves

Table 4. Experimental scenario matrix (S1–S10) for the 200-node 3D UAV network campaign.

Mobility Scaling Analysis (S1–S4)

Figure 5 and Table 5 present the delivery ratio, mean delay, 95th-percentile (p95p_{95}) tail latency, and control overhead as nominal UAV speed scales from 15 m/s (S1) to 45 m/s (S4). Key performance figures are underlined in Table 5 for ease of comparison. Across high-delivery regimes in Table 5 and Table 6, arithmetic mean delay can slightly exceed p95p_{95} delay (e.g., INC-SRv6 in S3–S4 and AODV-L3 in S6–S7): over 95% of delivered payloads traverse established routes within a few milliseconds, whereas fewer than 5% of initial or post-break packets wait hundreds of milliseconds (up to the 1.0-s buffer cap) in the source pending queue during route discovery, pulling up the arithmetic mean without shifting the 95th percentile.

Figure 5. Mobility scaling performance across S1 (15 m/s) to S4 (45 m/s). (a) Mean packet delivery ratio (PDR, %) with 95% confidence intervals across 10 paired seeds. (b) 95th-percentile (p95p_{95}) end-to-end tail delay (ms, log scale). (c) Total on-wire control packet transmissions (×103\times10^{3}, log scale).

ScenarioProtocolPDR (%)Mean Delay (ms)p95p_{95} Delay (ms)Control PktsControl MB
S1INC-SRv694.408.118.6881,93013.54
S1INC-SRv6-uSID94.707.477.2977,8566.44
S1AODV-L394.634.863.68134,0728.02
S1AntHocNet-L381.2519.1913.581,723,589159.69
S1OSPF-SRv679.672.745.8545,40478.61
S1OLSR-L349.141.573.2438,14859.50
S1Q-Routing-L330.602.506.15120,6727.68
S3INC-SRv692.289.898.85162,15527.61
S3INC-SRv6-uSID92.339.177.49153,32912.51
S3AODV-L389.5914.47113.07260,24815.19
S3AntHocNet-L374.3139.74263.812,509,042230.87
S3OSPF-SRv641.422.245.3645,79988.15
S3OLSR-L321.221.001.9439,80867.05
S3Q-Routing-L317.292.045.6893,1266.09
S4INC-SRv690.6311.559.08191,80633.07
S4INC-SRv6-uSID90.3911.197.59189,86415.49
S4AODV-L387.8118.79129.37298,51517.37
S4AntHocNet-L371.9546.36328.472,784,461257.34
S4OSPF-SRv634.512.055.2045,99791.01
S4OLSR-L317.390.861.7140,23669.13
S4Q-Routing-L315.881.795.3183,0185.51

Table 5. Mobility scaling performance comparison across S1 (15 m/s), S3 (35 m/s), and S4 (45 m/s) (10-seed arithmetic means; key comparison values are underlined).

ScenarioProtocolPDR (%)Mean Delay (ms)Delay p95p_{95} (ms)Control PktsControl MBRecovery s (cens./all)
S6INC-SRv692.379.608.80116,70719.512.30 s (0/10)
S6INC-SRv6-uSID92.319.387.28115,6719.302.00 s (0/10)
S6AODV-L391.2510.444.22177,52410.312.10 s (0/10)
S6AntHocNet-L376.9730.75185.381,827,881166.432.40 s (0/10)
S6OSPF-SRv656.722.505.7139,81152.755.56 s (1/10)
S6OLSR-L329.911.202.5433,31738.575.00 s (1/10)
S6Q-Routing-L325.382.366.05104,8146.585.78 s (1/10)
S7INC-SRv691.5510.248.84121,12720.272.20 s (0/10)
S7INC-SRv6-uSID91.219.907.30120,3549.692.40 s (0/10)
S7AODV-L390.2511.324.35179,88510.472.30 s (0/10)
S7AntHocNet-L375.6432.93208.071,799,634163.933.70 s (0/10)
S7OSPF-SRv655.672.465.6239,51255.005.00 s (1/10)
S7OLSR-L330.011.202.5933,10039.923.57 s (3/10)
S7Q-Routing-L324.262.265.87103,3736.525.75 s (2/10)
S10INC-SRv692.1210.578.84158,61926.872.17 s (0/30)
S10INC-SRv6-uSID91.789.887.46154,34212.512.30 s (0/30)
S10AODV-L389.1216.02121.26247,06214.402.07 s (0/30)
S10AntHocNet-L374.7240.98284.322,426,164222.772.17 s (0/30)
S10OSPF-SRv639.282.195.3343,59776.435.05 s (11/30)
S10OLSR-L320.320.981.9437,51557.633.95 s (9/30)
S10Q-Routing-L316.802.025.7391,0115.913.95 s (9/30)

Table 6. Table 6. Fault resilience and post-outage recovery comparison across 20% hub fault (S6), 20% spatial blackout (S7), and 35 m/s high-speed repeated 20% relay churn (S10) (10-seed arithmetic means; key comparison values are underlined).

The mobility scaling results in Figure 5 and Table 5 highlight two distinct operating regimes:

  • Moderate Cruise Regime (S1, 15 m/s): Both INC-SRv6-uSID (94.70% PDR; 94.40% for 128-bit INC-SRv6) and reactive AODV-L3 (94.63% PDR) achieve near-ceiling delivery. However, whereas AODV-L3 floods RREQ broadcasts across all 200 nodes upon route expiration (134,072 control packets, 8.02 MB), INC-SRv6 reuses suffixes learned from intersecting flows and restricts unconfident probing to at most four leaf branches, reducing control packets by 41.9% (77,856) and control bytes by 19.7% (6.44 MB) under uSID. Because AODV-L3 pins scalar shortest-hop routes and drops packets upon link loss rather than rerouting locally, its surviving payloads exhibit lower p95p_{95} delay (3.68 ms versus 7.29 ms for INC-SRv6-uSID).

  • High-Speed Maneuver Regime (S2–S4, 25–45 m/s): Rapid link turnover continuously breaks active paths. Under AODV-L3, intermediate link breaks drop in-flight packets, propagate RERR messages upstream, and stall sources behind discovery cooldowns until a new RREQ/RREP flood completes, degrading PDR to 87.81% in S4 while inflating p95p_{95} tail delay by over 30×\times from 3.68 ms (S1) to 113.07 ms (S3) and 129.37 ms (S4). Conversely, INC-SRv6 executes Stage 4 snapshot rollback and local alternate forwarding

at the detecting relay, sustaining 92.28% (S3) and 90.63% (S4) PDR while bounding p95p_{95} delay tightly at 8.85–9.08 ms (7.49–7.59 ms for uSID), achieving a > 92% tail-latency reduction alongside 36.4%–41.1% fewer control packets than AODV-L3.

  • Proactive, Learning, and Swarm Baselines: Proactive OSPF-SRv6 and OLSR-L3 fall from 79.67% and 49.14% PDR in S1 to 34.51% and 17.39% in S4 while consuming 59.50–91.01 MB of control traffic, as 2-s topology advertisements lag behind sub-second link changes. Q-Routing-L3 delivers only 15.88%–30.60% because one-hop feedback propagates too slowly across multi-hop trajectories, whereas AntHocNet-L3 achieves 71.95%–81.25% PDR at the cost of 13.58–328.47 ms p95p_{95} delay (168.19–328.47 ms across 25–45 m/s) and 1.72–2.78 million control packets (159.69–257.34 MB).

Resilience Under Relay Hub Faults, Spatial Blackouts, and Repeated Churn (S5–S10)

Figure 6 and Table 6 evaluate protocol resilience across the relay failure scenarios (S5–S10). For each outage event, cohort recovery time measures the time required for two consecutive 1-s payload generation cohorts over a 10-s post-fault start window to recover at least 90% of the pre-fault 4-s baseline PDR (minimum recovery window 2.00 s, observed completion up to 11.0 s after single outages or 8.0 s for the final t=32t = 32 s wave before the 40-s generation cutoff; reported values are arithmetic means over uncensored events, and the censoring count denotes non-recovery within that window).

Figure 6. Fault resilience and post-outage recovery across S5–S10. (a) Mean packet delivery ratio (PDR, %) with 95% confidence intervals under single hub faults (S5–S6), spatial area blackout (S7), repeated relay churn (S8–S9), and high-speed churn (S10). (b) Post-outage cohort recovery time (s) and fractions of events right-censored at the observation limit across the 30 outage events in S10.

Across all six fault-injection scenarios (S5–S10), INC-SRv6 achieves the highest delivery ratio and recovers from 100% of outage events (0 censored events across 10 outage events per scenario in S5–S7 and 30 outage events per scenario in S8–S10):

  • Central Hub Outages (S5–S6) and Spatial Blackout (S7): When 20–40 central hubs or 40 contiguous core relays fail simultaneously at t=15.0t = 15.0 s, INC-SRv6 sustains 92.90% (S5), 92.37% (S6), and 91.55% (S7) PDR, outperforming AODV-L3 by +1.12 to +1.54 pp with 33.1%–36.9% fewer control packets. Because border routers already hold alternative next-hop weights learned from prior suffixes, Stage 4 detours in-flight packets around the void immediately and achieves 2.00–2.30 s cohort recovery.

  • Repeated Relay Churn and High-Speed Stress (S8–S10): Under three 4-s outage waves at 25 m/s (S8–S9), INC-SRv6 sustains 92.79% and 92.74% PDR with 8.81 ms p95p_{95} delay. In the combined stress scenario (S10: 35 m/s flight plus three 40-relay outage waves), standard INC-SRv6 improves PDR from 89.12% (AODV-L3) to 92.12% (+3.00 ± 0.90 pp), reduces mean delay from 16.02 to 10.57 ms (9.88 ms for uSID), and suppresses p95p_{95} tail delay by an order of magnitude from 121.26 ms (AODV-L3) and 284.32 ms (AntHocNet-L3) to 8.84 ms (7.46 ms for uSID), while recovering across all 30 outage waves (2.17 s mean recovery versus 9–11 censored events for OSPF-SRv6, OLSR-L3, and Q-Routing-L3).

Control Overhead and 4-Byte Compact uSID Identifier-Width Experiment

Figure 7a compares the modeled control byte volume across S1–S4 and S10, while Figure 7b illustrates the three-dimensional Pareto trade-off between delivery ratio, p95p_{95} tail latency, and control byte volume in S10.

Figure 7. Control overhead and 4-byte compact uSID stride model efficiency. (a) Modeled control byte volume (MB) across S1–S4 and S10, highlighting the 53.4% byte reduction under the Bstride=4B_{\mathrm{stride}} = 4 B identifier-width model. (b) Pareto trade-off in S10 between PDR (%), p95p_{95} tail delay (ms, log scale), and modeled control byte volume (marker area).

In S10, 128-bit INC-SRv6 sends 35.8% fewer control packets than AODV-L3 (158, 619 versus 247, 062), but incurs higher control byte volume (26.87 versus 14.40 MB) due to 16-byte SID entries. Adopting the 4-byte compact stride (INC-SRv6-uSID, Bstride=4B_{\mathrm{stride}} = 4 bytes) reduces control volume in S10 by 53.4% to 12.51 MB (13.1% below AODV-L3). Across all ten scenarios, INC-SRv6-uSID cuts SRv6 control bytes by 52.1%–54.7% and trims p95p_{95} delay to 7.28–7.59 ms via shorter serialization times. For a four-entry path (Table 2) on a 552-byte IPv6 DATA packet, SRH encapsulation adds 72 bytes (13.0%) with 128-bit SIDs and only 24 bytes (4.35%) with 4-byte uSID, placing INC-SRv6-uSID on the Pareto frontier of high delivery, sub-10-ms tail delay, and low overhead (Figure 7b).

Ablation Study of the Four-Stage Workflow

Figure 8 and Table 7 report paired differences (ΔPDR=PDRFull−PDRAblated\Delta\mathrm{PDR} = \mathrm{PDR}_{\mathrm{Full}} - \mathrm{PDR}_{\mathrm{Ablated}} with 95% Student-tt CIs and Δ\DeltaControl Bytes) between full INC-SRv6 and its four mechanism ablations plus the compact-stride uSID variant.

Figure 8. Ablation study of the four-stage INC-SRv6 workflow. (a) Paired Δ\DeltaPDR advantage (percentage points ±\pm95% CI) of full INC-SRv6 over the four mechanism ablations across S1, S3, S4, S7, and S10. (b) Absolute PDR (%) and p95p_{95} tail delay (ms) across all six INC-SRv6 variants in S10.

ScenarioAblated VariantVariant PDR (%)ΔPDR pp ± 95% CIVariant p95p_{95} (ms)ΔControl Bytes (MB)
S1OriginOnly88.68+5.72 ± 0.679.45−7.80
S1NoClone90.75+3.65 ± 0.749.15+1.96
S1SmallStep31.55+62.85 ± 3.18513.10−44.56
S1NoFastFailover45.05+49.36 ± 1.0332.77+6.90
S1uSID94.70−0.30 ± 0.817.29+7.09
S3OriginOnly85.75+6.53 ± 0.609.63−14.64
S3NoClone87.53+4.75 ± 0.399.58+4.09
S3SmallStep27.26+65.02 ± 2.44655.25−34.19
S3NoFastFailover26.25+66.03 ± 1.20605.31+21.42
S3uSID92.33−0.05 ± 0.457.49+15.11
S4OriginOnly83.59+7.04 ± 0.6710.07−15.78
S4NoClone85.75+4.88 ± 0.689.77+4.97
S4SmallStep27.96+62.66 ± 2.58694.39−30.02
S4NoFastFailover23.96+66.67 ± 1.00668.53+26.94
S4uSID90.39+0.24 ± 0.527.59+17.58
S7OriginOnly85.74+5.81 ± 0.849.53−9.95
S7NoClone87.39+4.16 ± 0.539.39+3.16
S7SmallStep32.89+58.66 ± 2.83617.53−35.19
S7NoFastFailover33.36+58.19 ± 2.08390.20+14.10
S7uSID91.21+0.34 ± 0.507.30+10.58
S10OriginOnly85.72+6.40 ± 0.829.62−14.49
S10NoClone87.64+4.48 ± 0.469.64+3.39
S10SmallStep29.16+62.95 ± 2.28675.39−33.63
S10NoFastFailover25.80+66.32 ± 1.35627.01+20.87
S10uSID91.78+0.33 ± 0.307.46+14.36

Table 7. Paired ablation study across representative scenarios (ΔPDR and ΔControl Bytes report paired INC-SRv6 (Full) − Comparator differences across 10 paired seeds; negative ΔControl Bytes indicates that full INC-SRv6 incurs lower control overhead than the ablated variant; key ablation impacts are underlined).

The ablation results verify that all four stages are essential and mutually reinforcing:

  1. Stage 1 Full-Suffix Learning (OriginOnly): Learning only the origin node reduces PDR by 5.10–7.04 pp (+6.40 ± 0.82 pp in S10) while increasing control bytes by 7.80–15.78 MB (saving 14.49 MB in S10, i.e., ΔControl Bytes = −14.49 MB), proving that intermediate suffix extraction both pre-populates backup routes and amortizes discovery across flows.

  1. Stage 2 Bounded Cloning (NoClone): Disabling binary splitting (bmax⁡=0b_{\max} = 0) reduces PDR by 3.59–4.88 pp (+4.48 ± 0.46 pp in S10), as single-branch probes stall in local topological pockets whereas ≤ 4-leaf cloning explores diverse corridors at modest cost (1.96–4.97 MB).

  1. Single-Pass Confidence Calibration (SmallStep): Using α(h)=0.35/h<θ=0.51\alpha(h) = 0.35/h < \theta= 0.51 collapses PDR to 27.26%–32.89% (+62.95 ± 2.28 pp gap in S10) and inflates p95p_{95} delay to 513.10–694.39 ms because a single multi-hop ACK (h≥2h \ge2, α(h)≤0.175\alpha(h) \le0.175) cannot open the source admission gate from a uniform prior.

  1. Stage 4 Fast Failover (NoFastFailover): Disabling immediate egress-failure recovery drops PDR to 45.05% in S1 and 23.96%–25.80% in S4/S10 (+66.32 ± 1.35 pp in S10, p95p_{95} delay 627.01 ms), confirming that snapshot-restored local rerouting is the primary driver of high-churn resilience.

SRH Processing Pipeline CPU Microbenchmark

Table 8 reports per-packet CPU execution times on an x86-64 server (48 logical CPUs, Python 3.10.13, 7 × 20,000 operations via time.process_time_ns()). Median times are 10.84 μ\mus (92.26 kpps) for ACK processing (Stages 1 and 3), 33.87 μ\mus (29.52 kpps) for exploratory forwarding with Stage 2 cloning (Stages 1–3), and 52.24 μ\mus (19.14 kpps) for link-down failover with snapshot rollback (Stages 1–4), confirming that per-packet SRH processing requires only tens of microseconds even in pure Python.

OperationStagesMedian CPU Time (ns/pkt)Pure-Python Rate (kpps)
ACK processing1 + 310,839.492.26
Forwarding1–333,870.929.52
Failure branch1–452,242.319.14

Table 8. Per-packet CPU execution microbenchmark of the INC-SRv6 processing pipeline on the benchmark host (pure Python 3.10 reference implementation, 7 repeats × 20,000 packets).

Discussion and Conclusions

This paper presented INC-SRv6, an in-network computing mechanism that repurposes the standard IPv6 Segment Routing Header (SRH) and its SL pointer into a distributed route exploration, multi-destination learning, and fast-failover control plane for dynamic UAV networks. By partitioning SRH.segment_list around the active SL pointer into pre-allocated forward slots and a traversed path suffix, transit routers extract multiple destination/next-hop observations from every arriving packet, gate admission by single-pass confidence (θ=0.51\theta= 0.51) with bounded binary probing (≤4\le4 leaves), reverse the SRH array at the destination for lookup-free ACK return, and restore pre-transmission SRH snapshots (σ\sigma) for immediate loop-free local repair upon link failure.

Across 1,100 pure-L3 simulation runs in 200-node 3D UAV networks, INC-SRv6-uSID matches the delivery of reactive AODV-L3 at 15 m/s cruise speed (94.70% versus 94.63%) while cutting control packets by 41.9% and control bytes by 19.7%. Under 35 m/s high-speed flight with repeated 20% relay churn (S10), INC-SRv6 improves delivery from 89.12% to 92.12%, reduces p95p_{95} tail delay by an order of magnitude from 121.26 to 8.84 ms (7.46 ms with uSID), and achieves 100% post-outage cohort recovery, while the 4-byte uSID encoding reduces SRv6 control byte volume by 52.1%–54.7% across all scenarios. In practical wireless deployments, Stage 4 local failover can be gated by a small link-layer retry threshold (e.g., triggering neighbor removal and SRH snapshot rollback after KK consecutive short MAC retry failures rather than a single lost frame) to filter transient multipath fading without sacrificing millisecond-scale repair. Future work will integrate cross-layer IEEE 802.11ax/be MAC link-quality hints, implement C-SID wire serialization in eBPF/XDP, and validate INC-SRv6 on a hardware-in-the-loop UAV testbed.

Author Contributions: Conceptualization, Z.R.; methodology, Z.R. and Z.L.; software, Z.R.; validation, Z.R. and Z.L.; formal analysis, Z.R.; investigation, Z.R.; data curation, Z.R.; writing—original draft preparation, Z.R.; writing—review and editing, Z.R.; visualization, Z.R. All authors have read and agreed to the published version of the manuscript.

Funding: This work was supported by the National Key Research and Development Program of China (No. 2024YFE0200302).

Institutional Review Board Statement: Not applicable.

Informed Consent Statement: Not applicable.

Data Availability Statement: All source code for the pure-L3 discrete-event simulator, the INC-SRv6 protocol implementation, the 64 deterministic unit tests, the CPU microbenchmark, and the 1,100-run simulation dataset are openly available at https://github.com/Computing-in-Network/INC-SRv6.

Conflicts of Interest: The authors declare no conflicts of interest.

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

References

  1. [1]Gupta, L.; Jain, R.; Vaszkun, G. Survey of Important Issues in UAV Communication Networks. IEEE Communications Surveys & Tutorials 2016, 18, 1123–1152. https://doi.org/10.1109/COMST.2015.2495297.
  2. [2]Jiang, J.; Han, G. Routing Protocols for Unmanned Aerial Vehicles. IEEE Communications Magazine 2018, 56, 58–63. https://doi.org/10.1109/MCOM.2017.1700326.
  3. [3]Lakew, D.S.; Sa’ad, U.; Dao, N.N.; Na, W.; Cho, S. Routing in Flying Ad Hoc Networks: A Comprehensive Survey. IEEE Communications Surveys & Tutorials 2020, 22, 1071–1120. https://doi.org/10.1109/COMST.2020.2982452.
  4. [4]Yao, Z.; Cheng, W.; Zhang, W.; Zhang, T.; Zhang, H. The Rise of Next-Generation Wireless Technologies for Emergency Wireless Communications in Harsh Environments. IEEE Network 2022, 36, 28–37. https://doi.org/10.1109/MNET.001.2100691.
  5. [5]Wang, J.; Cheng, W.; Zhang, W.; Liang, H. Statistical QoS Provisioning Architecture for 6G Satellite-Terrestrial Integrated Networks. Journal of Communications and Information Networks 2024, 9, 34–42. https://doi.org/10.23919/JCIN.2024.10494937.
  6. [6]Khan, M.F.; Yau, K.L.A.; Noor, R.M.; Imran, M.A. Routing Schemes in FANETs: A Survey. Sensors 2020, 20, 38. https://doi.org/10.3390/s20010038.
  7. [7]Alam, M.M.; Moh, S. Survey on Q-Learning-Based Position-Aware Routing Protocols in Flying Ad Hoc Networks. Electronics 2022, 11, 1099. https://doi.org/10.3390/electronics11071099.
  8. [8]Zhang, L.; Ma, X.; Zhuang, Z.; Xu, H.; Sharma, V.; Han, Z. Q-Learning Aided Intelligent Routing With Maximum Utility in Cognitive UAV Swarm for Emergency Communications. IEEE Transactions on Vehicular Technology 2023, 72, 3707–3723. https://doi.org/10.1109/TVT.2022.3221538.
  9. [9]Filsfils, C.; Previdi, S.; Ginsberg, L.; Decraene, B.; Litkowski, S.; Shakir, R. Segment Routing Architecture. RFC 8402, Internet Engineering Task Force (IETF), 2018. https://doi.org/10.17487/RFC8402.
  10. [10]Filsfils, C.; Dukes, D.; Previdi, S.; Leddy, J.; Matsushima, S.; Voyer, D. IPv6 Segment Routing Header (SRH). RFC 8754, Internet Engineering Task Force (IETF), 2020. https://doi.org/10.17487/RFC8754.
  11. [11]Filsfils, C.; Camarillo, P.; Leddy, J.; Voyer, D.; Matsushima, S.; Li, Z. Segment Routing over IPv6 (SRv6) Network Programming. RFC 8986, Internet Engineering Task Force (IETF), 2021. https://doi.org/10.17487/RFC8986.
  12. [12]Ventre, P.L.; Salsano, S.; Polverini, M.; Cianfrani, A.; Abdelsalam, A.; Filsfils, C.; Camarillo, P.; Clad, F. Segment Routing: A Comprehensive Survey of Research Activities, Standardization Efforts, and Implementation Results. IEEE Communications Surveys & Tutorials 2021, 23, 182–221. https://doi.org/10.1109/COMST.2020.3036826.
  13. [13]Polverini, M.; Cianfrani, A.; Caiazzi, T.; Scazzariello, M. SRv6 Meets DetNet: A New Behavior for Low Latency and High Reliability. IEEE Journal on Selected Areas in Communications 2025, 43, 448–458. https://doi.org/10.1109/JSAC.2025.3528806.
  14. [14]Secinti, G.; Darian, P.B.; Canberk, B.; Chowdhury, K.R. SDNs in the Sky: Robust End-to-End Connectivity for Aerial Vehicular Networks. IEEE Communications Magazine 2018, 56, 16–21. https://doi.org/10.1109/MCOM.2017.1700456.
  15. [15]Cianfrani, A.; Listanti, M.; Polverini, M. Incremental Deployment of Segment Routing into an ISP Network: A Traffic Engineering Perspective. IEEE/ACM Transactions on Networking 2017, 25, 3146–3160. https://doi.org/10.1109/TNET.2017.2731419.
  16. [16]Sapio, A.; Abdelaziz, I.; Aldilaijan, A.; Canini, M.; Kalnis, P. In-Network Computation is a Dumb Idea Whose Time Has Come. In Proceedings of the 16th ACM Workshop on Hot Topics in Networks (HotNets), 2017, pp. 150–156. https://doi.org/10.1145/3152434.3152461.
  17. [17]Ports, D.R.K.; Nelson, J. When Should the Network Be the Computer? In Proceedings of the 17th Workshop on Hot Topics in Operating Systems (HotOS), 2019, pp. 209–215. https://doi.org/10.1145/3317550.3321439.
  18. [18]Abdelsalam, A.; Clad, F.; Filsfils, C.; Salsano, S.; Siracusano, G.; Veltri, L. Implementation of Virtual Network Function Chaining Through Segment Routing in a Linux-Based NFV Infrastructure. In Proceedings of the 2017 IEEE Conference on Network Softwarization (NetSoft), 2017, pp. 1–5. https://doi.org/10.1109/NETSOFT.2017.8004208.
  19. [19]Zheng, S.; Ren, Z.; Cheng, W.; Zhang, H. Performance Analysis for Subgraph Isomorphism Based Embedding Service Function Chains. IEEE Transactions on Network Science and Engineering 2023, 10, 3099–3113. https://doi.org/10.1109/TNSE.2023.3247625.
  20. [20]Xhonneux, M.; Duchene, F.; Bonaventure, O. Leveraging eBPF for Programmable eNetwork Functions with IPv6 Segment Routing. In Proceedings of the 14th International Conference on emerging Networking Experiments and Technologies (CoNEXT), 2018, pp. 67–72. https://doi.org/10.1145/3281411.3281426.
  21. [21]Scarpitta, C.; Sidoretti, G.; Mayer, A.; Salsano, S.; Abdelsalam, A.; Filsfils, C. High Performance Delay Monitoring for SRv6-Based SD-WANs. IEEE Transactions on Network and Service Management 2024, 21, 1067–1081. https://doi.org/10.1109/TNSM.2023.3300151.
  22. [22]Krishnan, S. Segment Routing over IPv6 (SRv6) Segment Identifiers in the IPv6 Addressing Architecture. RFC 9602, Internet Engineering Task Force (IETF), 2024. https://doi.org/10.17487/RFC9602.
  23. [23]Tulumello, A.; Mayer, A.; Bonola, M.; Lungaroni, P.; Scarpitta, C.; Salsano, S.; Abdelsalam, A.; Camarillo, P.; Dukes, D.; Clad, F.; et al. Micro SIDs: A Solution for Efficient Representation of Segment IDs in SRv6 Networks. IEEE Transactions on Network and Service Management 2023, 20, 774–786. https://doi.org/10.1109/TNSM.2022.3205265.
  24. [24]Cheng, W.; Filsfils, C.; Li, Z.; Decraene, B.; Clad, F. Compressed SRv6 Segment List Encoding. RFC 9800, Internet Engineering Task Force (IETF), 2025. https://doi.org/10.17487/RFC9800.
  25. [25]Atlas, A.; Zinin, A. Basic Specification for IP Fast Reroute: Loop-Free Alternates. RFC 5286, Internet Engineering Task Force (IETF), 2008. https://doi.org/10.17487/RFC5286.
  26. [26]Bashandy, A.; Litkowski, S.; Filsfils, C.; Francois, P.; Decraene, B.; Voyer, D. Topology Independent Fast Reroute Using Segment Routing. RFC 9855, Internet Engineering Task Force (IETF), 2025. https://doi.org/10.17487/RFC9855.
  27. [27]Clausen, T.; Jacquet, P. Optimized Link State Routing Protocol (OLSR). RFC 3626, Internet Engineering Task Force (IETF), 2003. https://doi.org/10.17487/RFC3626.
  28. [28]Perkins, C.; Belding-Royer, E.; Das, S. Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561, Internet Engineering Task Force (IETF), 2003. https://doi.org/10.17487/RFC3561.
  29. [29]Johnson, D.; Hu, Y.; Maltz, D. The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4. RFC 4728, Internet Engineering Task Force (IETF), 2007. https://doi.org/10.17487/RFC4728.
  30. [30]Boyan, J.A.; Littman, M.L. Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach. In Proceedings of the Advances in Neural Information Processing Systems 6 (NIPS), 1993, pp. 671–678.
  31. [31]Di Caro, G.; Ducatelle, F.; Gambardella, L.M. AntHocNet: An Adaptive Nature-Inspired Algorithm for Routing in Mobile Ad Hoc Networks. European Transactions on Telecommunications 2005, 16, 443–455. https://doi.org/10.1002/ett.1062.
  32. [32]da Costa, L.A.L.F.; Kunst, R.; de Freitas, E.P. Q-FANET: Improved Q-learning based routing protocol for FANETs. Computer Networks 2021, 198, 108379. https://doi.org/10.1016/j.comnet.2021.108379.
  33. [33]Ke, Y.; Huang, K.; Qiu, X.; Song, B.; Xu, L.; Yin, J.; Yang, Y. Distributed Routing Optimization Algorithm for FANET Based on Multiagent Reinforcement Learning. IEEE Sensors Journal 2024, 24, 24851–24864. https://doi.org/10.1109/JSEN.2024.3415127.
  34. [34]Zhang, X.; Cui, L.; Tso, F.P.; Li, W.; Jia, W. IN3: A Framework for In-Network Computation of Neural Networks in the Programmable Data Plane. IEEE Communications Magazine 2024, 62, 96–102. https://doi.org/10.1109/MCOM.001.2300587.
  35. [35]Kim, C.; Sivారaman, A.; Katta, N.; Bas, A.; Dixit, A.; Wobker, L.J. In-Band Network Telemetry via Programmable Dataplanes. In Proceedings of the ACM SIGCOMM 2015 Conference (Industrial Demo), 2015, pp. 1–2.
  36. [36]Qian, M.; Cui, L.; Tso, F.P.; Deng, Y.; Jia, W. OffsetINT: Achieving High Accuracy and Low Bandwidth for In-Band Network Telemetry. IEEE Transactions on Services Computing 2024, 17, 1072–1083. https://doi.org/10.1109/TSC.2023.3323697.
  37. [37]Chen, Y.; Cheng, W.; Zhang, W. Reconfigurable Intelligent Surface Equipped UAV in Emergency Wireless Communications: A New Fading-Shadowing Model and Performance Analysis. IEEE Transactions on Communications 2024, 72, 1821–1834. https://doi.org/10.1109/TCOMM.2023.3336223.
  38. [38]Coltun, R.; Ferguson, D.; Moy, J.; Lindem, A. OSPF for IPv6. RFC 5340, Internet Engineering Task Force (IETF), 2008. https://doi.org/10.17487/RFC5340.

Paper details

vlnc:W_4m3r36ad
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents