Poster: Distance Vector Routing for Named Data Networking

Varun Patil, Sirapop Theeranantachai, Beichuan Zhang, Lixia Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationCoNEXT 2024 - Proceedings of the 20th International Conference on Emerging Networking EXperiments
PublisherAssociation for Computing Machinery, Inc
Pages23-24
Number of pages2
ISBN (Electronic)9798400711084
DOIs
StatePublished - Dec 9 2024
Event20th International Conference on Emerging Networking EXperiments, CoNEXT 2024 - Los Angeles, United States
Duration: Dec 9 2024Dec 12 2024

Publication series

NameCoNEXT 2024 - Proceedings of the 20th International Conference on Emerging Networking EXperiments

Conference

Conference20th International Conference on Emerging Networking EXperiments, CoNEXT 2024
Country/TerritoryUnited States
CityLos Angeles
Period12/9/2412/12/24

Keywords

  • distance vector
  • named data networking
  • network routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Poster: Distance Vector Routing for Named Data Networking'. Together they form a unique fingerprint.

Cite this