National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 

HyperCuts pro filtrování Linuxových paketů
Mašíček, Viktor ; Peterka, Jiří (referee) ; Kučera, Luděk (advisor)
Filtering of packets by multidimensional cutting is one of the new approaches to the solution of the packet classiffication problem. It is based on creating a tree that contains the set rules of filtering. In this case a packets matching is considerably faster than linear traversing of all rules. The HyperCuts methods are one of the latest methods that use multidimensional cutting. At first sight the implementation of the HyperCuts method demonstrated its utility. However, the final decision about the usage of the HyperCuts program in practice can be made only on the basis of the results of testing in it is necessary to can be using in a practice it have to be tested in practical operation. In comparison with the PTree program, which is based on the TBF method, the HyperCuts program, was more successful. The comparison was based on resolving the problem rather than on implementation aspect or success with the same data. In case, where we use PTree source code for confrontation, we compare it with source code of HyperCuts from our implementation. We compare time and memory complexity. In the theoretic part there is explain why the "range match" was used. There is definition of term "cut" which is very advantageous for time and memory complexity. One of the goals of the work was HyperCuts method...

Interested in being notified about new results for this query?
Subscribe to the RSS feed.