Routing methods, systems, and computer program products for using specific identifiers to transmit data

Patent No. US10389625 (titled "Routing methods, systems, and computer program products for using specific identifiers to transmit data") on Aug 10, 2018. The application was issued on Aug 20, 2019.

What is this patent about?

’625 is related to the field of network routing and addressing, specifically within label switching environments. It addresses the limitations of global addressing schemes, such as IPv4 and IPv6, by proposing a system where nodes utilize identifiers that are contextually relevant to specific regions or individual nodes rather than relying on a globally unique address space. This approach aims to mitigate latency and scalability issues inherent in traditional internet protocols by redefining how names, addresses, and routes are mapped across a network topology.

The underlying idea behind ’625 is the implementation of a node-specific identifier space, where the meaning of a protocol address is defined solely by the context of the node currently processing the packet. Instead of a fixed global destination, the invention uses a relative addressing mechanism where each node translates an incoming identifier into a corresponding identifier recognized by the next hop in the path. This creates a localized mapping chain that allows for efficient data forwarding without requiring every node to maintain a comprehensive global routing table.

The claims of ’625 focus on an apparatus and method for managing data transmission in a label switching network by mapping identifiers between different scope-specific address spaces. Specifically, the independent claims describe a current node that receives information identifying a particular node in a next node's identifier space, maps it to a local identifier, and stores this association. When a packet arrives, the current node uses its local identifier to locate the stored association, translates the identifier back to the next node's context, and forwards the data along the identified network path.

In practice, this system functions by having nodes exchange information to establish a path-based protocol address composed of multiple path segment identifiers. When a packet traverses the network, the current node identifies the next network interface by evaluating the segment of the address relevant to its own position. This allows the network to operate using nested protocol addresses, where each layer of the address provides the specific routing instructions needed for a particular hop, effectively embedding the route within the address itself.

This invention differs from prior approaches by challenging the traditional distinction between an address (where a node is) and a route (how to get there). While standard IP routing requires a lookup against a global prefix, ’625 utilizes region-scoped node identifiers that may be identical across different nodes but carry different meanings based on the local scope. By using these relative, localized identifiers, the system reduces the overhead of global address management and enables more flexible, topology-aware routing that can adapt to the specific physical or logical layout of the network.

How does this patent fit in bigger picture?

Technical Landscape

In the early 2010s when ’625 was filed, network routing was typically implemented using global addressing schemes where a clear 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 manage global uniqueness, hardware and software constraints made the dynamic resolution of multi-hop paths non-trivial without significant overhead in routing table size and lookup latency. In these environments, packet forwarding was generally constrained by fixed-length address architectures that required extensive mapping between high-level names and low-level network routes at the edges of the network.

Prosecution Position

The disclosed invention represents a meaningful technical advancement through an architectural shift that integrates routing and addressing into a path-based or scope-specific protocol. By utilizing node-specific identifier spaces and mapping identifiers between adjacent nodes, the system enables a recursive or nested addressing structure that inherently encodes path information within the protocol address itself. This integration overcomes the technical constraints of traditional global addressing by allowing nodes to identify network interfaces and next-hop paths through localized lookup data and identifier associations. The resulting technical effect is a more flexible routing capability that reduces the reliance on global address uniqueness and simplifies the mapping between a node's identity and the physical route required to reach it.

Claims

This patent contains 59 claims, with claims 1, 6, 11, 29, 46, and 51 serving as the independent claims. The independent claims focus on an apparatus and method for managing data transmission within a label switching network by utilizing node-specific or region-scoped identifier spaces to map and associate identifiers for specific nodes along a network path. The dependent claims generally serve to further define the technical specifications of the identifier spaces, specify the types of network interfaces used, and detail the structural or procedural variations of the mapping and lookup processes.

Key Claim Terms New

Definitions of key terms used in the patent claims.

Term (Source)Support for SpecificationInterpretation
Label switching network
(Claim 1, Claim 6, Claim 11, Claim 29, Claim 46, Claim 51)
The current node is configured to be positioned in a label switching network. The apparatus uses identifiers and associations to map paths through this network. Routing is performed by identifying identifiers in packet headers to locate network interfaces for transmission.A network environment where data is directed from one node to the next based on short path labels rather than long network addresses, avoiding complex lookups in a routing table.
Network interface of the particular node
(Claim 6, Claim 11, Claim 46, Claim 51)
The current node stores lookup data that associates the region scoped node identifier or scope-specific identifier with a network interface of the particular node. The current node determines its own network interface for transmitting data based on the identified network interface of the target node. This association facilitates the final hop or path selection to reach the destination.The specific physical or logical connection point of a target node that is associated with a unique identifier within a given scope or node-specific space for routing purposes.
Node-specific identifier space
(Claim 1, Claim 29)
The identifier that identifies the particular node for the current node has a meaning for the current node defined solely by the node-specific identifier space specific to the current node. The current node maps an identifier from a next node's specific space to its own specific space. This allows for routing based on local associations rather than global addressing.A set of identifiers where the meaning of a specific identifier is defined solely by and is unique to a particular node, rather than being globally unique across the entire network.
Region scoped node identifier
(Claim 6, Claim 46)
The region scoped node identifier is in a region scoped identifier space for the region that further includes a plurality of nodes. Each node in the plurality of nodes has a respective identifier space configured with a node-specific identifier that identifies the particular node and is identical to the region scoped node identifier. This allows for consistent identification of a node across a defined subset of the network.An identifier within a specific identifier space that has a scope spanning a defined region of a network, where multiple nodes within that region use the same identifier to refer to a specific target node.
Scope-specific identifier
(Claim 11, Claim 51)
The scope-specific identifier is in an identifier space that is specific to at least one node, wherein the at least one node does not include a particular node. The scope-specific identifier identifies the particular node for each node in the at least one node. It has a meaning for the at least one node defined solely by the identifier space that is specific to that node or group of nodes.An identifier belonging to an identifier space that is specific to a defined set of at least one node (excluding the target node itself), where the identifier's meaning is defined solely by that specific scope.

Litigation Cases New

US Latest litigation cases involving this patent.

Case NumberFiling DateTitle
4:25-cv-00853Aug 7, 2025Morris Routing Technologies, LLC v. Comcast Business Communications, LLC et al

Patent Family

Patent Family

File Wrapper

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

US10389625

Application Number
US16101387A
Filing Date
Aug 10, 2018
Publication Date
Aug 20, 2019
External Links
Slate, USPTO , Google Patents