位置：成果数据库 > 会议 > 会议详情页
Step-FA: Step-based compact finite automaton for accelerating multi-string matching
  • 所属机构名称：西安交通大学
  • 会议名称：IEEE Conference on Computer Communications Workshops, INFOCOM 2010
  • 成果类型：会议
  • 相关项目：高速网络测量的普适在线压缩统计理论与方法
作者： Tang, Yi1|Jiang, Junchen1|Liu, Bin1|
同会议论文项目
高速网络测量的普适在线压缩统计理论与方法
期刊论文 17 会议论文 19 专利 3
同项目会议论文
Measurements on movie distribution behavior in peer-to-peer networks
Cache-Based Scalable Deep Packet Inspection with Predictive Automaton
Poster: Compressing Flow Statistic Counters
Safeguarding data delivery by decoupling path propagation and adoption
A(2)C: Anti-Attack Counters For Traffic Measurement
Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks
Reducing Power of Traffic Manager in Routers via Dynamic On/Off-chip Scheduling
Pattern-based DFA for memory-efficient and scalable multiple regular expression matching
Accelerating network applications on X86-64 platforms
S3:Smart Selection of Sampling Function for Passive Network Measurement
DISCO: Memory Efficient and Accurate Flow Statistics for Network Measurement
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Deflation DFA: Remembering History is Adequate
Parallel Architecture for High Throughput DFA-Based Deep Packet Inspection
Experiences with Active Per-flow Queuing for Traffic Manager in High Performance Routers
Module-Based Finite Automata: A Scalable and Memory-Efficient Architecture for Multi-pattern Matchin
Experience on Applying Push Model to Packet Processors in High Performance Routers
Evaluating Potential Routing Diversity for Internet Failure Recovery