Patent No. US10382327 (titled "Methods, systems, and computer program products for routing using headers including a sequence of node scope-specific identifiers") on Aug 10, 2018. The application was issued on Aug 13, 2019.
’327 is related to the field of network routing and packet forwarding, specifically within Multiprotocol Label Switching (MPLS) environments. It addresses the limitations of traditional global addressing schemes, such as IPv4 and IPv6, which face scalability issues and increasing latency as networks expand. The invention proposes a shift from identifying 'where' a node is located to defining 'how' to reach it by utilizing path-based information rather than fixed global addresses.
The underlying idea behind ’327 is the use of a path-based protocol address composed of a sequence of identifiers that are specific to the local context of each node along a route. Instead of a single global identifier, the system uses a chain of node scope-specific identifiers, where each segment of the address only needs to be meaningful to the node currently processing the packet. This allows for a highly efficient, source-routed approach where the path is baked into the packet header itself, reducing the need for complex global routing tables at every intermediate hop.
The claims of ’327 focus on a current node in an MPLS network that identifies a specific sequence of these scope-specific identifiers to reach a destination. The node extracts the first identifier in the sequence to determine the immediate next hop and then generates a modified header containing only the remaining identifiers. By transmitting the data with this truncated sequence, the current node ensures that the next node in the path receives a header where its own relevant local identifier is now at the front of the queue.
In practice, this mechanism functions like a self-navigating map where each instruction is discarded once followed. When a packet arrives at a router, the device looks at the leading scope-specific identifier, which might simply be a local port number or a short index unique to that router's neighborhood. Because the identifier is local to that specific node's address space, the same bit pattern could represent entirely different physical paths when encountered by a different router later in the sequence, allowing for massive address reuse across the network.
This approach differentiates itself from prior art by effectively merging the concepts of naming, addressing, and routing into a single nested protocol address. Unlike standard MPLS which relies on label distribution protocols to set up paths in advance, this invention allows for dynamic path selection based on policy or real-time network conditions at the source. By utilizing interface-based identifiers that are optimized for size and processing speed, the system minimizes header overhead and eliminates the lookup latency associated with massive global routing databases.
In the early 2010s when ’327 was filed, network routing was typically implemented using global addressing schemes where a distinction was maintained between a node's identity and the path used to reach it. At a time when systems commonly relied on centralized or hierarchical address allocation to ensure global uniqueness, hardware and software constraints made the dynamic resolution of multi-hop paths non-trivial without significant routing table overhead. In these environments, packet forwarding generally required each intermediate router to perform independent lookups against large, globally-synchronized routing tables, as protocol addresses were decoupled from the underlying network topology.
The disclosed invention represents a technical advancement through an architectural shift from global destination-based routing to path-based protocol addressing within a Multiprotocol Label Switching (MPLS) environment. By integrating a sequence of node scope-specific identifiers directly into the packet header, the system enables a source node to define a specific multi-hop trajectory where each identifier is valid only within the local context of a corresponding node in the path. This structural solution overcomes the technical constraints of traditional global address resolution by allowing intermediate nodes to identify the next hop using localized identifier spaces, thereby reducing the reliance on global routing state and enabling more granular control over network paths based on specific policies or node-level constraints.
This patent contains 58 claims, with claims 1, 28, 29, and 31 serving as the independent claims. The independent claims focus on an apparatus, a computer-readable medium, and methods for routing data in a Multiprotocol Label Switching network by identifying a sequence of node scope-specific identifiers that correspond to specific identifier spaces for each node along a path to a receiving node. The dependent claims serve to further define the specific types of network interfaces identified, the methods for mapping and receiving identifier information from controllers or other nodes, the selection criteria for the identifier sequences, and the physical or logical characteristics of the network nodes and paths involved.
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