Dynamic Scheme for Packet Classification Using Splay Trees

  • Nizar Ben-Neji
  • Adel Bouhoula
Part of the Advances in Soft Computing book series (AINSC, volume 53)


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.


Packet Classification Binary Search on Prefix Length Splay Tree Early Rejection 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable High-Speed IP Routing Lookups. ACM SIGCOMM Comput. Commu. Review. 27(4), 25–36 (1997)CrossRefGoogle Scholar
  2. 2.
    Srinivasan, T., Nivedita, M., Mahadevan, V.: Efficient Packet Classification Using Splay Tree Models. IJCSNS International Journal of Computer Science and Network Security 6(5), 28–35 (2006)Google Scholar
  3. 3.
    Srinivasan, V., Varghese, G.: Fast Address Lookups using Controlled Prefix Expansion. ACM Trans. Comput. Syst. 17(1), 1–40 (1999)CrossRefGoogle Scholar
  4. 4.
    Kim, K., Sahni, S.: IP Lookup by Binary Search on Prefix Length. J. Interconnect. Netw. 3, 105–128 (2002)CrossRefGoogle Scholar
  5. 5.
    Hamed, H., El-Atawy, A., Al-Shaer, E.: Adaptive Statistical Optimization Techniques for Firewall Packet Filtering. In: IEEE INFOCOM, Barcelona, Spain, pp. 1–12 (2006)Google Scholar
  6. 6.
    Sleator, D., Tarjan, R.: Self Adjusting Binary Search Trees. Journal of the ACM 32, 652–686 (1985)MATHCrossRefMathSciNetGoogle Scholar

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