Patent No. US10652134 (titled "Routing methods, systems, and computer program products") on Jun 26, 2019. The application was issued on May 12, 2020.
’134 is related to the field of network packet forwarding and source-based routing. Specifically, it addresses the challenges of managing network traffic and latency in growing global networks by moving away from traditional destination-based lookups toward a more explicit, path-oriented approach.
The underlying idea behind ’134 is the use of segment routing to encode an entire network path directly into a packet header. Instead of each router independently deciding the next hop based on a global address, the source node pre-calculates a sequence of instructions—represented as a set of identifiers—that dictates the exact route a packet must follow through the network fabric.
The claims of ’134 focus on a system and method where a first node receives path information and generates a set of segment identifiers that uniquely encodes that path. These identifiers are designed to correspond to entries in forwarding tables stored at each segment-routing-enabled node along the route, ensuring that the packet is steered according to the pre-defined sequence.
In practice, the invention works by having the ingress node select between different types of identifiers, such as nodal segment identifiers for specific nodes or adjacency segment identifiers for specific links. By stacking these identifiers in the packet header, the network can implement explicit traffic engineering without requiring every intermediate router to maintain a massive, synchronized state of the entire network's topology.
This approach differs from prior solutions by collapsing the distinction between names, addresses, and routes. While traditional IP routing relies on complex distributed protocols to converge on a path, this path-based protocol address allows for source-defined steering, which significantly reduces the processing overhead at intermediate hops and provides more granular control over network latency and resource utilization.
In the early 2010s when ’134 was filed, network routing was typically implemented using a rigid distinction between a node's identity and its location, where systems commonly relied on global addressing schemes like IPv4 or IPv6 to determine data paths. At a time when routing tables were becoming increasingly large and complex due to the exhaustion of 32-bit address spaces, hardware and software constraints made the dynamic mapping of names directly to network paths non-trivial. Standard engineering practices generally separated the functions of naming, addressing, and routing into discrete layers, requiring gateways and routers to perform intensive lookups to resolve a destination address into a specific sequence of hops or local network interfaces.
The disclosed invention represents a technical advancement through the architectural shift from destination-based lookup to path-based protocol addressing. By generating a set of segment identifiers that encode an explicit path directly into a packet header, the system enables a source node to define a sequence of nodes or links for a packet to traverse. This integration of path information into the address itself overcomes the technical constraints of traditional routing tables by utilizing nodal and adjacency segment identifiers stored in forwarding tables at each enabled node. The resulting technical effect is the capability to perform source-directed routing without requiring every intermediate node to maintain exhaustive global routing state, thereby streamlining the mapping between a network name and the physical route taken to reach it.
This patent contains a total of 89 claims, with claims 1, 8, and 16 serving as the independent claims. The independent claims focus on a system, method, and apparatus for segment routing that involves receiving path information between nodes, generating a set of segment identifiers to encode that path based on tables stored at segment routing enabled nodes, and storing those identifiers at a node for inclusion in a packet header. The dependent claims serve to specify technical details such as the use of nodal or adjacency segments, shortest path calculations, identifier space configurations, and specific network policies or protocols for selecting and modifying path segments without additional control signaling.
Definitions of key terms used in the patent claims.
US Latest litigation cases involving this patent.

The dossier documents provide a comprehensive record of the patent's prosecution history - including filings, correspondence, and decisions made by patent offices - and are crucial for understanding the patent's legal journey and any challenges it may have faced during examination.
Get instant alerts for new documents