Abstract
Due to the increasing number of Internet users and the volume of information exchanged by software applications, Internet packet traffic has increased significantly, which has highlighted the need to accelerate the processing required in network systems. Packet classification is one of the solutions implemented in network systems. The most important issue is to use an approach that can classify packets at the speed of the network and show optimum performance in terms of memory usage. In this study, we evaluated the performance in packet classification of two of the most important data structures used in decision trees, i.e. the skip list and splay tree. Our criteria for performance were the time of packet classification, the number of memory accesses, and memory usage of each event. These criteria were tested by the ACL and IPC rules with different numbers of rules as well as by different packet numbers. The results of the evaluation showed that the performance of skip lists is higher than that of splay trees. By increasing the number of classifying rules, both the difference in the speed of packet classification and the superiority of the performance of the skip list over that of the splay tree become more significant. The skip list also maintains its superiority over the splay tree in lower memory usage. The results of the experiments confirm the scalability of this method in comparison to the splay tree method.
Highlights
The Internet is the largest packet-switching network
The amount of memory used by both approaches with IPC rules is significantly less than the memory used with ACL rules. This additional space can be reasonably justified by significant reduction in the number of memory accesses and packet classification time in skip lists
We focused on the skip list and the splay tree and evaluated these two approaches with ACL and IPC rules
Summary
The Internet is the largest packet-switching network. In this network, information is transmitted in the form of packets from the source to the destination. Comparison of the performance of skip lists and splay trees in classification of internet packets. The large size of the data structures required in these algorithms makes them inefficient in terms of memory usage In this method, the filters are divided by the number of bits specified in the prefixes of the search query, and the search space is partitioned into several sub-spaces. The input packets are carefully matched and checked against the generated tuples using the simple or tree-based search algorithm on the prefix fields of interest (Kirschenhofer, Martínez & Prodinger, 1995). We intend to evaluate and compare the performance of packet-classifying tree algorithms using these two different data structures. For this purpose, we will use the criteria of time complexity and memory complexity. The final section draws conclusions and indicates directions for further research
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
