Abstract
Many IP forwarding engines have used TCAM(Ternary Content Addressable Memory) for IP address lookup. While TCAM has the advantage of parallel lookup in a single step, it has a difficulty in updating a prefix table. TCAM requires the prefix table to be ordered for the longest prefix matching, so each update may incur several memory movements to maintain the ordering. For the fast updating of the prefix table, it is needed to eliminate the ordering constraint. If a prefix table is partitioned into several sets each of which contains disjoint prefixes, there is at most one match in each set and the ordering of prefixes is not needed any more for the longest prefix matching. Prefixes of each partitioned table should be kept disjoint after updating as well as in the initial configuration. In this paper we present several algorithms for scheduling of updates to keep prefixes of partitioned tables disjoint. We compare and evaluate our scheduling algorithms by simulation with a real-world routing table and updates. Experiment results show that most of updates can be scheduled to the partitioned tables having disjoint prefixes so good update performance can be achieved.
This work was supported by Konkuk University.
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.
References
Fuller, V., Li, T., Yu, J., Varadhan, K.: Classless Inter-Domain Routing (CIDR): An Address Assignment and Aggregation Strategy. RFC1519 (1993)
Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network 15, 8–23 (2001)
Varghese, G.: Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann Pub., San Francisco (2005)
Pagiamtzis, K., Sheikholeslami, A.: Content-addressable memory (CAM) circuits and architectures: A tutorial and survey. IEEE Journal of Solid-State Circuits 41, 712–727 (2006)
Labovitz, C., Malan, G.R., Jahanian, F.: Internet Routing Instability. IEEE/ACM TON 6, 515–528 (1998)
Shah, D., Gupta, P.: Fast Updating Algorithms for TCAMs. IEEE Micro. 21, 36–47 (2001)
Wang, P., Chan, C., Chen, Y.: A Fast Table Update Scheme for High-Performance IP Forwarding. In: 8th ICPADS, pp. 592–600 (2001)
Pao, D., Li, Y.: Enabling Incremental Updates to LC-Trie for Efficient Management of IP Forwarding Tables. IEEE Communications Letters 7, 245–247 (2003)
Basu, A., Narlikar, G.J.: Fast Incremental Updates for Pipelined Forwarding Engines. In: IEEE INFOCOM (2003)
Wu, W., Shi, B., Wang, F.: Efficient location of free spaces in TCAM to improve router performance. IJCS 18, 363–371 (2005)
Kobayashi, M., Murase, T., Kuriyama, A.: A Longest Prefix Match Search Engine for Multi-Gigabit IP Processing. In: 2000 International Conf. on Communications, pp. 1360–1364. IEEE Press, New Orleans (2000)
Ng, E., Lee, G.: Eliminating Sorting in IP Lookup Devices using Partitioned Table. In: 16th IEEE International Conf. on Application-Specific Systems, Architecture and Processors (ASAP), pp. 119–126. IEEE Press, Greece (2005)
Liang, Z., Xu, K., Wu, J.: A Scalable Parallel Lookup Framework Avoiding Longest Prefix Match. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 616–625. Springer, Heidelberg (2004)
Sun, X., Sahni, S.K., Zhao, Y.Q.: Fast Update Algorithm for IP Forwarding Table Using Independent Sets. In: Mammeri, Z., Lorenz, P. (eds.) HSNMC 2004. LNCS, vol. 3079, pp. 324–335. Springer, Heidelberg (2004)
Chang, Y.-K., Lin, Y.-C.: Dynamic Routing Tables Using Simple Balanced Search Trees. In: Chong, I., Kawahara, K. (eds.) ICOIN 2006. LNCS, vol. 3961, pp. 389–398. Springer, Heidelberg (2006)
University of Oregon Route Views Project, http://www.routeviews.org/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, J., Kim, J. (2008). Scheduling of Updates in an IP Forwarding Engine with Partitioned Prefix Tables. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)