Software-based implementations of updateable data structures for high-speed URL matching

Authors:
Haowei Yuan;Benjamin Wun;Patrick Crowley
Affiliations:
Washington University in St. Louis;Washington University in St. Louis;Washington University in St. Louis
Venue:
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Year:
2010

Citing 2
Cited 0

Evaluating regular expression matching engines on network and general purpose processors

Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Cache-Conscious collision resolution in string hash tables

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

URL matching is used in many network applications, including URL blacklisting, URL-based forwarding and URL shortening services. These applications need fast URL queries and updates, thus requiring an efficient updateable data structure. As the processing power of general-purpose multi-core processors increases, software-based approaches are better able to meet the speed requirements of URL matching. In this paper, we present our preliminary performance study of finite-automata- and hash-based URL matching implementations on commodity PCs. The impacts of the cache and memory allocation methods are discussed.