Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of almost every modern intrusion detection system is a string matching algorithm. String matching is one of the most critical elements because it allows for the system to make decisions based not just on the headers, but the actual content flowing through the network. Unfortunately, checking every byte of every packet to see if it matches one of a set of ten thousand strings becomes a computationally intensive task as network speeds grow into the tens, and eventually hundreds, of gigabits/second. To keep up with these speeds a specialized device is required, one that can maintain tight bounds on worst case performance, that can be updated with new rules without interrupting operation, and one that is efficient enough that it could be included on chip with existing network chips or even into wireless devices. We have developed an approach that relies on a special purpose architecture that executes novel string matching algorithms specially optimized for implementation in our design. We show how the problem can be solved by converting the large database of strings into many tiny state machines, each of which searches for a portion of the rules and a portion of the bits of each rule. Through the careful co-design and optimization of our our architecture with a new string matching algorithm we show that it is possible to build a system that is 10 times more efficient than the currently best known approaches.

Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network and at the heart of almost every modern intrusion detection system is a string-matching algorithm. String matching is one of the most critical elements because it allows for the system to make decisions based not just on the headers, but the actual content flowing through the network. Unfortunately, checking every byte of every packet to see if it matches one of a set of thousands of strings becomes a computationally intensive task as network speeds grow into the tens, and eventually hundreds, of gigabits/second. To keep up with these speeds, a specialized device is required, one that can maintain tight bounds on worst-case performance, that can be updated with new rules without interrupting operation, and one that is efficient enough that it could be included on-chip with existing network chips or even into wireless devices. We have developed an approach that relies on a special purpose architecture that executes novel string matching algorithms specially optimized for implementation in our design. We show how the problem can be solved by converting the large database of strings into many tiny state machines, each of which searches for a portion of the rules and a portion of the bits of each rule. Through the careful codesign and optimization of our architecture with a new string-matching algorithm, we show that it is possible to build a system that is 10 times more efficient than the currently best known approaches.

No abstract

With the upgrading of logistics demand and the innovation of modern information technology, the smart logistics platform integrates advanced concepts, technologies, and management methods, maximizes the integration of logistics resources and circulation channels, and effectively improves the efficiency of logistics transactions, but its energy consumption problem is particularly prominent. The study of intelligent measurement and monitoring of carbon emissions in smart logistics is of great value to reduce energy consumption, reduce carbon emissions in buildings, and improve the environment. In this paper, by comparing and analyzing the accounting standards of carbon emissions and their calculation methods, the carbon emission factor method is selected as the method to study the carbon emissions of the smart logistics process in this paper. The working principle of each key storage technology in the smart logistics process is analyzed to find out the equipment factors affecting the carbon emission of each storage technology in the smart logistics process, and the carbon emission calculation model of each key storage technology is established separately by using the carbon emission factor method. Meanwhile, according to the development history of energy consumption assessment, the assessment process of different stages from logistics storage energy consumption assessment to smart logistics energy consumption assessment is analyzed, and based on this, a carbon emission energy consumption assessment framework based on 5G shared smart logistics is constructed. This paper applies the supply chain idea to define the smart logistics supply chain, constructs a conceptual model of the smart logistics supply chain considering carbon emissions, and at the same time combines the characteristics of the smart logistics supply chain to analyze the correlation between the carbon emissions of the smart logistics supply chain and the related social, environmental, and economic systems.

In this paper, we are concerned with the fast solvers for higher order edge finite element discretizations of Maxwell's equations. We present the preconditioners for the first family and second family of higher order Nédélec element equations, respectively. By combining the stable decompositions of two kinds of edge finite element spaces with the abstract theory of auxiliary space preconditioning, we prove that the corresponding condition numbers of our preconditioners are uniformly bounded on quasi-uniform grids. We also present some numerical experiments to demonstrate the theoretical results.