Patent No. US10652133 (titled "Routing methods, systems, and computer program products") on Jun 26, 2019. The application was issued on May 12, 2020.
’133 is related to the field of network routing and packet forwarding, specifically addressing the limitations of traditional Internet Protocol (IP) routing. In conventional IP networks, routing is typically based on a destination address where each intermediate node independently determines the next hop. This patent explores a shift toward path-based addressing, where the route or specific segments of a path are encoded directly within the packet to provide more granular control over the data's journey through the network.
The underlying idea behind ’133 is to embed explicit path information into the packet header itself, allowing the network to function more like a source-routed system. By utilizing segment identifiers (SIDs), the invention enables a node to steer a packet through a specific sequence of hops or network segments. This mechanism effectively collapses the distinction between a name, an address, and a route, allowing the packet to carry its own instructions for navigation rather than relying solely on the independent routing tables of every intermediate switch or router.
The claims of ’133 focus on a system and method where a node receives a packet with an IP header and modifies it by adding a first extension header. This extension header contains a list of elements, each representing a specific segment identifier. The node then updates the packet by writing one of these SIDs from the list directly into the destination IP address field of the IP header. This process ensures that the packet is directed to the specific network segment or node identified by the current SID in the sequence.
In practice, the invention operates by dynamically updating the destination field as the packet traverses the network. When a node receives an IPv6 packet, it inspects the segment routing (SR) header to determine if the current destination address matches a SID in the segment list. If a match is found, the node utilizes a specialized forwarding table to advance the packet. This allows for complex path steering where the destination address field acts as a pointer to the current active segment of the overall path.
This approach differs from prior solutions by eliminating the need for every node to maintain a global view of the network topology. Instead of traditional hop-by-hop lookups based on a static final destination, the invention uses nested protocol addresses and extension headers to provide a self-contained routing instruction set. By overwriting the destination field with the next SID in the list, the system repurposes standard IP header fields to support sophisticated source routing and traffic engineering without requiring a complete overhaul of existing IP infrastructure.
In the early 2010s when ’133 was filed, global networking infrastructure was facing significant scaling challenges due to the exhaustion of traditional 32-bit address spaces and the increasing complexity of wide-area routing tables. At a time when network routing was typically implemented using a strict functional separation between naming, addressing, and path determination, systems commonly relied on fixed-length hierarchical protocol addresses that identified a node's location rather than the specific path required to reach it. Hardware and software constraints of this era made the dynamic integration of routing instructions directly into the protocol header non-trivial, as standard architectures were optimized for destination-based forwarding using longest-prefix matching against large, centralized routing databases.
The disclosed invention represents a meaningful technical advancement through the architectural shift from location-based addressing to path-based routing within an internet protocol (IP) framework. By integrating segment identifiers (SIDs) directly into the destination address field of an IP header and utilizing extension headers to maintain a list of path elements, the system enables a source-routing capability that overcomes the rigid constraints of traditional hop-by-hop forwarding. This structural solution allows a packet to carry its own routing instructions, achieving the technical effect of reducing the reliance on intermediate node routing tables and enabling more granular control over the network path. The integration of nested or scope-specific identifiers further enhances the efficiency of address space utilization, addressing the technical problem of network latency and the overhead associated with global address resolution.
This patent contains a total of 127 claims, with independent claims 1, 6, 12, 17, 92, 100, 106, 110, 116, and 122 focusing on systems, methods, and computer-readable media for processing network packets using segment routing. These independent claims specifically address receiving packets with IP headers, adding or updating extension headers containing lists of segment identifiers, and forwarding packets based on these identifiers or updating the packet by adding new segment elements. The dependent claims serve to further define these processes by specifying policy lists, secondary extension headers, path calculation methods, segment types such as nodal or adjacency identifiers, and mechanisms for detecting rerouting or path completion through bit settings and list comparisons.
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