System and method for distance vector routing in partitioned networks
AssigneeUniversity of Central Florida Research Foundation, Inc.
InventorsMurat Yuksel, Ammar Farooq
Life of this patent
Estimating the term…
Abstract
A system and method for disconnection tolerant network routing, termed Binary State Distance Vector Routing (BSDVR). BSDVR provides for unicast routing on partitioned networks by introducing binary state information for distance vector (DV) entries to compute unicast paths. In the presence of network partitions, BSDVR effectively avoids the count-to-infinity problem and operates with control overhead less than traditional DV routing by an order of magnitude, leading to much better convergence times for failures.
Claims20
A method for disconnection tolerant routing in a network, the method comprising:
- establishing a network comprising a plurality of nodes, wherein each of the plurality of nodes comprises a distance vector (DV) routing table comprising a plurality of DV entries and wherein one of the plurality of DV entries indicates the primary path toward a destination and wherein the primary path being the shortest routing path to the destination;
- assigning binary state information to each of the plurality of distance vector (DV) entries, wherein the binary state information indicates an active or inactive state of a routing path associated with the respective DV entry;
- when one of the nodes of the plurality of nodes realizes that the primary path toward the destination has experienced a failure, erasing the DV entries in the DV routing table of the node for the destination that has experienced the failure and sending an inactive DV update to neighboring nodes in the network;
- and
- each of the neighboring nodes in the network replying to the inactive DV update by sending its active DV entry for the destination that has experienced the failure to its neighboring nodes.
A system for performing disconnection tolerant routing, the system comprising:
- a plurality of nodes connected in a network, wherein each of the plurality of nodes comprises a distance vector (DV) routing table comprising a plurality of DV entries, and wherein one of the plurality of DV entries indicates the primary path toward a destination and wherein the primary path is being the shortest routing path to the destination and wherein binary state information is assigned to each of the plurality of DV entries and wherein the binary state information indicates an active or inactive state of a routing path associated with the respective DV entry;
- each of the plurality of nodes configured to;
- realize when the primary path toward the destination has experienced a failure, erase the DV entries in the DV routing table for the destination that has experienced the failure and send an inactive DV update to neighboring nodes in the network;
- and
- when the inactive DV update is received, reply to the inactive DV update by sending its active DV entry for the destination that has experienced the failure to its neighboring nodes.
Dependencies are inferred from the claim text.