No-hop: In-network Distributed Hash Tables

Lily Hügerich; Apoorv Shukla; Georgios Smaragdakis

doi:10.1145/3493425.3502757

No-hop: In-network Distributed Hash Tables

Lily Hügerich, Apoorv Shukla, Georgios Smaragdakis

Cyber Security

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

20 Downloads (Pure)

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.

Original language	English
Title of host publication	ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems
Publisher	Association for Computing Machinery (ACM)
Pages	80-87
Number of pages	8
ISBN (Electronic)	978-1-4503-9168-9
DOIs	https://doi.org/10.1145/3493425.3502757
Publication status	Published - 2021
Event	16th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2021 - Virtual, Online, United States Duration: 13 Dec 2021 → 16 Dec 2021

Publication series

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

Conference

Conference	16th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2021
Country/Territory	United States
City	Virtual, Online
Period	13/12/21 → 16/12/21

Bibliographical note

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.

Keywords

Data Plane Algorithms
DHT
P4
Scalability

Access to Document

10.1145/3493425.3502757

3493425.3502757Final published version, 1.32 MB

Cite this

Hügerich, L., Shukla, A., & Smaragdakis, G. (2021). No-hop: In-network Distributed Hash Tables. In ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems (pp. 80-87). (ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems). Association for Computing Machinery (ACM). https://doi.org/10.1145/3493425.3502757

Hügerich, Lily ; Shukla, Apoorv ; Smaragdakis, Georgios. / No-hop : In-network Distributed Hash Tables. ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems. Association for Computing Machinery (ACM), 2021. pp. 80-87 (ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems).

@inproceedings{b6f66f2a00a74064833e8e770bb04485,

title = "No-hop: In-network Distributed Hash Tables",

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. ",

keywords = "Data Plane Algorithms, DHT, P4, Scalability",

author = "Lily H{\"u}gerich and Apoorv Shukla and Georgios Smaragdakis",

note = "Green Open Access added to TU Delft Institutional Repository {\textquoteleft}You share, we take care!{\textquoteright} – 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. ; 16th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2021 ; Conference date: 13-12-2021 Through 16-12-2021",

year = "2021",

doi = "10.1145/3493425.3502757",

language = "English",

series = "ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems",

publisher = "Association for Computing Machinery (ACM)",

pages = "80--87",

booktitle = "ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems",

address = "United States",

}

Hügerich, L, Shukla, A & Smaragdakis, G 2021, No-hop: In-network Distributed Hash Tables. in ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems. ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems, Association for Computing Machinery (ACM), pp. 80-87, 16th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2021, Virtual, Online, United States, 13/12/21. https://doi.org/10.1145/3493425.3502757

No-hop: In-network Distributed Hash Tables. / Hügerich, Lily; Shukla, Apoorv; Smaragdakis, Georgios.
ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems. Association for Computing Machinery (ACM), 2021. p. 80-87 (ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - No-hop

T2 - 16th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2021

AU - Hügerich, Lily

AU - Shukla, Apoorv

AU - Smaragdakis, Georgios

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

PY - 2021

Y1 - 2021

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

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

KW - Data Plane Algorithms

KW - DHT

KW - P4

KW - Scalability

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

U2 - 10.1145/3493425.3502757

DO - 10.1145/3493425.3502757

M3 - Conference contribution

AN - SCOPUS:85124164289

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

SP - 80

EP - 87

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

PB - Association for Computing Machinery (ACM)

Y2 - 13 December 2021 through 16 December 2021

ER -

Hügerich L, Shukla A, Smaragdakis G. No-hop: In-network Distributed Hash Tables. In ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems. Association for Computing Machinery (ACM). 2021. p. 80-87. (ANCS 2021 - Proceedings of the 2021 Symposium on Architectures for Networking and Communications Systems). doi: 10.1145/3493425.3502757

No-hop: In-network Distributed Hash Tables

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this