Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters.

Y. Wang, T. Pan, Z. Mi, H. Dai, X. Guo, T. Zhang, B. Liu, and Q. Dong. INFOCOM, page 95-99. IEEE, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tianxiang Dai University of Stuttgart

Anni Dai University of Stuttgart

G. Daiß

Gregor Daiß University of Stuttgart

Other publications of authors with the same name

Optimizing Distributed Execution of WS-BPEL Processes in Heterogeneous Computing Environments.Q. Wu, Y. Gu, L. Bao, W. Jia, H. Dai, and P. Chen. QSHINE, volume 22 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 770-784. Springer, (2009)BFAST: Unified and scalable index for NDN forwarding architecture.H. Dai, J. Lu, Y. Wang, and B. Liu. INFOCOM, page 2290-2298. IEEE, (2015)OBMA: Minimizing Bitmap Data Structure with Fast and Uninterrupted Update Processing.C. Zhang, Y. Feng, H. Song, Y. Wan, W. Xu, Y. Wang, H. Dai, Y. Li, and B. Lin. IWQoS, page 1-6. IEEE, (2018)Improving the throughput and delay performance of network processors by applying push model.B. Liu, B. Yuan, H. Dai, H. Zhao, J. Yu, and L. Bhuyan. IWQoS, page 1-4. IEEE, (2012)NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters.Y. Wang, T. Pan, Z. Mi, H. Dai, X. Guo, T. Zhang, B. Liu, and Q. Dong. INFOCOM, page 95-99. IEEE, (2013)CONSERT: Constructing optimal name-based routing tables.H. Dai, and B. Liu. Computer Networks, (2016)GPU-accelerated name lookup with component encoding.Y. Wang, H. Dai, T. Zhang, W. Meng, J. Fan, and B. Liu. Computer Networks, 57 (16): 3165-3177 (2013)Statistical Optimal Hash-Based Longest Prefix Match.Y. Wang, Z. Qi, H. Dai, H. Wu, K. Lei, and B. Liu. ANCS, page 153-164. IEEE Computer Society, (2017)Wire Speed Name Lookup: A GPU-based Approach.Y. Wang, Y. Zu, T. Zhang, K. Peng, Q. Dong, B. Liu, W. Meng, H. Dai, X. Tian, Z. Xu and 2 other author(s). NSDI, page 199-212. USENIX Association, (2013)Virtual routing tables polymerization for lookup and update.T. Yang, S. Zhang, X. Sun, H. Dai, R. Duan, J. Lu, Z. Mi, and B. Liu. ICNP, page 1-2. IEEE Computer Society, (2012)

PUMA

Disambiguation of "Dai, Huichen"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters.

Please choose a person to relate this publication to

Tianxiang Dai University of Stuttgart

Anni Dai University of Stuttgart

G. Daiß

Gregor Daiß University of Stuttgart

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Dai, Huichen"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters.

Please choose a person to relate this publication to

Tianxiang Dai University of Stuttgart

Anni Dai University of Stuttgart

G. Daiß

Gregor Daiß University of Stuttgart

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters.