MULTI-GIGABIT PATTERN FOR DATA IN NETWORK SECURITY
| Autor: | Prof.P.Vijai Bhaskar, Ravi. Ch, B.Rambhupal Reddy, Praveen Kumar . Ch |
|---|---|
| Rok vydání: | 2013 |
| Předmět: | |
| Zdroj: | International Journal of Computer and Communication Technology. :249-256 |
| ISSN: | 2231-0371 0975-7449 |
| DOI: | 10.47893/ijcct.2013.1204 |
| Popis: | In the current scenario network security is emerging the world. Matching large sets of patterns against an incoming stream of data is a fundamental task in several fields such as network security or computational biology. High-speed network intrusion detection systems (IDS) rely on efficient pattern matching techniques to analyze the packet payload and make decisions on the significance of the packet body. However, matching the streaming payload bytes against thousands of patterns at multi-gigabit rates is computationally intensive. Various techniques have been proposed in past but the performance of the system is reducing because of multi-gigabit rates.Pattern matching is a significant issue in intrusion detection systems, but by no means the only one. Handling multi-content rules, reordering, and reassembling incoming packets are also significant for system performance. We present two pattern matching techniques to compare incoming packets against intrusion detection search patterns. The first approach, decoded partial CAM (DpCAM), pre-decodes incoming characters, aligns the decoded data, and performs logical AND on them to produce the match signal for each pattern. The second approach, perfect hashing memory (PHmem), uses perfect hashing to determine a unique memory location that contains the search pattern and a comparison between incoming data and memory output to determine the match. The suggested methods have implemented in vhdl coding and we use Xilinx for synthesis. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|