A Fast Packet Classification by Using Enhanced Tuple Pruning

  • Pi-Chung Wang
  • Chia-Tai Chan
  • Wei-Chun Tseng
  • Yaw-Chung Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2334)

Abstract

In the packet classification, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source/destination address, TCP and UDP port numbers. It has been demonstrated that performing packet classification on a potentially large number of fields is difficult and has poor worst-case performance. In this work, we proposed an enhanced tuple pruning search algorithm called “Tuple Pruning + ” that provides fast two-dimension packet classification. With reasonable extra filters added for Information Marker, only one hash access to the tuples is required. Through experiments, about 8 MB memory is required for 100K-filter database and 20 million packet per second (MPPS) is achievable. The results demonstrate that the proposed algorithm is suitable for high-speed packet classification.

References

  1. 1.
    V. Srinivasan, G. Varghese and S. Suri: Packet Classification using Tuple Space Search. ACM SIGCOMM. (1999) 135–146Google Scholar
  2. 2.
    T.V. Lakshman and D. Stidialis: High Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching. ACM SIGCOMM. (1999) 203–214Google Scholar
  3. 3.
    V. Srinivasan, G. Varghese, S. Suri and M. Waldvogel: Fast Scalable Level Four Switching. ACM SIGCOMM. (1998) 191–202Google Scholar
  4. 4.
    Pankaj Gupta and Nick McKeown: Packet Classification on Multiple Fields. ACM SIGCOMM. (1999) 147–160Google Scholar
  5. 5.
    Anja Feldmann and S. Muthukrishnan: Tradeoffs for Packet Classification. IEEE INFOCOM. (2000) 1193–1202Google Scholar
  6. 6.
    Thomas Woo: A Modular Approach to Packet Classification: Algorithms and Results. IEEE INFOCOM. (2000) 1213–1222Google Scholar
  7. 7.
    M. Buddhikot, S. Suri and M. Waldvogel: Space Decomposition Techniques for Fast Layer-4 Switching. IFIP Sixth International Workshop on High Speed Networks. (2000)Google Scholar
  8. 8.
    Pankaj Gupta and Nick McKeown: Packet Classification using Hierarchical Intelligent Cuttings. Hot Interconnects VII. (1999)Google Scholar
  9. 9.
    Ying-Dar Lin, Huan-Yun Wei and Kuo-Jui Wu: Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers. Computer Communications, Vol. 24. (2001) 667–676CrossRefGoogle Scholar
  10. 10.
    M. Waldvogel, G. Varghese, J. Turner and B. Plattner: Scalable High Speed IP Routing Lookups. ACM SIGCOMM. (1997) 25–36Google Scholar
  11. 11.
    NLANR Project: National Laboratory for Applied Network Research. See http://www.nlanr.net
  12. 12.
    Merit Networks Inc.: Internet Performance Measurement and Analysis (IPMA) Statistics and Daily Reports. IMPA Project. See http://www.merit.edu/ipma/routingtable/
  13. 13.
    V. Srinivasan and G. Varghese: Fast IP lookups using controlled prefix expansion. ACM Trans. On Computers, Vol. 17. (1999) 1–40CrossRefGoogle Scholar
  14. 14.
    P.C. Wang, C.T. Chan and Y.C. Chen: Performance Enhancement of IP forwarding by using Routing Interval. Journal of Communications and Networks, Vol. 3. (2001) 374–382.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Pi-Chung Wang
    • 1
  • Chia-Tai Chan
    • 1
  • Wei-Chun Tseng
    • 1
  • Yaw-Chung Chen
    • 2
  1. 1.Telecommunication LaboratoriesChunghwa Telecom Co., LtdTaipeiTaiwan, R.O.C.
  2. 2.Department of Computer Science and Information EngineeringNational Chiao Tung UniversityHsinchuTaiwan, R.O.C.

Personalised recommendations