Routing methods, systems, and computer program products
First Claim
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 policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a second node;
identify, based on the first algorithm, a first sequence of identifiers for data routing in a network from the first node in the network to one or more path nodes, where the network includes a label switching network or an Internet Protocol version 6 (IPv6) network;
identify, based on the second algorithm, a second sequence of identifiers for data routing in the network from at least one of the one or more path nodes in the network to the second node;
include the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the second node via a plurality of network paths that each include at least one node in the network; and
provide path information that identifies the third sequence of identifiers that includes the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm, for constraining data routing, according to the policy, to the second node via the at least one of the one or more path nodes, such that the data routing from the first node to the at least one of the one or more path nodes is constrained based on the first algorithm and the data routing from the at least one of the one or more path nodes to the second node is constrained based on the second algorithm.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a non-transitory computer-readable media, a system, and methods are provided to: identify a policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a third node; include a first sequence of identifiers and a second sequence of identifiers in a third sequence of identifiers that reflects the policy such that 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 a label switching network or an Internet Protocol version 6 (IPv6) network; and provide path information that identifies the third sequence of identifiers, for constraining data routing, according to the policy, to the third node via a second node.
472 Citations
51 Claims
-
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 policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a second node; identify, based on the first algorithm, a first sequence of identifiers for data routing in a network from the first node in the network to one or more path nodes, where the network includes a label switching network or an Internet Protocol version 6 (IPv6) network; identify, based on the second algorithm, a second sequence of identifiers for data routing in the network from at least one of the one or more path nodes in the network to the second node; include the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the second node via a plurality of network paths that each include at least one node in the network; and provide path information that identifies the third sequence of identifiers that includes the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm, for constraining data routing, according to the policy, to the second node via the at least one of the one or more path nodes, such that the data routing from the first node to the at least one of the one or more path nodes is constrained based on the first algorithm and the data routing from the at least one of the one or more path nodes to the second node is constrained based on the second algorithm. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. A system, comprising;
-
network means for data routing, where the network means includes a label switching network or an Internet Protocol version 6 (IPv6) network; and topology node means for; identifying a policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a second node; identifying, based on the first algorithm, a first sequence of identifiers for data routing in the network means from the first node in the network means to one or more path nodes; identifying, based on the second algorithm, a second sequence of identifiers for data routing in the network means from at least one of the one or more path nodes in the network means to the second node; including the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the second node via a plurality of network paths that each include at least one node in the network means; and providing path information that identifies the third sequence of identifiers that includes the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm, for constraining data routing, according to the policy, to the second node via the at least one of the one or more path nodes, such that the data routing from the first node to the at least one of the one or more path nodes is constrained based on the first algorithm and the data routing from the at least one of the one or more path nodes to the second node is constrained based on the second algorithm.
-
-
26. A method, comprising:
at a topology node; identifying a policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a second node; identifying, based on the first algorithm, a first sequence of identifiers for data routing in a network from the first node in the network to one or more path nodes, where the network includes a label switching network or an Internet Protocol version 6 (IPv6) network; identifying, based on the second algorithm, a second sequence of identifiers for data routing in the network from at least one of the one or more path nodes in the network to the second node; including the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the second node via a plurality of network paths that each include at least one node in the network; and providing path information that identifies the third sequence of identifiers that includes the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm, for constraining data routing, according to the policy, to the second node via the at least one of the one or more path nodes, such that the data routing from the first node to the at least one of the one or more path nodes is constrained based on the first algorithm and the data routing from the at least one of the one or more path nodes to the second node is constrained based on the second algorithm.
-
27. A method for configuring a topology node, comprising:
-
communicatively coupling at least one non-transitory memory and one or more processors; and causing storage of instructions on the at least one non-transitory memory where the instructions are configured to cause the topology node to; identify a policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a second node; identify, based on the first algorithm, a first sequence of identifiers for data routing in a network from the first node in the network to one or more path nodes, where the network includes a label switching network or an Internet Protocol version 6 (IPv6) network; identify, based on the second algorithm, a second sequence of identifiers for data routing in the network from at least one of the one or more path nodes in the network to the second node; include the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the second node via a plurality of network paths that each include at least one node in the network; and provide path information that identifies the third sequence of identifiers that includes the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm, for constraining data routing, according to the policy, to the second node via the at least one of the one or more path nodes, such that the data routing from the first node to the at least one of the one or more path nodes is constrained based on the first algorithm and the data routing from the at least one of the one or more path nodes to the second node is constrained based on the second algorithm.
-
-
28. A method, comprising:
-
performing at least one act that is configured to cause a topology node to; identify a policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a second node; identify, based on the first algorithm, a first sequence of identifiers for data routing in a network from the first node in the network to one or more path nodes, where the network includes a label switching network or an Internet Protocol version 6 (IPv6) network; identify, based on the second algorithm, a second sequence of identifiers for data routing in the network from at least one of the one or more path nodes in the network to the second node; include the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the second node via a plurality of network paths that each include at least one node in the network; and provide path information that identifies the third sequence of identifiers that includes the first sequence of identifiers identified based on the first algorithm and the second sequence of identifiers identified based on the second algorithm, for constraining data routing, according to the policy, to the second node via the at least one of the one or more path nodes, such that the data routing from the first node to the at least one of the one or more path nodes is constrained based on the first algorithm and the data routing from the at least one of the one or more path nodes to the second node is constrained based on the second algorithm; and causing storage of a result of the at least one act on at least one non-transitory memory. - View Dependent Claims (29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51)
-
Specification