No-hop

No-hop: In-network Distributed Hash Tables

Hügerich, Lily (Technical University of Berlin)
Shukla, Apoorv (Huawei European Research Center)
Smaragdakis, G. (TU Delft Cyber Security)

2021

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.

Data Plane Algorithms
DHT
P4
Scalability

http://resolver.tudelft.nl/uuid:b6f66f2a-00a7-4064-833e-8e770bb04485

https://doi.org/10.1145/3493425.3502757

Association for Computing Machinery (ACM)

2022-08-30

978-1-4503-9168-9

ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems

16th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2021, 2021-12-13 → 2021-12-16, Virtual, Online, United States

ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems

Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Institutional Repository

conference paper

© 2021 Lily Hügerich, Apoorv Shukla, G. Smaragdakis