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

Haowei Yuan, Benjamin Wun, Patrick Crowley

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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 multicore 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.

Original languageEnglish
Title of host publicationANCS 2010 - Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
PublisherIEEE Computer Society
ISBN (Print)9781450303798
DOIs
StatePublished - 2010

Publication series

NameANCS 2010 - Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Fingerprint

Dive into the research topics of 'Software-based implementations of updateable data structures for high-speed URL matching'. Together they form a unique fingerprint.

Cite this