Inferensys

Glossary

Segment Routing (SRv6)

A source routing protocol that encodes a forwarding path into the IPv6 packet header, enabling network slicing and slice-aware caching to steer traffic through specific cache nodes.
Stylish WeWork-like workspace with hot desks and document wall, professional searching through enterprise knowledge base on a mounted ultrawide display, warm industrial pendants overhead.
SOURCE ROUTING PROTOCOL

What is Segment Routing (SRv6)?

Segment Routing over IPv6 (SRv6) is a source routing protocol that encodes a network path as an ordered list of segments directly within the IPv6 packet header, enabling precise traffic steering without per-flow state in the core network.

Segment Routing (SRv6) fundamentally shifts path control to the ingress node by embedding a Segment Routing Header (SRH) containing a list of 128-bit IPv6 addresses, called SIDs (Segment Identifiers). Each SID represents a specific instruction, such as forwarding to a particular node or applying a network function like a cache lookup. This eliminates the need for complex, stateful signaling protocols like RSVP-TE in the network core, drastically simplifying operations.

For slice-aware caching, SRv6 enables deterministic traffic steering through specific edge cache nodes or MEC Caching platforms. A network slice for ultra-reliable low-latency communication can encode a path that forces content requests through a local Edge Pre-fetching node, guaranteeing a high Cache Hit Ratio and enforcing strict Quality of Service (QoS) without relying on dynamic routing decisions that could bypass the cache.

ARCHITECTURAL CAPABILITIES

Key Features of SRv6

Segment Routing over IPv6 (SRv6) integrates source routing directly into the IPv6 data plane, enabling network slicing and deterministic traffic steering for slice-aware caching architectures.

01

Source-Based Path Encoding

SRv6 encodes the entire forwarding path as an ordered list of segments (SIDs) within an IPv6 Segment Routing Header (SRH). The ingress node defines the path, eliminating per-flow state in the core. Each SID is a 128-bit IPv6 address representing a topological or service instruction.

  • Topological SIDs: Direct traffic through specific nodes or links
  • Service SIDs: Invoke functions like deep packet inspection or caching proxies
  • End.B6.Encaps: A behavior that steers packets into a specific SRv6 policy
128-bit
SID Address Space
0 state
Core Router State
02

Network Slicing with SRv6

SRv6 enables hard isolation between network slices by binding each slice to a unique locator prefix within the SID space. A single physical infrastructure supports multiple logical networks with distinct QoS guarantees, routing policies, and cache node assignments.

  • Slice-Aware Caching: Steer content requests through slice-specific cache hierarchies
  • Dedicated SID Spaces: Prevent cross-slice interference at the forwarding plane
  • Flex-Algo Integration: Combine SRv6 with IGP Flexible Algorithms for per-slice topology computation
03

Programmable Service Chaining

SRv6 treats network functions as segments, enabling dynamic service function chaining without protocol overhead. A packet can traverse a sequence of cache nodes, firewalls, and load balancers defined entirely by its SID list.

  • SR-aware Cache Nodes: Advertise themselves as service SIDs for content retrieval
  • Dynamic Re-chaining: Modify the SID list mid-path based on cache hit/miss events
  • Stateless Processing: Each node executes its function independently using the SRH
04

Traffic Engineering for Cache Steering

SRv6 policies enable explicit traffic engineering to direct content requests toward optimal cache nodes based on latency, load, and content popularity predictions. The controller computes paths that minimize backhaul utilization.

  • Low-Latency Paths: Route delay-sensitive content through edge caches with sub-millisecond RTT
  • Load-Aware Steering: Distribute requests across cache clusters using weighted SID lists
  • TI-LFA Protection: Sub-50ms failover to backup cache nodes using Topology-Independent Loop-Free Alternates
< 50ms
Protection Switchover
05

SRv6 Network Programming

The SRv6 Network Programming framework defines behaviors bound to SIDs, creating a programmable data plane. End.AN (Auto-Next) and End.DX6 (Decapsulation and IPv6 Cross-Connect) behaviors enable precise cache node selection and traffic termination.

  • End.DT6: Decapsulate and forward to a specific IPv6 table for cache isolation
  • End.B6.Insert.Red: Insert a reduced SRH for bandwidth-constrained links
  • uSID Compression: Compress SID lists to reduce header overhead in cache-bound traffic
06

Slice-Aware Cache Federation

SRv6 enables federated caching across administrative domains by using globally routable SIDs. Different operators or enterprise tenants can share cache infrastructure while maintaining strict traffic isolation through slice-specific SID namespaces.

  • Inter-Domain SIDs: Extend cache steering across AS boundaries without tunneling overlays
  • Tenant-Specific Cache Policies: Assign dedicated cache node SIDs per enterprise slice
  • BGP-LS Advertisement: Distribute cache node SIDs and capabilities via link-state routing protocols
ARCHITECTURAL COMPARISON

SRv6 vs. Traditional MPLS Segment Routing

A feature-level comparison between SRv6 (Segment Routing over IPv6) and traditional MPLS-based Segment Routing for network slicing and traffic engineering.

FeatureSRv6SR-MPLSTraditional MPLS

Data Plane Encapsulation

IPv6 extension header (SRH)

MPLS label stack

MPLS label stack

Control Plane Protocol

IS-IS, OSPFv3, BGP-LS

IS-IS, OSPF, BGP-LS

LDP, RSVP-TE, BGP-LU

Path Encoding Method

128-bit IPv6 SID list in packet header

32-bit label stack pushed onto packet

Per-hop LSP state in network

Network Programmability

End-to-End IP Reachability

Stateless Core

Header Size Overhead

40B IPv6 + 8B per SID

4B per label

4B per label

Maximum SID/Label Depth

Limited by MTU (typically 10-12 SIDs)

Hardware-dependent (typically 8-12 labels)

Hardware-dependent

Native IPv6 Integration

Network Slicing Support

Native via locator function

Via Flex-Algo and slice IDs

Limited, requires overlay

OAM Mechanisms

ICMPv6, in-situ OAM

LSP ping/traceroute

LSP ping/traceroute

Inter-Domain Scalability

High (native IP routing)

Moderate (label swapping)

Low (signaling overhead)

Traffic Steering Granularity

Per-flow, per-packet

Per-flow, per-packet

Per-FEC, per-LSP

Hardware Compatibility

Requires IPv6-capable silicon

Broad MPLS ASIC support

Universal MPLS support

Protocol Complexity

Moderate (leverages IPv6)

Low (mature ecosystem)

High (LDP + RSVP-TE)

SRV6 & PROACTIVE CACHING

Frequently Asked Questions

Explore the mechanics of Segment Routing over IPv6 and its critical role in enabling slice-aware, low-latency content delivery at the network edge.

Segment Routing over IPv6 (SRv6) is a source routing protocol that encodes a path into the packet header itself. Instead of relying on per-hop signaling protocols, the ingress node inserts an ordered list of instructions, called segments, into an IPv6 Segment Routing Header (SRH). Each segment is a 128-bit IPv6 address that identifies a specific network function or a link to traverse. As the packet moves through the network, nodes process these segments sequentially, steering traffic through a precise, pre-determined path. This mechanism provides strict control over the forwarding plane, enabling network operators to define end-to-end policies without maintaining per-flow state in the core network, which is fundamental for implementing network slicing and deterministic latency guarantees.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.