SCOPUS 정보 검색 플랫폼

IEEE International Conference on Communications

Volumn , Issue , 2012, Pages 1079-1084

Efficient multistriding of large non-deterministic finite state automata for deep packet inspection

(3) Avalle, Matteo a Risso, Fulvio a Sisto, Riccardo a

a POLITECNICO DI TORINO (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING PROCESS; DEEP PACKET INSPECTION; EFFICIENT BUILDINGS; INPUT MATCHING; INPUT STRING; MEMORY SPACE; MEMORY USAGE; PACKET INSPECTION; REQUIRED TIME;

ALGORITHMS;

AUTOMATA THEORY;

EID: 84871990896 PISSN: 15503607 EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/ICC.2012.6364235 Document Type: Conference Paper

Times cited : (3)

References (7)

1
- 77954026099
- An improved algorithm to accelerate regular expression evaluation
- Orlando, FL, December. ACM
- M. Becchi and P. Crowley. An improved algorithm to accelerate regular expression evaluation. In Proceedings of the 2007 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Orlando, FL, December 2007. ACM.
- (2007) Proceedings of the 2007 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)
- Becchi, M.¹ Crowley, P.²

2
- 70350692284
- Efficient regular expression evaluation: Theory to practice
- New York, NY, USA. ACM
- M. Becchi and P. Crowley. Efficient regular expression evaluation: theory to practice. In ANCS '08: Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, pages 50-59, New York, NY, USA, 2008. ACM.
- (2008) ANCS '08: Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems , pp. 50-59
- Becchi, M.¹ Crowley, P.²

3
- 84858403709
- Infant: Nfa pattern matching on gpgpu devices
- N. Cascarano, P. Rolando, F. Risso, and R. Sisto. infant: Nfa pattern matching on gpgpu devices. SIGCOMM Comput. Commun. Rev., 40:20-26, 2010.
- (2010) SIGCOMM Comput. Commun. Rev. , vol.40 , pp. 20-26
- Cascarano, N.¹ Rolando, P.² Risso, F.³ Sisto, R.⁴

4
- 0014825089
- On the state minimization of nondeterministic finite automata
- july
- T. Kameda and P. Weiner. On the state minimization of nondeterministic finite automata. Computers, IEEE Transactions on, C-19(7):617-627, july 1970.
- (1970) Computers, IEEE Transactions on , vol.C-19 , Issue.7 , pp. 617-627
- Kameda, T.¹ Weiner, P.²

5
- 81255143459
- Fast and compact regular expression matching using character substitution (to appear)
- Brooklyn, NY, USA, Oct.
- X. Liu, X. Liu, and N. Sun. Fast and compact regular expression matching using character substitution (to appear). In Proceedings of ACM/IEE Symposium on Architectures for Networking and Communications Systems, Brooklyn, NY, USA, Oct. 2011.
- (2011) Proceedings of ACM/IEE Symposium on Architectures for Networking and Communications Systems
- Liu, X.¹ Liu, X.² Sun, N.³

6
- 85076292285
- Fast regular expression matching using small tcams for network intrusion detection and prevention systems
- Berkeley, CA, USA
- C. Meiners, J. Patel, E. Norige, E.Torng, and A. Liu. Fast regular expression matching using small tcams for network intrusion detection and prevention systems. In USENIX Security'10 Proceedings of the 19th USENIX conference on Security, Berkeley, CA, USA, 2010.
- (2010) USENIX Security'10 Proceedings of the 19th USENIX Conference on Security
- Meiners, C.¹ Patel, J.² Norige, E.³ Torng, E.⁴ Liu, A.⁵

7
- 0000973916
- Finite automata and their decision problems
- april
- M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3(2):114-125, april 1959.
- (1959) IBM Journal of Research and Development , vol.3 , Issue.2 , pp. 114-125
- Rabin, M.O.¹ Scott, D.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.