Abstract
Due to the evolution of the Internet and its services, the process of forwarding packets in routers is becoming more complex. In order to execute the sophisticated routing logic of modern firewalls, multidimensional packet classification is required. Unfortunately, the multidimensional packet classification algorithms are known to be either time or storage hungry in the general case. It has been anticipated that more feasible algorithms could be obtained for conflict-free classifiers. This paper proposes a novel two-dimensional packet classification algorithm applicable to the conflict-free classifiers. It derives from the well-known tuple space paradigm and it has the search cost of O(log w) and storage complexity of O(n2 w log w), where w is the width of the protocol fields given in bits and n is the number of rules in the classifier. This is remarkable because without the conflict-free constraint the search cost in the two-dimensional tuple space is Θ(w).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alutoin, M., Raatikainen, P.: Control Interface for Router Extension. Proceedings of 21st IASTED Conference on Applied Informatics (2003) 697–702
Gupta, P., McKeown, N.: Packet Classification on Multiple Fields. Proceedings of ACM SIGCOMM’99, vol. 29, no. 4 (1999) 147–160
Gupta, P., McKeown, N.: Algorithms for Packet Classification. IEEE Network, vol. 15, issue 2 (2001) 24–32
Chao, H.J.: Next Generation Routers. Proceedings of the IEEE, vol. 90, no. 9 (2002) 1518–1558
Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable High Speed IP Routing Lookups. Proceedings of ACM SIGCOMM’97 (1997) 25–36
Overmars, M.H., van der Stappen, A.F.: Range Searching and Point Location Among Fat Objects. Journal of Algorithms, 21(3) (1996) 629–656
Warkhede, P., Suri, S., Varghese, G.: Fast Packet Classification for Two-Dimensional Conflict-Free Filters. Proceedings of 20th IEEE Infocom, vol. 3 (2001) 1434–1443
Srinivasan, V., Suri, S., Varghese, G.: Packet Classification using Tuple Space Search. Proceedings of ACM SIGCOMM’99 (1999) 135–146
Hari, A., Suri, S., Palkar, G.: Detecting and Resolving Packet Filter Conflicts. Proceedings of 19th IEEE Infocom, vol. 3 (2000) 1203–1212
Baboescu, F., Varghese, G.: Fast and Scalable Conflict Detection for Packet Classifiers, IEEE Computer Networks, vol. 42 (2003) 717–735
Waldvogel, M.: Multi-dimensional Prefix Matching Using Line Search. Proceedings of IEEE Local Computer Networks (2000) 200–207
Srinivasan, V., Varghese, G., Suri, S., M. Waldvogel: Fast and Scalable Layer Four Switching. Proceedings of ACM SIGCOMM’98 (1998) 191–202
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alutoin, M., Raatikainen, P. (2004). Diagonal Tuple Space Search in Two Dimensions. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive