Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Domenico Ficara"'
Autor:
Amine Choukir, Domenico Ficara, Marco Dondero, Leo Caldarola, Antonio Trifilo, Libor Polcak, Barbora Franková, Roberto Muccifora, Davide Cuda, Martin Holkovič
Publikováno v:
E-Business and Telecommunications ISBN: 9783319302218
ICETE (Selected Papers)
ICETE (Selected Papers)
Policies for network traffic handling define packet routes through networks, enforce required quality of service, and protect networks from security threats. When expressing a policy, one needs to characterise the traffic to which the policy applies
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3aad283c74a0404786f3617df553977b
https://doi.org/10.1007/978-3-319-30222-5_2
https://doi.org/10.1007/978-3-319-30222-5_2
Publikováno v:
IEEE Network. 23:30-35
Standard pattern-matching methods used for deep packet inspection and network security can be evaded by means of TCP and IP fragmentation. To detect such attacks, intrusion detection systems must reassemble packets before applying matching algorithms
Autor:
Domenico Ficara, Andrea Di Pietro, Gregorio Procissi, Gianni Antichi, Stefano Giordano, Fabio Vitucci
Publikováno v:
Scopus-Elsevier
Modern network devices need to perform deep packet inspection at high speed for security and application-specific services. Finite Automata (FAs) are used to implement regular expressions matching, but they require a large amount of memory. Many rece
Autor:
Davide Cuda, Amine Choukir, Marco Dondero, Domenico Ficara, Roberto Muccifora, Antonio Trifilo, Leo Caldarola, Libor Polcak
Publikováno v:
DCNET
As the number of network services and applications increases, each one of them showing different requirements in terms of bandwidth and latency, it becomes critical for network operators to identify these applications. This paper builds up on the pri
Publikováno v:
GLOBECOM
In this paper we propose a novel hardware-software co-design vision that aims at enhancing flexibility and reusability of hardware based packet forwarding engines. In particular, we move on the path of the well-known OpenFlow architecture that allows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b55cda0db3b7bec0b741a3e3225eaba
Autor:
Domenico Ficara, Nicola Bonelli, Gregorio Procissi, Fabio Vitucci, Stefano Giordano, Gianni Antichi, Andrea Di Pietro
Publikováno v:
GLOBECOM
Modern network devices need to perform deep packet inspection at high speed for security and application- specific services. For this purpose, regular expressions are used, due to their high expressive power, and Deterministic Finite Automata (DFAs)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9991022d15e1618f7de0b09450de3602
http://hdl.handle.net/11568/194067
http://hdl.handle.net/11568/194067
Autor:
Andrea Di Pietro, Domenico Ficara, Fabio Vitucci, Gianni Antichi, Gregorio Procissi, Stefano Giordano
Publikováno v:
IEEE/ACM Transactions on Networking
Deep packet inspection is a fundamental task to improve network security and provide application-specific services. State-of-the-art systems adopt regular expressions due to their high expressive power. They are typically matched through deterministi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01132bf526b5938d2c30237e44e8db4b
http://hdl.handle.net/11568/189239
http://hdl.handle.net/11568/189239
Autor:
Stefano Giordano, Gianni Antichi, A. Di Pietro, Domenico Ficara, Fabio Vitucci, Gregorio Procissi
Publikováno v:
ICC
Modern network devices need to perform deep packet inspection at high speed for security and application-specific services. Instead of standard strings to represent the dataset to be matched, state-of-the-art systems adopt regular expressions, due to
Publikováno v:
ICC
A Bloom Filter is an efficient randomized data structure for membership queries on a set with a certain known false positive probability. Bloom Filters (BFs) are very attractive for their limited memory requirements and their easy construction which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::627e77568d5b8207ee16883e8128cc6e
http://hdl.handle.net/11568/202807
http://hdl.handle.net/11568/202807
Publikováno v:
IEEE/ACM Transactions on Networking
Bloom Filters are efficient randomized data structures for membership queries on a set with a certain known false positive probability. Counting Bloom Filters (CBFs) allow the same operation on dynamic sets that can be updated via insertions and dele