Dynamic Scheme for Packet Classification Using Splay Trees

  • Nizar Ben-Neji
  • Adel Bouhoula
Conference paper

DOI: 10.1007/978-3-540-88181-0_27

Part of the Advances in Soft Computing book series (AINSC, volume 53)
Cite this paper as:
Ben-Neji N., Bouhoula A. (2009) Dynamic Scheme for Packet Classification Using Splay Trees. In: Corchado E., Zunino R., Gastaldo P., Herrero Á. (eds) Proceedings of the International Workshop on Computational Intelligence in Security for Information Systems CISIS’08. Advances in Soft Computing, vol 53. Springer, Berlin, Heidelberg

Abstract

Many researches are about optimizing schemes for packet classification and matching filters to increase the performance of many network devices such as firewalls and QoS routers. Most of the proposed algorithms do not process dynamically the packets and give no specific interest in the skewness of the traffic. In this paper, we conceive a set of self-adjusting tree filters by combining the scheme of binary search on prefix length with the splay tree model. Hence, we have at most 2 hash accesses per filter for consecutive values. Then, we use the splaying technique to optimize the early rejection of unwanted flows, which is important for many filtering devices such as firewalls. Thus, to reject a packet, we have at most 2 hash accesses per filter and at least only one.

Keywords

Packet Classification Binary Search on Prefix Length Splay Tree Early Rejection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Nizar Ben-Neji
    • 1
  • Adel Bouhoula
    • 1
  1. 1.Higher School of Communications of Tunis (Sup’Com)University November 7th at Carthage City of Communications TechnologiesGhazalaTunisia

Personalised recommendations