Longest Prefix Match Scheme
A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap sche...
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | LEICHTY PHILIP LYNN KO KUNG LING MADDURY MAHESH SRINIVASA LIU JIAN LIM HOW TUNG TERRY JOHN MICHAEL CHEUNG WING |
| description | A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap scheme enables each EXM engine to cover entries having prefix lengths of L, L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2013031077A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2013031077A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2013031077A13</originalsourceid><addsrcrecordid>eNrjZJD2yc9LTy0uUQgoSk3LrFDwTSxJzlAITs5IzU3lYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBobGBsaGBubmjobGxKkCANR4I9I</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Longest Prefix Match Scheme</title><source>esp@cenet</source><creator>LEICHTY PHILIP LYNN ; KO KUNG LING ; MADDURY MAHESH SRINIVASA ; LIU JIAN ; LIM HOW TUNG ; TERRY JOHN MICHAEL ; CHEUNG WING</creator><creatorcontrib>LEICHTY PHILIP LYNN ; KO KUNG LING ; MADDURY MAHESH SRINIVASA ; LIU JIAN ; LIM HOW TUNG ; TERRY JOHN MICHAEL ; CHEUNG WING</creatorcontrib><description>A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap scheme enables each EXM engine to cover entries having prefix lengths of L, L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2013</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20130131&DB=EPODOC&CC=US&NR=2013031077A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20130131&DB=EPODOC&CC=US&NR=2013031077A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LEICHTY PHILIP LYNN</creatorcontrib><creatorcontrib>KO KUNG LING</creatorcontrib><creatorcontrib>MADDURY MAHESH SRINIVASA</creatorcontrib><creatorcontrib>LIU JIAN</creatorcontrib><creatorcontrib>LIM HOW TUNG</creatorcontrib><creatorcontrib>TERRY JOHN MICHAEL</creatorcontrib><creatorcontrib>CHEUNG WING</creatorcontrib><title>Longest Prefix Match Scheme</title><description>A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap scheme enables each EXM engine to cover entries having prefix lengths of L, L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2013</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZJD2yc9LTy0uUQgoSk3LrFDwTSxJzlAITs5IzU3lYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBobGBsaGBubmjobGxKkCANR4I9I</recordid><startdate>20130131</startdate><enddate>20130131</enddate><creator>LEICHTY PHILIP LYNN</creator><creator>KO KUNG LING</creator><creator>MADDURY MAHESH SRINIVASA</creator><creator>LIU JIAN</creator><creator>LIM HOW TUNG</creator><creator>TERRY JOHN MICHAEL</creator><creator>CHEUNG WING</creator><scope>EVB</scope></search><sort><creationdate>20130131</creationdate><title>Longest Prefix Match Scheme</title><author>LEICHTY PHILIP LYNN ; KO KUNG LING ; MADDURY MAHESH SRINIVASA ; LIU JIAN ; LIM HOW TUNG ; TERRY JOHN MICHAEL ; CHEUNG WING</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2013031077A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2013</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>LEICHTY PHILIP LYNN</creatorcontrib><creatorcontrib>KO KUNG LING</creatorcontrib><creatorcontrib>MADDURY MAHESH SRINIVASA</creatorcontrib><creatorcontrib>LIU JIAN</creatorcontrib><creatorcontrib>LIM HOW TUNG</creatorcontrib><creatorcontrib>TERRY JOHN MICHAEL</creatorcontrib><creatorcontrib>CHEUNG WING</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LEICHTY PHILIP LYNN</au><au>KO KUNG LING</au><au>MADDURY MAHESH SRINIVASA</au><au>LIU JIAN</au><au>LIM HOW TUNG</au><au>TERRY JOHN MICHAEL</au><au>CHEUNG WING</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Longest Prefix Match Scheme</title><date>2013-01-31</date><risdate>2013</risdate><abstract>A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap scheme enables each EXM engine to cover entries having prefix lengths of L, L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2013031077A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC COMMUNICATION TECHNIQUE ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
| title | Longest Prefix Match Scheme |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T06%3A37%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=LEICHTY%20PHILIP%20LYNN&rft.date=2013-01-31&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2013031077A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |