Achieving O(1) IP lookup on GPU-based software routers
School of Computer Science, Fudan University, Shanghai, China
Proceedings of the ACM SIGCOMM 2010 conference on SIGCOMM, SIGCOMM ’10
@article{zhao2010achieving,
title={Achieving O (1) IP lookup on GPU-based software routers},
author={Zhao, J. and Zhang, X. and Wang, X. and Xue, X.},
journal={ACM SIGCOMM Computer Communication Review},
volume={40},
number={4},
pages={429–430},
issn={0146-4833},
year={2010},
publisher={ACM}
}
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme using graphics processor units(GPU). Our contribution here is to design a basic architecture for high-performance IP lookup engine with GPU, and to develop efficient algorithms for routing prefix operations such as lookup, deletion, insertion, and modification. In particular, the IP lookup scheme can achieve O(1) time complexity. Our experimental results on real-world route traces show promising 6x gains in IP lookup throughput.
January 3, 2011 by hgpu
