All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Detecting Routing Loops in the Data Plane

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F63839172%3A_____%2F20%3A10133303" target="_blank" >RIV/63839172:_____/20:10133303 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216305:26230/20:PU135506

  • Result on the web

    <a href="http://dx.doi.org/10.1145/3386367.3431303" target="_blank" >http://dx.doi.org/10.1145/3386367.3431303</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3386367.3431303" target="_blank" >10.1145/3386367.3431303</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Detecting Routing Loops in the Data Plane

  • Original language description

    Routing loops can harm network operation. Existing loop detection mechanisms, including mirroring packets, storing state on switches, or encoding the path onto packets, impose significant overheads on either the switches or the network. We present Unroller, a solution that enables real-time identification of routing loops in the data plane with minimal overheads. Our algorithms encode a varying fixed-size subset of the traversed path on each packet. That way, our overhead is independent of the path length, while we can detect the loop once the packet returns to some encoded switch. We implemented Unroller in P4 and compiled into three different FPGA targets. We then compared it against state-of-the-art solutions on real WAN and data center topologies and show that it requires from 6x to 100x fewer bits added to packets than existing methods.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/EF16_013%2F0001797" target="_blank" >EF16_013/0001797: CESNET E-Infrastructure - Modernisation</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    CoNEXT &apos;20: Proceedings of the 16th International Conference on emerging Networking EXperiments and Technologies

  • ISBN

    978-1-4503-7948-9

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    466-473

  • Publisher name

    ACM

  • Place of publication

    New York, NY, USA

  • Event location

    Barcelona, Španělsko

  • Event date

    Dec 1, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article