No-hop

In-network Distributed Hash Tables

Conference paper (2021)

Authors

Lily Hugerich Technical University of Berlin
Apoorv Shukla Huawei European Research Center
G. Smaragdakis Cyber Security - EEMCS
Research Group
Cyber Security (EEMCS) (TU Delft)
Copyright: © 2021 Lily Hügerich, Apoorv Shukla, G. Smaragdakis
DOI: https://doi.org/10.1145/3493425.3502757
More Info
expand_more

Published Date

2021

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Intelligent Systems

Research Group

Cyber Security

Abstract

We make a case for a distributed hash table lookup in the network data plane. We argue that the lookup time performance of distributed hash tables can be further improved via an in-network data plane implementation. To this end, we introduce No-hop, an in-network distributed hash table implementation, which leverages the data plane programmability at line rate gained from P4. Our initial results of transporting distributed hash table logic from hosts' user space to the fast path of switches in the network data plane are promising. We show that No-hop improves the performance of locating the responsible host and maintains the properties of distributed hash tables while outperforming two baselines.

Files

3493425.3502757.pdf
(pdf | 1.45 Mb)
- Embargo expired in 30-08-2022
ANCS2021.pdf
(pdf | 1.67 Mb)