Distance Vector Routing in Partitioned Networks

  • Binary State Distance Vector Routing (BSDVR) disconnection-tolerant routing protocol
  • Successfully calculates the shortest paths among all nodes, even when a network is partitioned
  • Can be used for disaster or emergency networking settings where infrastructure support is minimal

Abstract
The University of Central Florida invention is a disconnection-tolerant routing protocol, Binary State Distance Vector Routing (BSDVR), that can provide unicast routing on partitioned networks. BSDVR introduces binary state information for distance vector (DV) entries to compute unicast paths even if the network is partitioned. Even when a network is partitioned, BSDVR successfully calculates the shortest paths among all nodes by augmenting the Bellman-Ford algorithm with the binary state information. BSDVR generates more control overhead during single link failures that do not cause partitions. In terms of partition-causing link failures, 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. With proper tuning of a data plane, BSDVR can attain a hybrid between traditional DV and epidemic routing and enable unicast-like paths more suitable for limited-capacity networks.

Partnering Opportunity

The research team is seeking partners for licensing and/or research collaboration.

Stage of Development

Prototype available.

Contact Information

Name: Raju Nagaiah

Email: raju@ucf.edu

Phone: 407.882.0593