Spider: Parallelizing Longest Prefix Matching with Optimization for SIMD Instructions

Yukito Ueno, Ryo Nakamura, Yohei Kuga, Hiroshi Esaki. Spider: Parallelizing Longest Prefix Matching with Optimization for SIMD Instructions. In Filip De Turck, Prosper Chemouil, Tim Wauters, Mohamed Faten Zhani, Walter Cerroni, Rafael Pasquini, Zuqing Zhu, editors, 6th IEEE Conference on Network Softwarization, NetSoft 2020, Ghent, Belgium, June 29 - July 3, 2020. pages 267-271, IEEE, 2020. [doi]

@inproceedings{UenoNKE20,
  title = {Spider: Parallelizing Longest Prefix Matching with Optimization for SIMD Instructions},
  author = {Yukito Ueno and Ryo Nakamura and Yohei Kuga and Hiroshi Esaki},
  year = {2020},
  doi = {10.1109/NetSoft48620.2020.9165306},
  url = {https://doi.org/10.1109/NetSoft48620.2020.9165306},
  researchr = {https://researchr.org/publication/UenoNKE20},
  cites = {0},
  citedby = {0},
  pages = {267-271},
  booktitle = {6th IEEE Conference on Network Softwarization, NetSoft 2020, Ghent, Belgium, June 29 - July 3, 2020},
  editor = {Filip De Turck and Prosper Chemouil and Tim Wauters and Mohamed Faten Zhani and Walter Cerroni and Rafael Pasquini and Zuqing Zhu},
  publisher = {IEEE},
  isbn = {978-1-7281-5684-2},
}