Fast and Memory Efficient Conflict Detection for Multidimensional Packet Filters

Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 145)


Packet classification plays an important role in supporting advanced network services such as Virtual Private Networks (VPNs), quality-of-service (QoS), and policy-based routing. Routers classify incoming packets into different categories according to pre-defined rules, which are called packet filters. If two or more filters overlap, a conflict may occur and leads to ambiguity in packet classification. In this paper, we propose an algorithm which can efficiently detect and resolve filter conflicts. The proposed algorithm can handle filters with more than two fields, which is more general than algorithms designed for two-dimensional filters.We use the synthetic filter databases generated by ClassBench to evaluate the proposed algorithm. Compared with the bit-vector algorithm, simulation results show that the proposed algorithm can reduce the detection times by over 84% for 10 out of 12 filter databases, and only uses less than 26% of memory space.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hari, A., Suri, S., Parulkar, G.: Detecting and Resolving Packet Filter Conflicts. In: Proceedings of INFOCOM, pp. 1203–1212 (2000)Google Scholar
  2. 2.
    Lu, H., Sahni, S.: Conflict detection and resolution in two dimensional prefix router tables. IEEE/ACM Transactions on Networking 13(6), 1353–1363 (2005)CrossRefGoogle Scholar
  3. 3.
    Varghese, G., Suri, S., Varghese, G.: Packet classification using tuple space search. In: Proceedings of ACM SIGCOMM, pp. 135–146 (1999)Google Scholar
  4. 4.
    Srinivasan, V., Varghese, G., Suri, S., Waldvogel, M.: Fast and scalable layer four switching. In: Proceedings of ACM SIGCOMM, pp. 191–202 (1998)Google Scholar
  5. 5.
    Baboescu, F., Varghese, G.: Fast and Scalable Conflict Detection for Packet Classifier. Computer Networks 42(6), 717–735 (2003)MATHCrossRefGoogle Scholar
  6. 6.
    Lakshman, T.V., Stiliadis, D.: High-Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching. In: Proceedings of ACM SIGCOMM, pp. 203–214 (1998)Google Scholar
  7. 7.
    Baboescu, F., Varghese, G.: Scalable Packet Classification. In: Proceedings of ACM SIGCOMM, pp. 199–210 (2001)Google Scholar
  8. 8.
    Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable High Speed IP Routing Lookups. In: Proceedings of ACM SIGCOMM, pp. 25–36 (1997)Google Scholar
  9. 9.
    Taylor, D.E., Turner, J.S.: Classbench: a packet classification benchmark. IEEE/ACM Transactions on Networking 15(3), 499–511 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Dept. of Computer Science and Information EngineeringChang Gung UniversityTaoyuanTaiwan
  2. 2.Dept. of Computer ScienceNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations