Abstract—Routing protocols are crucial for reachability discovery in Named Data Networking (NDN). Link State-based protocols, like NLSR, are less suitable for networks with multiple paths due to high synchronization complexity and computational demands. Distance Vector-based protocols, while less complex, struggle in multipath scenarios. We propose the use of probabilistic data structures in distance vector protocols to address these challenges. Our results show that this approach enhances the NDN packet delivery rate and significantly reduces unsatisfied interests. Future works will focus on refining the proposal to integrate it with forwarding strategies, leveraging the benefits for optimized routes.
Fábio Santos dos Santos (Thu,) studied this question.