Reactive and proactive routing protocol interoperation in low power and lossy networks

• US 8,934,496 B2
• Filed: 07/30/2012
• Issued: 01/13/2015
• Est. Priority Date: 07/30/2012
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Vasseur, Jean-Philippe
• Primary Examiner(s): Lai, Andrew
• Assistant Examiner(s): Ganguly, Sumitra
• Application Number:
  US13/561,716
• Publication Number:
  US 20140029624A1
• Time in Patent Office: 897 Days
• Field of Search: 370/401, 370/338, 370/328, 370/238, 370/310, 370/389, 370/392, 709/238
• US Class Current: 370/401
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04W 40/26 for hybrid routing by combining proactive and reactive routing
• CPC Class Codes: H04W 40/28 for reactive routing
• CPC Class Codes: H04W 40/30 for proactive routing
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

In one embodiment, a border node between a reactive routing network and a proactive routing network may receive an inter-domain route request (RREQ) from a requestor for a destination, and determines whether it knows the destination. In response to knowing the destination, the border node responds to the requestor. However, in response to not knowing the destination at the border node, when the border node is ingressing the inter-domain RREQ into the proactive routing network, it sends the inter-domain RREQ to each other border node of the proactive routing network. Alternatively, when the border node is ingressing the inter-domain RREQ into the reactive routing network, it sends the inter-domain RREQ into the reactive routing network.

Claims

1. A method, comprising:

receiving, at a first border node between a reactive routing network and a proactive routing network that includes a plurality of border nodes, unsolicited route reply (RREP) packets from each other border node of the proactive routing network, wherein an unsolicited RREP from a particular other border node includes an address of the other border node and an indication that the other border node borders the proactive routing network and another reactive routing network;

receiving, at the first border node, an inter-domain route request (RREQ) from a requestor for a destination;

determining whether the destination is known to the first border node;

in response to knowing the destination at the first border node, responding to the requestor; and

in response to not knowing the destination at the first border node;

when the first border node is ingressing the inter-domain RREQ into the proactive routing network, encapsulating the inter-domain RREQ in a multicast message and sending the encapsulated multicast message to each of the other border nodes of the proactive routing network, wherein routes to the other border nodes are known to the first border node based on the unsolicited RREP packets from the other border nodes; and

when the first border node is ingressing the inter-domain RREQ into the reactive routing network, stripping the inter-domain RREQ from a multicast message sent from one of the other border nodes and sending the stripped inter-domain RREQ into the reactive routing network as a flooded request.

2. The method as in claim 1, wherein in response to knowing the destination at the first border node, responding to the requestor comprises:

returning a route reply (RREP) to the requestor, wherein the first border node is between the reactive routing network of the requestor and the proactive routing network.

3. The method as in claim 1, further comprising:

advertising a capability of the first border node to act as a border node to the other border nodes in the proactive routing network as an unsolicited RREP message.

4. The method as in claim 1, wherein in response to not knowing the destination at the first border node, and when the first border node is ingressing the inter-domain RREQ into the reactive routing network, the method further comprises:

determining that no route reply (RREP) is received from the reactive routing network; and

, in response,

discarding the inter-domain RREQ.

5. The method as in claim 1, wherein in response to not knowing the destination at the first border node, and when the first border node is ingressing the inter-domain RREQ into the reactive routing network, the method further comprises:

determining that a route reply (RREP) is received from the reactive routing network for the destination in response to ingressing the inter-domain RREQ into the reactive routing network; and

in response to determining that the RREP is received;

updating the proactive routing network with routing topology information for the destination; and

returning the RREP to a border node ingressing the inter-domain RREQ into the proactive routing network.

6. The method as in claim 1, wherein in response to not knowing the destination at the first border node, and when the first border node is ingressing the inter-domain RREQ into the proactive routing network, the method further comprises:

sending the requestor an advanced route reply (RREP) to indicate the ingressing of the inter-domain RREQ into the proactive routing network to cause the requestor to increase its wait time for a true RREP.

7. The method as in claim 1, wherein in response to not knowing the destination at the first border node, and when the first border node is ingressing the inter-domain RREQ into the proactive routing network, the method further comprises:

sending the inter-domain RREQ to each other border node of the proactive routing network upon expiration of random backoff timer without having received a duplicate inter-domain RREQ from another border node also between the reactive routing network and proactive routing network.

8. The method as in claim 1, wherein in response to not knowing the destination at the first border node, and when the first border node is ingressing the inter-domain RREQ into the proactive routing network, sending the inter-domain RREQ to each other border node of the proactive routing network comprises:

sending the inter-domain RREQ to a root node of the proactive routing network in a non-storing mode, wherein the root node forwards the inter-domain RREQ to each other border node of the proactive routing network.

9. The method as in claim 1, further comprising:

using loose-hop routing between the border nodes of the proactive routing network to route subsequently sent messages to the destination.

10. The method as in claim 1, further comprising:

receiving a negative routing update for the destination at the first border node ingressing the inter-domain RREQ into the proactive routing network; and

, in response,

sending an unsolicited route reply (RREP) to the requestor indicating that a route to the destination is no longer valid.

11. The method as in claim 1, wherein the inter-domain RREQ is explicitly indicated as being an inter-domain RREQ.

12. An apparatus, comprising:

one or more network interfaces to communicate as a border node between a reactive routing network and a proactive routing network;

a processor coupled to the network interfaces and configured 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 unsolicited route reply (RREP) packets from each other border node of the proactive routing network, wherein an unsolicited RREP from a particular other border node includes an address of the other border node and an indication that the other border node borders the proactive routing network and another reactive routing network;

receive an inter-domain route request (RREQ) from a requestor for a destination;

determine whether the destination is known to the border node;

in response to knowing the destination at the border node, respond to the requestor; and

in response to not knowing the destination at the border node;

when the border node is ingressing the inter-domain RREQ into the proactive routing network, encapsulate the inter-domain RREQ in a multicast message and send the encapsulated multicast message to each of the other border nodes of the proactive routing network, wherein routes to the other border nodes are known to the first border node based on the unsolicited RREP packets from the other border nodes; and

when the border node is ingressing the inter-domain RREQ into the reactive routing network, strip the inter-domain RREQ from a multicast message sent from one of the other border nodes and send the stripped inter-domain RREQ into the reactive routing network as a flooded request.

13. The apparatus as in claim 12, wherein the process when executed to respond to the requestor in response to knowing the destination at the border node is further operable to:

return a route reply (RREP) to the requestor when the border node is between the reactive routing network of the requestor and the proactive routing network.

14. The apparatus as in claim 12, wherein the process, when executed in response to not knowing the destination at the border node, and when the border node is ingressing the inter-domain RREQ into the reactive routing network, is further operable to:

determine that a route reply (RREP) is received from the reactive routing network for the destination in response to ingressing the inter-domain RREQ into the reactive routing network; and

in response to determining that the RREP is received;

update the proactive routing network with routing topology information for the destination; and

return the RREP to a border node ingressing the inter-domain RREQ into the proactive routing network.

15. The apparatus as in claim 12, wherein the process, when executed to send the inter-domain RREQ to each other border node of the proactive routing network in response to not knowing the destination at the border node when the border node is ingressing the inter-domain RREQ into the proactive routing network, is further operable to:

send the inter-domain RREQ to a root node of the proactive routing network in a non-storing mode, wherein the root node forwards the inter-domain RREQ to each other border node of the proactive routing network.

16. The apparatus as in claim 12, wherein the process when executed is further operable to:

loose-hop route subsequently sent messages to the destination between border nodes of the proactive routing network.

17. A tangible, non-transitory, computer-readable media having software encoded thereon, the software when executed by a processor operable to:

receive, at a border node that borders a reactive routing network and a proactive routing network, unsolicited route reply (RREP) packets from each other border node of the proactive routing network, wherein an unsolicited RREP from a particular other border node includes an address of the other border node and an indication that the other border node borders the proactive routing network and another reactive routing network;

receive an inter-domain route request (RREQ) from a requestor for a destination;

determine whether the destination is known to the border node;

in response to knowing the destination at the border node, respond to the requestor; and

in response to not knowing the destination at the border node;

when the border node is ingressing the inter-domain RREQ into the proactive routing network, encapsulate the inter-domain RREQ in a multicast message and send the encapsulated multicast message to each of the other border nodes of the proactive routing network, wherein routes to the other border nodes are known to the first border node based on the unsolicited RREP packets from the other border nodes; and

when the border node is ingressing the inter-domain RREQ into the reactive routing network, strip the inter-domain RREQ from a multicast message sent from one of the other border nodes and send the stripped inter-domain RREQ into the reactive routing network as a flooded request.