Title :
Software-based implementations of updateable data structures for high-speed URL matching
Author :
Yuan, Haowei ; Wun, Benjamin ; Crowley, Patrick
Author_Institution :
Comput. Sci. & Eng., Washington Univ. in St. Louis, St. Louis, MO, USA
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.
Keywords :
cache storage; cryptography; data structures; finite automata; query processing; software performance evaluation; storage allocation; string matching; URL query; cache allocation; finite automata based URL matching; general purpose multicore processors; hash based URL matching; high-speed URL matching; memory allocation; software based implementation; string matching problem;; updateable data structure; Data structures; Doped fiber amplifiers; Dynamic scheduling; Memory management; Program processors; Resource management; Throughput;
Conference_Titel :
Architectures for Networking and Communications Systems (ANCS), 2010 ACM/IEEE Symposium on
Conference_Location :
La Jolla, CA
Print_ISBN :
978-1-4244-9127-8
Electronic_ISBN :
978-1-4503-0379-8
