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 in direct communication with the node, wherein the update message indicates a destination in the communications network and a least total cost of reaching that destination from the first neighbor; and
sending, to a different neighbor of the plurality of neighbors, the update message.
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.
138 Citations
30 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 in direct communication with the node, wherein the update message indicates a destination in the communications network and a least total cost of reaching that destination from the first neighbor; and sending, to a different neighbor of the plurality of neighbors, the update message. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. 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 in direct communication with the first node, wherein the first message from each neighbor of the plurality of neighbors includes 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; 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 only the relay set of neighbors. - View Dependent Claims (16, 17, 18, 19)
-
-
20. An apparatus comprising:
-
a network interface 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 in direct communication with the apparatus, wherein the update message indicates a destination in a communications network and a least total cost of reaching that destination from the first neighbor; and send, to a different neighbor of the plurality of neighbors, the update message. - View Dependent Claims (21, 22, 23, 24, 25, 26, 27, 28, 29)
-
-
30. An apparatus comprising:
-
a network interface 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 a first message for a distance vector routing protocol from each neighbor of a plurality of neighbors in direct communication with the apparatus, wherein the first message from each neighbor of the plurality of neighbors includes neighbor data that indicates a set of one or more nodes that are in direct communication with the neighbor; determine 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; and send 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 each neighbor in the relay set is a neighbor preferred to update a particular node two hops from the apparatus, and every node two hops from the apparatus is updated using only the relay set of neighbors.
-
Specification