Abstract
IP routers need lookup tables to forward packets. They also classify packets to determine which flow they belong to and to decide what quality of service they should receive. Increasing rate of communication links is in contrast with practical processing power of routers and switches. We propose a few neural network algorithms to solve the IP lookup problem. Some of these algorithms, gives promising results, however, they have problems in training time. Parallel processing of neural networks provide a huge processing power to do IP lookup. The algorithm can be implemented in hardware on a single chip. Our method can perform an IP lookup in 4.5 nanoseconds, which implies supporting 60 Gbps link rate. Pipelining and parallel processing can be used to increase the link rate up to 400 Gbps and decrease the learning time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baraldi, A., Parmiggiani, F.: Neural Network for Unsupervised Categorization of Multivalued Input Patterns: an Application to Satellite Image Clustering, IEEE Transactions on Geoscience and Remote Sensing, Vol. 33 (1995) 305–316
Borg, N., Svanberg, E., Schelen, O.: Efficient Multi-Field Packet Classification for QoS Purposes, Seventh International Workshop on Quality of Service (1999) 109–118
Chaskar, H.M., Dimitriou, E.; Ravikanth, R.:Service Guarantees in the Internet: Differentiated Services Approach, Eighth International Workshop on Quality of Service (2000) 176–178
Decasper, D., Dittia, Z.; Parulkar, G.; Plattner, B.: Router Plugins: A Software Architecture for Next-Generation Routers, IEEE/ACM Transactions on Networking (2000) 2–15
Degermark. M., Brodlink. A., Carlsson. S., Pink. S.: Small Forwarding Tables for Fast Routing Lookups, Proceedings of SIGCOMM (1997) 3–14
Doeringer. W., Karjoth. G., Nassehi. M.: Routing on Longest-Matching Prefixes, IEEE/ACM Trans. Networking, vol. 4, no. 1 (1996) 86–97
Fausett, L.: Fundamentals of Neural Networks. Architectures, Algorithms and Applications, Prentice Hall International, Inc. (1994)
Fulu, L., Seddigh, N., Nandy, B., Matute, D.: An Empirical Study of Today’s Internet Traffic for Differentiated Services IP QoS, Proceedings of Fifth IEEE Symposium on Computers and Communications (2000) 207–213
Feldman, A., Muthukrishnan, S.: Tradeoffs for Packet Classification, Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3 (2000) 1193–1202
Gupta, P.: Algorithms for Routing Lookups and Packet Classification, Degree of Doctor of Philosophy Thesis Submitted to the Department of Computer Science of Stanford University (2001)
Gupta. P., Lin. S., McKeown, N.: Routing Lookups in Hardware at Memory Access Speeds, Proceedings of Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3 (1998) 1240–1247
Gupta P., McKcown, N.: Packet Classification on Multiple Fields, Proceedings of SIGCOMM (1999) 147–160
Hari, A., Suri, S., Parulkar, G.: Detecting and Resolving Packet Filter Conflicts, Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3 (2000) 1203–1212
Hill. F. J., Peterson. J. R.: Introduction to Switching Theory and Logical Design, John Wiley & Sons, New York, 3rd edn. (1981)
Jabri, M. A., Coggins, R. J., Flower. B. G.: Adaptive Analog VLSI Neural Systems, Chapman & Hall (1996)
Jun, X., Singhal, M., Degroat, J.: A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds, Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3 (2000) 1445–1454
Lampson, B., Srinivasan, V., Varghese, G.: IP Lookup Using Multiway and Multicolumn Search, IEEE/ACM Transactions on Networking, Vol. 7 (1999) 324–334
Lawrence, S., Lee Giles, S., Ah Chung, T.: What Size Neural Network Gives Optimal Generalization? Convergence Properties of Back propagation, Technical Report, Institute for Advanced Computer Studies University of Maryland (1996)
McAuley, A. J., Francis, P.: Fast Routing Table Using CAMs, Proceedings of Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, vol. 3 (1993) 1382–1391
Nilsson, S.: IP-Address Lookup Using LC-Tries, IEEE Journal on Selected Areas in Communications, Vol. 17 (1999) 1083–1092
Pi-Chung, W., Chia-Tai Chan, Yaw-Chung, C.: A Fast IP Routing Lookup Scheme, IEEE International Conference on Communications, Vol. 2 (2000) 1140–1144
Waldvogel, M., Varghese. G., Turner. J., Plattner. B.: Scalable High Speed IP Routing Lookups, In Computer Communication Review, Vol. 27, no. 4 (1997)
Web site of Henryk Niewodniczanski Institute: http://chall.ifj.edu.pl/~szczygie/slides
Yazdani, N., Min, P.S.: Fast and Scalable Schemes for the IP Address Lookup Problem, Proceedings of the IEEE Conference on High Performance Switching and Routing (2000) 83–92
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahramian, M., Yazdani, N., Faez, K., Taheri, H. (2002). Neural Network Based Algorithms for IP Lookup and Packet Classification. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-36087-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00028-0
Online ISBN: 978-3-540-36087-2
eBook Packages: Springer Book Archive