|
 코드번호 : 2 |
|
| 발표자 : 한동수 |
|
| 소속 : KAIST |
|
| 부서 : 전기및전자공학부 |
|
| 직위 : 교수 |
|
| 세션시간 : 09:00~11:00 |
|
| 발표자약력 : |
2012.12 Carnegie Mellon University (박사)
2004.2 KAIST 전자 전산학과 졸업 (학사)
2013.1 ~ 2013.5 박사후 연구원 Carnegie Mellon University
2013.6 ~ 현재. KAIST 전기 및 전자공학부 조교수 |
|
|
| 강연요약 : |
Middlebox services that inspect packet payloads have become commonplace. Today, anyone can sign up for cloudbased Web application firewall with a single click. These services typically look for known patterns that might appear anywhere in the payload. The key challenge is that existing solutions for pattern matching have become a bottleneck because software packet processing technologies have advanced. The popularization of cloud-based services has made the problem even more critical. This paper presents an efficient multi-pattern string matching algorithm, called DFC. DFC significantly reduces the number of memory accesses and cache misses by using small and cache-friendly data structures and avoids instruction pipeline stalls by minimizing sequential data dependency. Our evaluation shows that DFC improves performance by 2.0 to 3.6 times compared to state-of-the-art on real traffic workload obtained from a commercial network. It also outperforms other algorithms even in the worst case. When applied to middlebox applications, such as network intrusion detection, anti-virus, and Web application firewalls, DFC delivers 57-160% improvement in performance. |
|
|
|
