Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sai K. Parsi

dblp:95/6624 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 50% Hardware accelerators and domain-specific architectures · 50%
Network and information security
1 paper
Network security · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection
intrusion detection system
0.112008
Implementing high-speed string matching hardware for network intrusion detection systems · FPGA 2008
Reconfigurable computing and FPGAs
FPGA accelerator
0.112008
Implementing high-speed string matching hardware for network intrusion detection systems · FPGA 2008
Hardware accelerators and domain-specific architectures › pattern matching accelerator
string matching accelerator
0.112008
Implementing high-speed string matching hardware for network intrusion detection systems · FPGA 2008
Network security
packet classification
0.012008
Implementing high-speed string matching hardware for network intrusion detection systems · FPGA 2008

Methods — techniques the papers use, named apart from their topics

multi-threading finite state machine · 0.2
YearPublicationVenuePosition
2008 Implementing high-speed string matching hardware for network intrusion detection systems
abstract
This paper presents a string matching hardware on FPGA for network intrusion detection systems. The proposed architecture, consisting of packet classifiers and strings matching verifiers, achieves superb throughput by using several mechanisms. First, based on incoming packet contents, the packet classifiers can dramatically reduce the number of strings to be matched for each packet and, accordingly, feed the packet to a proper verifier to conduct matching. Second, a novel multi-threading finite state machine (FSM) is proposed, which improves FSM clock frequency and allows multiple packets to be examined by a single FSM simultaneously. Design techniques for high-speed interconnect and interface circuits are also presented. Experimental results are presented to explore the trade-offs between system performance, strings partition granularity and hardware resource cost
Atul Mahajan, Benfano Soewito, Sai K. Parsi, Ning Weng, Haibo Wang 0005
FPGA3