DXR: Towards a billion routing lookups per second in software

Computer Communication Review

Volumn 42, Issue 5, 2012, Pages 30-36

  Zec, Marko ^a   Rizzo, Luigi ^b   Mikuc, Miljenko ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Packet lookup and classification; Software routers

Indexed keywords

CACHE HIERARCHIES; CPU CORES; FREEBSD; LOOKUP STRUCTURES; LOOKUPS; MEMORY FOOTPRINT; NEXT-HOP; ROUTING LOOKUP; ROUTING TABLE; SOFTWARE IMPLEMENTATION; SOFTWARE ROUTERS; SOFTWARE ROUTING; SYNTHETIC TESTS;

DYNAMIC RANDOM ACCESS STORAGE; PROGRAM PROCESSORS; ROUTERS;

INTERNET PROTOCOLS;

EID: 84872716263     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/2378956.2378961     Document Type: Article

References (20)

1. IPv6/IPv4 comparative BGP statistics. http://bgp.potaroo.net/v6/v6rpt. html.
2. DXR: Direct/Range routing lookups home page. http://www.nxlab.fer.hr/dxr/ .
3. F. Checconi, L. Rizzo, and P. Valente. QFQ: Efficient packet scheduling with tight guarantees. IEEE/ACM Trans. on Networking, 2012 (to appear).
4. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small forwarding tables for fast routing lookups. SIGCOMM Computer Communication Review, 27(4):3-14, Oct. 1997.
5. M. Dobrescu, N. Egi, K. Argyraki, B.-G. Chun, K. Fall, G. Iannaccone, A. Knies, M. Manesh, and S. Ratnasamy. RouteBricks: Exploiting parallelism to scale software routers. In SOSP '09, pages 15-28, Big Sky, Montana, USA, 2009. ACM.
6. J. Fu, O. Hagsand, and G. Karlsson. Performance evaluation and cache behavior of LC-trie for IP-address lookup. In IEEE Workshop on High Perf. Switching and Routing, Poznan, 2006.
7. P. Gupta, S. Lin, and N. McKeown. Routing lookups in hardware at memory access speeds. In INFOCOM, pages 1240-1247, 1998.
8. S. Han, K. Jang, K. Park, and S. Moon. PacketShader: a GPU-accelerated software router. In SIGCOMM '10, pages 195-206. ACM, 2010.
9. B. Lampson, V. Srinivasan, and G. Varghese. IP lookups using multiway and multicolumn search. IEEE/ACM Trans. on Networking, pages 324-334, 1998.
10. S. Nilsson and G. Karlsson. IP-address lookup using LC-tries. IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, 1999.
11. C. Partridge, P. P. Carvey, I. Castineyra, T. Clarke, J. Rokosz, J. Seeger, M. Sollins, S. Starch, B. Tober, G. D. Troxel, D. Waitzman, and S. Winterble. A 50-Gb/s IP router. IEEE/ACM Trans. on Networking, 6:237-248, 1998.
12. L. Rizzo. netmap: A novel framework for fast packet I/O. In Usenix ATC 2012. Usenix, 2012.
13. L. Rizzo. Revisiting network I/O APIs: the netmap framework. Comm. of the ACM, 55(3):45-51, 2012.
14. M. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous. Survey and taxonomy of IP address lookup algorithms. IEEE Network, 15:8-23, 2001.
15. K. Sklower. A tree-based packet routing table for Berkeley Unix. In USENIX Winter Conference, pages 93-104, 1991.
16. H. Song, F. Hao, M. S. Kodialam, and T. V. Lakshman. IPv6 lookups using distributed and load balanced bloom filters for 100 Gbps core router line cards. In INFOCOM, pages 2518-2526, 2009.
17. V. Srinivasan and G. Varghese. Faster IP lookups using controlled prefix expansion. In SIGMETRICS '98/PERFORMANCE '98, pages 1-10. ACM, 1998.
18. Tzi-cker Chiueh and P. Pradhan. High performance IP routing table lookup using CPU caching. In INFOCOM, pages 1421-1428, 1999.
19. Z. A. Uzmi, M. Nebel, A. Tariq, S. Jawad, R. Chen, A. Shaikh, J. Wang, and P. Francis. SMALTA: practical and near-optimal FIB aggregation. In CoNEXT '11, pages 29:1-29:12. ACM, 2011.
20. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable high-speed prefix matching. ACM Trans. Comput. Syst., 19(4):440-482, Nov. 2001.