Digitala Vetenskapliga Arkivet

Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
High-speed Connection Tracking in Modern Servers
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Kommunikationssystem, CoS, Network Systems Laboratory (NS Lab). KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Programvaruteknik och datorsystem, SCS.ORCID-id: 0000-0002-9400-324X
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Kommunikationssystem, CoS, Network Systems Laboratory (NS Lab).ORCID-id: 0000-0002-9675-9729
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Kommunikationssystem, CoS, Network Systems Laboratory (NS Lab).ORCID-id: 0000-0003-1269-2190
2021 (engelsk)Inngår i: 2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR) (IEEE HPSR'21), 2021Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

The rise of commodity servers equipped with high-speed network interface cards poses increasing demands on the efficient implementation of connection tracking, i.e., the task of associating the connection identifier of an incoming packet to the state stored for that connection. In this work, we thoroughly investigate and compare the performance obtainable by different implementations of connection tracking using high-speed real traffic traces. Based on a load balancer use case, our results show that connection tracking is an expensive operation, achieving at most 24 Gbps on a single core. Core-sharding and lock-free hash tables emerge as the only suitable multi-thread approaches for enabling 100 Gbps packet processing. In contrast to recent beliefs, we observe that newly proposed techniques to "lazily" delete connection states are not more effective than properly tuned traditional deletion techniques based on timer wheels.

sted, utgiver, år, opplag, sider
2021.
Emneord [en]
connection tracking, load balancer, fastclick, hash tables, packet classification
HSV kategori
Forskningsprogram
Datalogi
Identifikatorer
URN: urn:nbn:se:kth:diva-295413DOI: 10.1109/HPSR52026.2021.9481841ISI: 000806753600048Scopus ID: 2-s2.0-85113858387OAI: oai:DiVA.org:kth-295413DiVA, id: diva2:1556104
Konferanse
IEEE HPSR 2021
Prosjekter
Time Critical Cloud
Forskningsfinansiär
Swedish Foundation for Strategic Research, TCCEuropean Commission, 770889
Merknad

QC 20220627

Tilgjengelig fra: 2021-05-20 Laget: 2021-05-20 Sist oppdatert: 2022-06-27bibliografisk kontrollert

Open Access i DiVA

fulltext(2898 kB)433 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 2898 kBChecksum SHA-512
5e82a81ff54c58d44f7e40d62052fc890d52d9ffe95adf21bc51f7d1f0409c3157cacf94b663ef97498ea6f914bea54ce09f2d2de84e4b4035787d52b3b6c4a5
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopus

Søk i DiVA

Av forfatter/redaktør
Girondi, MassimoChiesa, MarcoBarbette, Tom
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 434 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 504 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf