Two-hop relay for reducing distance vector routing information
First Claim
1. A method comprising:
- receiving, at a node in a communications network, an update message for a distance vector routing protocol from a first neighbor of a plurality of neighbors, wherein the update message indicates a destination in the communications network and a least total cost of reaching that destination from the first neighbor, wherein the node is configured to filter at least one change in cost for a selected network address such that it is not forwarded;
sending, to a different neighbor of the plurality of neighbors, the update message, wherein if the change in cost for the selected network address is for a sole address provided in the update message, then the update message is not forwarded by the node;
sending the update message to the different neighbor of the plurality of neighbors if the node is a relay node for the first neighbor, wherein the relay node is a node preferred by the first neighbor to update a particular node a certain number of hops from the first neighbor;
determining whether the update message is for a filtered node address; and
sending to the different neighbor a poison update message that indicates a prohibitive cost to reach the filtered node address through the node.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.
53 Citations
22 Claims
-
1. A method comprising:
-
receiving, at a node in a communications network, an update message for a distance vector routing protocol from a first neighbor of a plurality of neighbors, wherein the update message indicates a destination in the communications network and a least total cost of reaching that destination from the first neighbor, wherein the node is configured to filter at least one change in cost for a selected network address such that it is not forwarded; sending, to a different neighbor of the plurality of neighbors, the update message, wherein if the change in cost for the selected network address is for a sole address provided in the update message, then the update message is not forwarded by the node; sending the update message to the different neighbor of the plurality of neighbors if the node is a relay node for the first neighbor, wherein the relay node is a node preferred by the first neighbor to update a particular node a certain number of hops from the first neighbor; determining whether the update message is for a filtered node address; and sending to the different neighbor a poison update message that indicates a prohibitive cost to reach the filtered node address through the node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method comprising:
-
receiving, at a first node in a communications network, a first message for a distance vector routing protocol from each neighbor of a plurality of neighbors, wherein the first message from each neighbor of the plurality of neighbors includes a neighbor data that indicates a set of one or more nodes that are in direct communication with the neighbor; determining a relay set of fewer than all neighbors of the plurality of neighbors based on the neighbor data received from every neighbor of the plurality of neighbors, wherein the first node is configured to filter at least one change in cost associated with reaching a destination for a selected network address such that it is not forwarded; and sending to the plurality of neighbors a second message for the distance vector routing protocol, wherein the second message includes relay data that indicates the relay set, wherein every node two hops from the first node is updated using the relay set of neighbors; determining whether a particular message is for a filtered node address; and sending to a particular neighbor a poison update message that indicates a prohibitive cost to reach the filtered node address through the first node. - View Dependent Claims (13, 14, 15)
-
-
16. An apparatus comprising:
-
a network interface that is part of a node and that is configured for communicating a data packet with a packet-switched network; logic encoded in one or more tangible media for execution and, when executed, operable to; receive an update message for a distance vector routing protocol from a first neighbor of a plurality of neighbors, wherein the update message indicates a destination in a communications network and a least total cost of reaching that destination from the first neighbor, wherein the node is configured to filter at least one change in cost for a selected network address such that it is not forwarded as part of the update message; send, to a different neighbor of the plurality of neighbors, the update message, wherein if the change in cost for the selected network address is for a sole address provided in the update message, then the update message is not forwarded by the node; send the update message to the different neighbor of the plurality of neighbors if the node is a relay node for the first neighbor, wherein the relay node is a node preferred by the first neighbor to update a particular node two hops from the first neighbor; determine whether the update message is for a filtered node address; and send to the different neighbor a poison update message that indicates a prohibitive cost to reach the filtered node address. - View Dependent Claims (17, 18, 19, 20, 21, 22)
-
Specification