Mintree-based routing in highly constrained networks
First Claim
1. A method, comprising:
- hosting a path computation element (PCE) at a capable node in a computer network;
receiving, at the capable node, one or more neighborhood discovery (ND) messages including neighborhood information from a plurality of nodes in the computer network;
computing centrally in the computer network, with the PCE, a minimum spanning tree (MinTree) for the plurality of nodes in the computer network based on the neighborhood information, the MinTree dividing the plurality of nodes in the computer network into a first subset of routing nodes (R nodes) and a second subset of host nodes (H nodes), the first subset of the R nodes forming one or more interconnected paths of the R nodes within the MinTree, and each H node within the second subset of the H nodes located within one hop of at least one R node; and
communicating a MinTree message including MinTree information to the plurality of nodes in the computer network to build the MinTree, the Min Tree information providing information identifying which nodes of the plurality of nodes are R nodes and which nodes of the plurality of nodes are H nodes, the Min Tree information enabling routing on each R node in the first subset of the R nodes.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a capable node in a computer network may host a path computation element, receive one or more neighborhood discovery messages including neighborhood information from a plurality of nodes in the computer network, and compute a minimum spanning tree (MinTree) for the computer network based on the neighborhood information. The MinTree may divide the plurality of nodes in the computer network into a first subset of routing nodes and a second subset of host nodes. The first subset of routing nodes may form one or more interconnected paths of routing nodes within the MinTree, and each host node within the second subset of host nodes may be located within one hop of at least one routing node. The capable node may then communicate a MinTree message to the plurality of nodes in the computer network to build the MinTree by enabling routing on each routing node.
-
Citations
21 Claims
-
1. A method, comprising:
-
hosting a path computation element (PCE) at a capable node in a computer network; receiving, at the capable node, one or more neighborhood discovery (ND) messages including neighborhood information from a plurality of nodes in the computer network; computing centrally in the computer network, with the PCE, a minimum spanning tree (MinTree) for the plurality of nodes in the computer network based on the neighborhood information, the MinTree dividing the plurality of nodes in the computer network into a first subset of routing nodes (R nodes) and a second subset of host nodes (H nodes), the first subset of the R nodes forming one or more interconnected paths of the R nodes within the MinTree, and each H node within the second subset of the H nodes located within one hop of at least one R node; and communicating a MinTree message including MinTree information to the plurality of nodes in the computer network to build the MinTree, the Min Tree information providing information identifying which nodes of the plurality of nodes are R nodes and which nodes of the plurality of nodes are H nodes, the Min Tree information enabling routing on each R node in the first subset of the R nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method, comprising:
-
receiving, at a node in a computer network, a minimum spanning tree (MinTree) message from a capable node centrally located in the computer network, the MinTree message dividing a plurality of nodes in the computer network into a first subset of routing nodes (R nodes) and a second subset of host nodes (H nodes), the first subset of the R nodes forming one or more interconnected paths of the R nodes within a MinTree, and each H node within the second subset of the H nodes located within one hop of at least one R node; self-identifying, based on the MinTree message, as either one of the R nodes or one of the H nodes; in response to the node self-identifying as one of the R nodes, enabling routing functionality on the node; and determining a relative rank of the node self-identified as one of the R nodes with respect to one or more of the R nodes in the one or more interconnected paths of the R nodes within the MinTree, wherein a higher rank indicates a further distance from a root node of the MinTree than a lower rank. - View Dependent Claims (11, 12, 13, 14, 15, 16)
-
-
17. An apparatus, comprising:
-
one or more network interfaces to communicate with a computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; host a path computation element (PCE) at a capable node in a computer network; receive, at the capable node, one or more neighborhood discovery (ND) messages including neighborhood information from a plurality of nodes in the computer network; compute centrally in the computer network, with the PCE, a minimum spanning tree (MinTree) for the plurality of nodes in the computer network based on the neighborhood information, the MinTree dividing the plurality of nodes in the computer network into a first subset of routing nodes (R nodes) and a second subset of host nodes (H nodes), the first subset of the R nodes forming one or more interconnected paths of the R nodes within the MinTree, and each H node within the second subset of H nodes located within one hop of at least one R node of the R nodes; and communicate a MinTree message including MinTree information to the plurality of nodes in the computer network to build the MinTree, the Min Tree information providing information identifying which nodes of the plurality of nodes are R nodes and which nodes of the plurality of nodes are H nodes, the Min Tree information enabling routing on each R node in the first subset of the R nodes. - View Dependent Claims (18)
-
-
19. An apparatus, comprising:
-
one or more network interfaces to communicate with a computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; receive, at a node in a computer network, a minimum spanning tree (MinTree) message from a capable node centrally located in the computer network, the MinTree message dividing a plurality of nodes in the computer network into a first subset of routing nodes (R nodes) and a second subset of host nodes (H nodes), the first subset of the R nodes forming one or more interconnected paths of the R nodes within a MinTree, and each H node within the second subset of the H nodes located within one hop of at least one R node; self-identify, based on the MinTree message, as either one of the R nodes or one of the H nodes;
in response to self-identifying as one of the R nodes, enable routing functionality on the node; anddetermine a relative rank of the node self-identified as one of the R nodes with respect to one or more of the R nodes in the one or more interconnected paths of the R nodes within the MinTree, wherein a higher rank indicates a further distance from a root node of the MinTree than a lower rank. - View Dependent Claims (20, 21)
-
Specification