A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter: A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter
Within the confines of access width and storage capacity in Ternary Content Addressable Memory (TCAM) chip, pattern matching algorithm using TCAM has low throughput and limited memory. This paper proposes BF-TCAM algorithm based on access compression by single byte coding using Bloom-Filter (BF) alg...
Gespeichert in:
| Veröffentlicht in: | Dian zi yu xin xi xue bao = Journal of electronics & information technology 2011-09, Vol.33 (9), p.2212-2218 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | chi |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2218 |
|---|---|
| container_issue | 9 |
| container_start_page | 2212 |
| container_title | Dian zi yu xin xi xue bao = Journal of electronics & information technology |
| container_volume | 33 |
| creator | Chen, Zheng-Hu Lan, Ju-Long Huang, Wan-Wei Li, Yu-Feng |
| description | Within the confines of access width and storage capacity in Ternary Content Addressable Memory (TCAM) chip, pattern matching algorithm using TCAM has low throughput and limited memory. This paper proposes BF-TCAM algorithm based on access compression by single byte coding using Bloom-Filter (BF) algorithm, increases the throughput and improves the utilization efficiency of storage space. BF algorithm will bring collision, which can be reduced by using vector memory instead of bit vector in BF-TCAM algorithm. The experimentation shows that the BF-TCAM algorithm proposed in this paper can improve the matching throughput and storage space utilization, and at the same time, effectively reduce the conflict ratio resulting from BF compression. |
| doi_str_mv | 10.3724/SP.J.1146.2011.00058 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_963858842</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>963858842</sourcerecordid><originalsourceid>FETCH-LOGICAL-c180t-aa1f6f500b8103bee3cc6ba6cca1a6887853f86c1262824391cd1fbd92490ecd3</originalsourceid><addsrcrecordid>eNp9kL1OwzAYRT2ARFX6BgzeYEnwZyeuM6YRP62KqNSW1XIcpxglcbFTJN6ehDIz3aurozschG6AxGxOk_vtJl7FAAmPKQGICSGpuEATICSLUpHxKzQL4WOYgVHOMzpBbzneFfkL3hr_ZbXBy8p0va2tVr11Hc6bg_O2f2_xQgVT4XHS2oSAC9ce_VBGah9sd8CLxrk2qm3TG3-NLmvVBDP7yynaPz7siudo_fq0LPJ1pEGQPlIKal6nhJQCCCuNYVrzUnGtFSguxFykrBZcA-VU0IRloCuoyyqjSUaMrtgU3Z5_j959nkzoZWuDNk2jOuNOQWaciVSIhA7k3b8kzAdJglJOBjQ5o9q7ELyp5dHbVvlvCUSOnuV2I1dy9CxHz_LXM_sBSCVx-Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1700982260</pqid></control><display><type>article</type><title>A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter: A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter</title><source>Alma/SFX Local Collection</source><creator>Chen, Zheng-Hu ; Lan, Ju-Long ; Huang, Wan-Wei ; Li, Yu-Feng</creator><creatorcontrib>Chen, Zheng-Hu ; Lan, Ju-Long ; Huang, Wan-Wei ; Li, Yu-Feng</creatorcontrib><description>Within the confines of access width and storage capacity in Ternary Content Addressable Memory (TCAM) chip, pattern matching algorithm using TCAM has low throughput and limited memory. This paper proposes BF-TCAM algorithm based on access compression by single byte coding using Bloom-Filter (BF) algorithm, increases the throughput and improves the utilization efficiency of storage space. BF algorithm will bring collision, which can be reduced by using vector memory instead of bit vector in BF-TCAM algorithm. The experimentation shows that the BF-TCAM algorithm proposed in this paper can improve the matching throughput and storage space utilization, and at the same time, effectively reduce the conflict ratio resulting from BF compression.</description><identifier>ISSN: 1009-5896</identifier><identifier>DOI: 10.3724/SP.J.1146.2011.00058</identifier><language>chi</language><subject>Algorithms ; Compressing ; Information systems ; Matching ; Mathematical analysis ; Storage capacity ; Utilization ; Vectors (mathematics)</subject><ispartof>Dian zi yu xin xi xue bao = Journal of electronics & information technology, 2011-09, Vol.33 (9), p.2212-2218</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c180t-aa1f6f500b8103bee3cc6ba6cca1a6887853f86c1262824391cd1fbd92490ecd3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Chen, Zheng-Hu</creatorcontrib><creatorcontrib>Lan, Ju-Long</creatorcontrib><creatorcontrib>Huang, Wan-Wei</creatorcontrib><creatorcontrib>Li, Yu-Feng</creatorcontrib><title>A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter: A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter</title><title>Dian zi yu xin xi xue bao = Journal of electronics & information technology</title><description>Within the confines of access width and storage capacity in Ternary Content Addressable Memory (TCAM) chip, pattern matching algorithm using TCAM has low throughput and limited memory. This paper proposes BF-TCAM algorithm based on access compression by single byte coding using Bloom-Filter (BF) algorithm, increases the throughput and improves the utilization efficiency of storage space. BF algorithm will bring collision, which can be reduced by using vector memory instead of bit vector in BF-TCAM algorithm. The experimentation shows that the BF-TCAM algorithm proposed in this paper can improve the matching throughput and storage space utilization, and at the same time, effectively reduce the conflict ratio resulting from BF compression.</description><subject>Algorithms</subject><subject>Compressing</subject><subject>Information systems</subject><subject>Matching</subject><subject>Mathematical analysis</subject><subject>Storage capacity</subject><subject>Utilization</subject><subject>Vectors (mathematics)</subject><issn>1009-5896</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kL1OwzAYRT2ARFX6BgzeYEnwZyeuM6YRP62KqNSW1XIcpxglcbFTJN6ehDIz3aurozschG6AxGxOk_vtJl7FAAmPKQGICSGpuEATICSLUpHxKzQL4WOYgVHOMzpBbzneFfkL3hr_ZbXBy8p0va2tVr11Hc6bg_O2f2_xQgVT4XHS2oSAC9ce_VBGah9sd8CLxrk2qm3TG3-NLmvVBDP7yynaPz7siudo_fq0LPJ1pEGQPlIKal6nhJQCCCuNYVrzUnGtFSguxFykrBZcA-VU0IRloCuoyyqjSUaMrtgU3Z5_j959nkzoZWuDNk2jOuNOQWaciVSIhA7k3b8kzAdJglJOBjQ5o9q7ELyp5dHbVvlvCUSOnuV2I1dy9CxHz_LXM_sBSCVx-Q</recordid><startdate>201109</startdate><enddate>201109</enddate><creator>Chen, Zheng-Hu</creator><creator>Lan, Ju-Long</creator><creator>Huang, Wan-Wei</creator><creator>Li, Yu-Feng</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201109</creationdate><title>A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter</title><author>Chen, Zheng-Hu ; Lan, Ju-Long ; Huang, Wan-Wei ; Li, Yu-Feng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c180t-aa1f6f500b8103bee3cc6ba6cca1a6887853f86c1262824391cd1fbd92490ecd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Compressing</topic><topic>Information systems</topic><topic>Matching</topic><topic>Mathematical analysis</topic><topic>Storage capacity</topic><topic>Utilization</topic><topic>Vectors (mathematics)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Zheng-Hu</creatorcontrib><creatorcontrib>Lan, Ju-Long</creatorcontrib><creatorcontrib>Huang, Wan-Wei</creatorcontrib><creatorcontrib>Li, Yu-Feng</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Dian zi yu xin xi xue bao = Journal of electronics & information technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Zheng-Hu</au><au>Lan, Ju-Long</au><au>Huang, Wan-Wei</au><au>Li, Yu-Feng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter: A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter</atitle><jtitle>Dian zi yu xin xi xue bao = Journal of electronics & information technology</jtitle><date>2011-09</date><risdate>2011</risdate><volume>33</volume><issue>9</issue><spage>2212</spage><epage>2218</epage><pages>2212-2218</pages><issn>1009-5896</issn><abstract>Within the confines of access width and storage capacity in Ternary Content Addressable Memory (TCAM) chip, pattern matching algorithm using TCAM has low throughput and limited memory. This paper proposes BF-TCAM algorithm based on access compression by single byte coding using Bloom-Filter (BF) algorithm, increases the throughput and improves the utilization efficiency of storage space. BF algorithm will bring collision, which can be reduced by using vector memory instead of bit vector in BF-TCAM algorithm. The experimentation shows that the BF-TCAM algorithm proposed in this paper can improve the matching throughput and storage space utilization, and at the same time, effectively reduce the conflict ratio resulting from BF compression.</abstract><doi>10.3724/SP.J.1146.2011.00058</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1009-5896 |
| ispartof | Dian zi yu xin xi xue bao = Journal of electronics & information technology, 2011-09, Vol.33 (9), p.2212-2218 |
| issn | 1009-5896 |
| language | chi |
| recordid | cdi_proquest_miscellaneous_963858842 |
| source | Alma/SFX Local Collection |
| subjects | Algorithms Compressing Information systems Matching Mathematical analysis Storage capacity Utilization Vectors (mathematics) |
| title | A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter: A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T16%3A08%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20TCAM%20Service%20Identification%20Algorithm%20Based%20on%20Access%20Compression%20Using%20Bloom-filter:%20A%20TCAM%20Service%20Identification%20Algorithm%20Based%20on%20Access%20Compression%20Using%20Bloom-filter&rft.jtitle=Dian%20zi%20yu%20xin%20xi%20xue%20bao%20=%20Journal%20of%20electronics%20&%20information%20technology&rft.au=Chen,%20Zheng-Hu&rft.date=2011-09&rft.volume=33&rft.issue=9&rft.spage=2212&rft.epage=2218&rft.pages=2212-2218&rft.issn=1009-5896&rft_id=info:doi/10.3724/SP.J.1146.2011.00058&rft_dat=%3Cproquest_cross%3E963858842%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1700982260&rft_id=info:pmid/&rfr_iscdi=true |