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

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

Fingerprint

Routing protocols
Routers

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Schneider, K., Zhang, B., Wang, L., & Zhang, L. (2017). Near loop-free routing: Increasing path choices with stateful forwarding. In ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking (pp. 182-183). Association for Computing Machinery, Inc. https://doi.org/10.1145/3125719.3132098

Near loop-free routing : Increasing path choices with stateful forwarding. / Schneider, Klaus; Zhang, Beichuan; Wang, Lan; Zhang, Lixia.

ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc, 2017. p. 182-183.

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

Schneider, K, Zhang, B, Wang, L & Zhang, L 2017, Near loop-free routing: Increasing path choices with stateful forwarding. in ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc, pp. 182-183, 4th ACM Conference on Information-Centric Networking, ICN 2017, Berlin, Germany, 9/26/17. https://doi.org/10.1145/3125719.3132098
Schneider K, Zhang B, Wang L, Zhang L. Near loop-free routing: Increasing path choices with stateful forwarding. In ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc. 2017. p. 182-183 https://doi.org/10.1145/3125719.3132098
Schneider, Klaus ; Zhang, Beichuan ; Wang, Lan ; Zhang, Lixia. / Near loop-free routing : Increasing path choices with stateful forwarding. ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking. Association for Computing Machinery, Inc, 2017. pp. 182-183
@inproceedings{6bd9e0ca148e44b1894fb9c8e7e98d3d,
title = "Near loop-free routing: Increasing path choices with stateful forwarding",
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.",
author = "Klaus Schneider and Beichuan Zhang and Lan Wang and Lixia Zhang",
year = "2017",
month = "9",
day = "26",
doi = "10.1145/3125719.3132098",
language = "English (US)",
pages = "182--183",
booktitle = "ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - Near loop-free routing

T2 - Increasing path choices with stateful forwarding

AU - Schneider, Klaus

AU - Zhang, Beichuan

AU - Wang, Lan

AU - Zhang, Lixia

PY - 2017/9/26

Y1 - 2017/9/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85032480909&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032480909&partnerID=8YFLogxK

U2 - 10.1145/3125719.3132098

DO - 10.1145/3125719.3132098

M3 - Conference contribution

SP - 182

EP - 183

BT - ICN 2017 - Proceedings of the 4th ACM Conference on Information Centric Networking

PB - Association for Computing Machinery, Inc

ER -