US 12,058,042 C1 (13,171st)
Routing methods, systems, and computer program products
Robert Paul Morris, Raleigh, NC (US)
Filed by MORRIS ROUTING TECHNOLOGIES, LLC, Plano, TX (US)
Assigned to MORRIS ROUTING TECHNOLOGIES, LLC, Plano, TX (US)
Reexamination Request No. 90/019,911, Apr. 14, 2025.
Reexamination Certificate for Patent 12,058,042, issued Aug. 6, 2024, Appl. No. 16/691,600, Nov. 21, 2019.
Ex Parte Reexamination Certificate issued on Jan. 30, 2026.
Int. Cl. H04L 45/50 (2022.01); H04L 45/00 (2022.01); H04L 45/02 (2022.01); H04L 61/106 (2022.01); H04L 61/4511 (2022.01); H04L 45/12 (2022.01); H04W 40/38 (2009.01)
CPC H04L 61/4511 (2022.05) [H04L 45/02 (2013.01); H04L 45/34 (2013.01); H04L 45/50 (2013.01); H04L 61/106 (2013.01); H04L 45/126 (2013.01); H04W 40/38 (2013.01)]
OG exemplary drawing
AS A RESULT OF REEXAMINATION, IT HAS BEEN DETERMINED THAT:
Claims 1-20 are cancelled.
1. A non-transitory computer-readable media storing instructions, that when executed by one or more processors of a topology node, cause the topology node to:
identify a first sequence of identifiers for data routing in a label switching network from a first node in the label switching network;
identify a second sequence of identifiers for the data routing in the label switching network from a second node in the label switching network;
identify a policy for use in constraining the data routing from the first node to a third node, the data routing being performed and constrained using a protocol that does not require a separate protocol to reserve a resource required according to the policy;
include the first sequence of identifiers and the second sequence of identifiers in a third sequence of identifiers that reflects the policy such that the data routing is constrained from the first node to the third node via a plurality of network paths that each include at least one node in the label switching network; and
provide path information that identifies the third sequence of identifiers, for constraining the data routing, according to the policy, to the third node via the second node, such that the data routing from the first node to the second node is constrained based on a first algorithm and the data routing from the second node to the third node is constrained based on a second algorithm and not on the first algorithm.