- Title
- A comparison of exact string search algorithms for deep packet inspection
- Creator
- Hunt, Kieran
- Subject
- Algorithms
- Subject
- Firewalls (Computer security)
- Subject
- Computer networks -- Security measures
- Subject
- Intrusion detection systems (Computer security)
- Subject
- Deep Packet Inspection
- Date Issued
- 2018
- Date
- 2018
- Type
- text
- Type
- Thesis
- Type
- Masters
- Type
- MSc
- Identifier
- http://hdl.handle.net/10962/60629
- Identifier
- vital:27807
- Description
- Every day, computer networks throughout the world face a constant onslaught of attacks. To combat these, network administrators are forced to employ a multitude of mitigating measures. Devices such as firewalls and Intrusion Detection Systems are prevalent today and employ extensive Deep Packet Inspection to scrutinise each piece of network traffic. Systems such as these usually require specialised hardware to meet the demand imposed by high throughput networks. Hardware like this is extremely expensive and singular in its function. It is with this in mind that the string search algorithms are introduced. These algorithms have been proven to perform well when searching through large volumes of text and may be able to perform equally well in the context of Deep Packet Inspection. String search algorithms are designed to match a single pattern to a substring of a given piece of text. This is not unlike the heuristics employed by traditional Deep Packet Inspection systems. This research compares the performance of a large number of string search algorithms during packet processing. Deep Packet Inspection places stringent restrictions on the reliability and speed of the algorithms due to increased performance pressures. A test system had to be designed in order to properly test the string search algorithms in the context of Deep Packet Inspection. The system allowed for precise and repeatable tests of each algorithm and then for their comparison. Of the algorithms tested, the Horspool and Quick Search algorithms posted the best results for both speed and reliability. The Not So Naive and Rabin-Karp algorithms were slowest overall.
- Format
- 146 pages
- Format
- Publisher
- Rhodes University
- Publisher
- Faculty of Science, Computer Science
- Language
- English
- Rights
- Hunt, Kieran
- Hits: 3945
- Visitors: 4043
- Downloads: 220
Collections
RU Department of Computer Science
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Adobe Acrobat PDF | 5 MB | Adobe Acrobat PDF | View Details Download |