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.
Benefit
Successfully avoids count-to-infinity when there is a partition-causing failureMaintains paths for destinations that become unreachable and can use the paths for data packet forwarding when neededDoes not require a path establishment phase, as it maintains the latest active or inactive paths for each destinationMarket Application
Routing and switching companiesPublications
Distance Vector Routing in
Partitioned Networks, 2022 IEEE International Symposium on Local and
Metropolitan Area Networks (LANMAN), 2022, pp. 1-7, doi:
10.1109/LANMAN54755.2022.9820113.
Brochure
