Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
PURR: A Primitive for Reconfigurable Fast Reroute: (hope for the best and program for the worst)
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Communication Systems, CoS, Network Systems Laboratory (NS Lab).ORCID iD: 0000-0002-9675-9729
Universitat Politècnica de Catalunya.
Queen Mary, University of London.
Independent Researcher.
Show others and affiliations
2019 (English)In: In International Conference on emerging Networking EXperiments and Technologies, , 2019 / [ed] ACM, 2019Conference paper, Published paper (Refereed)
Abstract [en]

Highly dependable communication networks usually rely on some kind of Fast Re-Route (FRR) mechanism which allows to quickly re-route traffic upon failures, entirely in the data plane. This paper studies the design of FRR mechanisms for emerging reconfigurable switches.

Our main contribution is an FRR primitive for programmable data planes, PURR, which provides low failover latency and high switch throughput, by avoiding packet recirculation. PURR tolerates multiple concurrent failures and comes with minimal memory requirements, ensuring compact forwarding tables, by unveiling an intriguing connection to classic ``string theory'' (\textit{i.e.}, stringology), and in particular, the shortest common supersequence problem. PURR is well-suited for high-speed match\slash action forwarding architectures (e.g., PISA) and supports the implementation of arbitrary network-wide FRR mechanisms. Our simulations and prototype implementation (on an FPGA and Tofino) show that PURR~improves TCAM memory occupancy by a factor of 1.51.5x---10.810.8x compared to a na\"ive encoding when implementing state-of-the-art FRR mechanisms. PURR also improves the latency and throughput of datacenter traffic up to a factor of \mbox{2.82.8x---5.55.5x} and 1.21.2x---22x, respectively, compared to approaches based on recirculating packets.

Place, publisher, year, edition, pages
2019.
Keywords [en]
programmable networks, network robustness, fast reroute, fast failover, shortest common supersequence
National Category
Communication Systems Computer Sciences
Research subject
Information and Communication Technology; Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-264776DOI: 10.1145/3359989.3365410ISBN: 978-1-4503-6998-5 (electronic)OAI: oai:DiVA.org:kth-264776DiVA, id: diva2:1374999
Conference
CoNEXT
Note

QC 20191204

Available from: 2019-12-03 Created: 2019-12-03 Last updated: 2019-12-04Bibliographically approved

Open Access in DiVA

fulltext(2850 kB)73 downloads
File information
File name FULLTEXT01.pdfFile size 2850 kBChecksum SHA-512
4aa2c622d39e8bd7cc71dc14612bb7d58329939dd2987d11c1ad556b155c7edc7c9ebe46addbd89a9b05b69cdb2c12b17912bf813e43f14d6d2167ba297dcbc0
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Chiesa, Marco
By organisation
Network Systems Laboratory (NS Lab)
Communication SystemsComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 73 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 94 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf