Computing disjoint paths for reactive routing mesh networks
First Claim
1. A method, comprising:
- transmitting, from a source node, route request (RREQ) messages toward a destination node of a reactive routing computer network, each RREQ message including an indication that the RREQ message should be transmitted all the way to the destination node even when an intermediate node en-route to the destination node already has a route to the destination node;
recording, at one or more intermediate nodes, a traversed path of the RREQ messages within the RREQ messages;
receiving one or more of the RREQ messages at the destination node during a configured time period after receiving an initial RREQ message of the RREQ messages at the destination node; and
determining two or more routes from the source node to the destination node based on the received RREQ messages at the destination node and one or more path selection criteria.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.
45 Citations
21 Claims
-
1. A method, comprising:
-
transmitting, from a source node, route request (RREQ) messages toward a destination node of a reactive routing computer network, each RREQ message including an indication that the RREQ message should be transmitted all the way to the destination node even when an intermediate node en-route to the destination node already has a route to the destination node; recording, at one or more intermediate nodes, a traversed path of the RREQ messages within the RREQ messages; receiving one or more of the RREQ messages at the destination node during a configured time period after receiving an initial RREQ message of the RREQ messages at the destination node; and determining two or more routes from the source node to the destination node based on the received RREQ messages at the destination node and one or more path selection criteria. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method, comprising:
-
logically partitioning a reactive routing computer network into two or more diverse logical topologies, wherein a differing set of nodes of the reactive routing computer network is associated with each of the logical topologies; transmitting, from a source node, one or more route request (RREQ) messages toward a destination node on each of the logical topologies, each RREQ message having an indication of a corresponding logical topology and an indication that it should be transmitted all the way to the destination node even when an intermediate node en-route to the destination node already has a route to the destination node; receiving, at the source node, one or more route reply (RREP) messages, each RREP message indicating a route to reach the destination node using a subset of the set of nodes associated with a corresponding logical topology; and selecting a route for each logical topology for which a RREP message was received, to reach the destination node from the source node, based on the received one or more RREP messages. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An apparatus, comprising:
-
one or more network interfaces adapted to interface with a reactive routing computer network logically partitioned into two or more diverse logical topologies, wherein a differing set of nodes of the reactive routing computer network is associated with each of the logical topologies; a processors coupled to the network interfaces and adapted to execute one or more processes; and a memory adapted to store a reactive routing process executable by each processor, the process when executed operable to transmit one or more route request (RREQ) messages toward a destination node on each of the logical topologies, each RREQ message having an indication of a corresponding logical topology and an indication that it should be transmitted all the way to the destination node even when an intermediate node en-route to the destination node already has a route to the destination node; and
further operable to receive one or more route reply (RREP) messages, each RREP message indicating a route to reach the destination node using a subset of the set of nodes associated with a corresponding logical topology, and to select a route for each logical topology for which a RREP message was received, to reach the destination node from the apparatus, based on the received RREP message. - View Dependent Claims (20)
-
-
21. A system, comprising:
-
a reactive routing computer network initially logically partitioned into two or more diverse logical topologies, wherein a differing set of nodes of the reactive routing computer network is associated with each of the logical topologies; a destination node of the network; one or more intermediate nodes of the network, the intermediate nodes each corresponding to a particular logical topology; a source node of the network, the source node configured to transmit one or more route request (RREQ) messages toward the destination node on each of the logical topologies, each RREQ message having an indication of a corresponding logical topology and an indication that it should be transmitted all the way to the destination node even when an intermediate node en-route to the destination node already has a route to the destination node, the source node further configured to receive one or more route reply (RREP) messages, each RREP message indicating a route to reach the destination node using a subset of the set of nodes associated with a corresponding logical topology, and to select a route for each logical topology for which a RREP message was received, to reach the destination node from the source node, based on the received RREP message; and wherein the source node is further configured to determine whether two or more diverse routes exist from the source node to the destination node based on a number of diverse logical topologies, and when two or more diverse routes do not exist, to transmit second RREQ messages toward the destination node, each second RREQ message having an indication that it should be transmitted all the way to the destination node even when an intermediate node en-route to the destination node already has a route to the destination node and not having any corresponding logical topology, and wherein the intermediate nodes are configured to record a traversed path of the second RREQ messages within the second RREQ messages; and wherein the destination node is configured to receive one or more of the second RREQ messages during a configured time period after receiving an initial second RREQ message of the second RREQ messages at the destination node, and to determine two or more routes from the source node to the destination node based on the received second RREQ messages at the destination node and one or more path selection criteria.
-
Specification