12 search results - page 1 / 3 » Approximate Matching of Network Expressions with Spacers |
LATIN
1992
Springer
15 years 1 months ago
1992
Springer
102
click to vote
ANCS
2009
ACM
14 years 7 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
FPL
2005
Springer
15 years 3 months ago
2005
Springer
String pattern matching is a computationally expensive task, and when implemented in hardware, it can consume a large amount of resources for processing and storage. This paper pr...
WCNC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separa...
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...