DHash: A cache-friendly TCP lookup algorithm for fast network processing

Author

Kai Zhang ; Junchang Wang ; Bei Hua ; Li Lu

Author_Institution

Univ. of Sci. & Technol. of China(USTC), Hefei, China

fYear

2013

fDate

21-24 Oct. 2013

Firstpage

484

Lastpage

491

Abstract

A typical hash based TCP lookup algorithm is hard to make a trade-off between speed and space. This paper presents DHash, a high-efficient TCP lookup algorithm that aims at supporting large number of sessions in high speed networks. DHash achieves this goal by designing a compact and cache-friendly lookup data structure that well fits the modern computer architectures. To show the power of DHash, we implement it in a user-space TCP/IP stack, and then parallelize the stack on the Intel multicore processors. Experiments show that DHash is able to achieve 16.3Mpps while handling one million concurrent sessions on our parallel platform.

Keywords

cryptographic protocols; data structures; transport protocols; DHash; Intel multicore processors; cache-friendly TCP lookup algorithm; cache-friendly lookup data structure; fast network processing; hash based TCP lookup algorithm; Algorithm design and analysis; Conferences; Data structures; IP networks; Indexes; Multicore processing; Program processors; Cache-friendly Hash Table; High-performance Network Processing; TCP lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Local Computer Networks (LCN), 2013 IEEE 38th Conference on

Conference_Location

Sydney, NSW

ISSN

0742-1303

Print_ISBN

978-1-4799-0536-2

Type

conf

DOI

10.1109/LCN.2013.6761282

Filename

6761282