Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their non-deterministic performance. Although CAMs are favoured by technology vendors due to their deterministic high lookup rates, they suffer from the problems of high power dissipation and high silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multi-level cutting the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.
|Journal||Journal of Computer Systems, Networks and Communications|
|Publication status||Published - Oct 2008|
Aldiab, M., Garcia-Palacios, E., Crookes, D., & Sezer, S. (2008). Packet classification by multi-level cutting of the classification space: An algorithmic-architectural solution for IP packet classification in next generation networks. Journal of Computer Systems, Networks and Communications, 2008. https://doi.org/10.1155/JCSNC