Poster: Distance Vector Routing for Named Data Networking

Although Distance Vector (DV) routing protocols can have a simple design and low overhead, they bear a bad reputation for undesired behavior: routing updates may "count to infinity" after node or link failures, which result in packet looping in the data plane. Since Named Data Networking (NDN) has a stateful data plane that can detect and mitigate packet loops, we design a DV routing protocol over NDN, ndn-dv, and demonstrate that an NDN network running ndn-dv can prevent traffic disruptions in the face of dynamic network topology changes due to failures.