Abstract
Network Routers find most defined path for an arriving packet by the destination address in the packet using longest prefix matching (LPM) with Routing table entries. In this paper we propose a new Ternary Content Addressable Memory (TCAM) based system architecture for the LPM problem in routers. The proposed architecture eliminates sorting of table entries during table update [1][2]. It also eliminates the priority encoder needed to find the longest prefix match in conventional techniques .This has advantage in large capacity routing tables as proposed technique uses a priority encoder only of size equal to the number of bits in destination address to find the longest prefix length. To implement the proposed method for LPM, TCAM cell is modified by including two control transistors which control connection of cell either with Bit Match Line (BML) or with Word Match Line (WML). Functionality of modified cell is verified by simulating 32-bit TCAM word in UMC 180 nm technology in Spectre. Difference in search cycle time has been observed to be comparable to the conventional TCAM. The proposed technique completely reduces the LPM problem to only three search cycles in proposed TCAM memory architecture. As in recent times router table update rate has increased along with its capacity, proposed architecture is expected to be advantageous over conventional in large capacity and high update rate routing tables, due to elimination of sorting [2] and storage of any extra information on new entry [3].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pagiamtzis, K., Sheikholeslami, A.: Content-addressable memory (cam) circuits and architectures: A tutorial and survey. IEEE Journal of Solid State Circuits 41 (2006)
Panigrahy, R., Sharma, S.: Sorting and searching using ternary cams. IEEE Micro 23, 44–53 (2003)
Kasnavi, S., Vincent, P., Gaudet, C., Amaral, J.N.: A hardware based longest prefix matching scheme for tcams. In: IEEE International Symposium on Circuits and Systems, ISCAS 2005, vol. 4, pp. 3339–3342 (2005)
Nakanishi, M., Ogura, T.: Real-time cam-based hough transform and its performance evaluation. Machine Vision Appl. 12, 59–68 (2004)
Komoto, T.H.E., Nakamura, T.: A high speed and compact size jpeg huffman decoder using cam. In: VLSI Circuit Design Technology Symposium, pp. 37–38 (1993)
Wei, B., Tarver, R., Kim, J., Ng, K.: A single chip lampel-ziv data compressor. In: Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), vol. 3, pp. 1953–1955 (1993)
McAuley, A.J., Francis, P.: Fast routing table lookup using cams. In: Proc. IEEE INFOCOM, vol. 3 (1993)
Huang, J.L.N.F., Chen, W.E., Chen, J.: Design of multi-field ipv6 packet classifiers using tcams. In: Proc. IEEE GLOBECOM, vol. 3 (2001)
Chao, H.: Next generation routers. Proc. IEEE 90 (September 2002)
Nourani, M., Vijayasarathi, D.S.: A reconfigurable cam architecture for network search engines. In: International Conference on Computer Design, ICCD 2006, pp. 82–87 (October 2007)
Syed Iftekhar Ali, M.: A high speed and low-power ternary cam design using match-line segmentation an feedback in sense amplifiers. In: Proc. of 13th International Conference on Computer and Information Technology (2010)
Mishra, T., Sahni, S.: Petcam- a power efficient tcam for forwarding tables. In: IEEE Symposium on Computers and Communications, ISCC 2009, pp. 224–229 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Govindaraj, R., Sengupta, I., Chattopadhyay, S. (2012). An Efficient Technique for Longest Prefix Matching in Network Routers. In: Rahaman, H., Chattopadhyay, S., Chattopadhyay, S. (eds) Progress in VLSI Design and Test. Lecture Notes in Computer Science, vol 7373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31494-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-31494-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31493-3
Online ISBN: 978-3-642-31494-0
eBook Packages: Computer ScienceComputer Science (R0)