Near loop-free routing: Increasing path choices with stateful forwarding

Klaus Schneider, Beichuan Zhang, Lan Wang, Lixia Zhang

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

2 Scopus citations

Abstract

When splitting traffic for one destination among multiple paths, the employed paths should be loop-free, lest they waste network resources, and the involved routers should be given a high path choice, that is, a high number of potential nexthops. In IP networks this requires the use of a loop-free routing protocol, which limits the achievable path choice. Here we show that, in NDN, we can increase the path choice by combining a Near Loop-free Routing protocol (NLR) with on-demand loop removal at the forwarding layer. NLR routers 1) exclude the incoming face from forwarding, 2) use certain heuristics to minimize routing loops, and 3) remove any remaining loops at the forwarding plane. NLR achieves a higher path choice and path quality than current alternatives, while keeping computation complexity low.

Original languageEnglish (US)
Title of host publicationICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking
PublisherAssociation for Computing Machinery, Inc
Pages182-183
Number of pages2
ISBN (Electronic)9781450351225
DOIs
StatePublished - Sep 26 2017
Event4th ACM Conference on Information-Centric Networking, ICN 2017 - Berlin, Germany
Duration: Sep 26 2017Sep 28 2017

Other

Other4th ACM Conference on Information-Centric Networking, ICN 2017
CountryGermany
CityBerlin
Period9/26/179/28/17

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Fingerprint Dive into the research topics of 'Near loop-free routing: Increasing path choices with stateful forwarding'. Together they form a unique fingerprint.

Cite this