Netbench: Framework for evaluation of packet processing algorithms

Proceedings - 2011 7th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2011

Volumn , Issue , 2011, Pages 95-96

  Puš, Viktor ^a   Tobola, Jiří ^b   Košař, Vlastimil ^b   Kaštil, Jan ^b   Kořenek, Jan ^b  

^a CESNET   (Czech Republic)

^b BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

IP Lookup; Library; Longest Prefix Match; Packet Classification; Python; Regular Expression Matching

Indexed keywords

IP LOOKUP; LONGEST PREFIX MATCHES; PACKET CLASSIFICATION; PYTHON; REGULAR-EXPRESSION MATCHING;

INTERNET PROTOCOLS; LIBRARIES; PACKET NETWORKS;

ALGORITHMS;

EID: 81255150511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ANCS.2011.25     Document Type: Conference Paper

References (6)

1. Bgp table data. http://bgp.potaroo.net/, 2011.
2. Sphinx: Python Documentation Generator. http://sphinx.pocoo.org/, 2011.
3. Bro IDS. Project WWW Page. http://http://www.bro-ids.org/, 2011.
4. R. Morris, E. Kohler, J. Jannotti, and M. F. Kaashoek. The click modular router. In Proceedings of the seventeenth ACM symposium on Operating systems principles, SOSP '99, pages 217-231, New York, NY, USA, 1999. ACM.
5. Snort. Project WWW Pages. http://www.snort.org/, 2011.
6. D. E. Taylor and J. S. Turner. Classbench: a packet classification benchmark. IEEE/ACM Trans. Netw., 15(3):499-511, 2007.