Abstract
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup algorithms for fast update. This is done by partitioning the IP forwarding table into independent sets. Each independent set can be looked as a set of disjoint ranges, therefore any data structure for disjoint ranges search can be combined with this algorithm to support fast update. This algorithm achieves fast update by avoiding the worst-case update scenario. The number of independent sets is small, hence, the number of parallel data structures is small.
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
Deering, S., Hinden, R.: Internet Protocol, Version 6 (IPv6) Specification, RFC 2460 (December 1998)
Hinden, R., Deering, S.: Internet Protocol Version 6 (IPv6) Addressing Architecture, RFC 3513 (April 2003)
Lu, H., Sahni, S.: O(log n) Dynamic Router-Tables for Ranges. In: IEEE Symposium on Computers and Communications, pp. 91–96 (2003)
McAuley, A., Francis, P.: Fast Routing Table Lookup Using CAMs. In: IEEE INFOCOM 1993, March 1993, vol. 3, pp. 1382–1391 (1993)
Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network 15(2), 8–23 (2001)
Ramaswami, R., Sivarajan, K.N.: Optical Networks: A Practical Perspective. Morgan Kaufmann, San Francisco (1998)
Rekhter, Y., Li, T.: An Architecture for IP Address Allocation with CIDR, RFC 1518 (September 1993)
Sahni, S., Kim, K.: O(log n) Dynamic Packet Routing. In: IEEE Symposium on Computers and Communications, pp. 443–448 (2002)
Sahni, S., Kim, K., Lu, H.: Data Structures for One-dimensional Packet Classification Using Most-specific-rule Matching. International Journal on Foundations of Computer Science 14(3), 337–358 (2003)
Seppänen, K.: Novel IP Address Lookup Algorithm for Inexpensive Hardware Implementation. WSEAS Transactions on Communications 1(1), 76–84 (2002)
Sun, X.: IP Address Lookups and Packet Classification: A Tutorial and Review, Technical Report #380, LRSP, Carleton University (2002)
Sun, X., Zhao, Y.: An On-Chip IP Address Lookup Algorithm. submitted to IEEE Transactions on Computers (2004) (patent pending)
Sun, X., Zhao, Y.: Packet Classification Using Independent Sets. In: IEEE Symposium on Computers and Communications (2003)
Suri, S., Varghese, G., Warkhede, P.R.: Multiway Range Trees: Scalable IP Lookups with Fast Updates. In: Globecom (2001)
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
Sun, X., Sahni, S.K., Zhao, Y.Q. (2004). Fast Update Algorithm for IP Forwarding Table Using Independent Sets. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-25969-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22262-0
Online ISBN: 978-3-540-25969-5
eBook Packages: Springer Book Archive