{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_827"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_827","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"TCAM reduction techniques for all-match classifiers","abstract":"Network intrusion detection systems require all-match packet classication, where all rules matching a packet are reported by the system. The problem of eciently reporting all matching rules is known as the all-match optimization problem. One solution is to convert an all-match classier into a first-match classier (in which only the rst classier rule that matches a packet is reported), and use ternary content addressable memory (TCAM) forpacket classication.In this thesis, we evaluate two classier minimization approaches. First, we consider the use of all-match classier-specic optimization algorithms. Second, we use state-of-the-art first-match classier optimization algorithms in conjunction with all-match algorithms. Our results indicate the appropriate approach is related to the number of TCAM chips available for classication. When using one TCAM chip, we attain 70.85% TCAM space savings using rst-match classier optimization algorithms instead of all-match classier optimization algorithms. When using multiple TCAM chips, we found that it is best to use all-match specic optimization algorithms.","abstract_html":"Network intrusion detection systems require all-match packet classication, where all rules matching a packet are reported by the system. The problem of eciently reporting all matching rules is known as the all-match optimization problem. One solution is to convert an all-match classier into a first-match classier (in which only the rst classier rule that matches a packet is reported), and use ternary content addressable memory (TCAM) forpacket classication.In this thesis, we evaluate two classier minimization approaches. First, we consider the use of all-match classier-specic optimization algorithms. Second, we use state-of-the-art first-match classier optimization algorithms in conjunction with all-match algorithms. Our results indicate the appropriate approach is related to the number of TCAM chips available for classication. When using one TCAM chip, we attain 70.85% TCAM space savings using rst-match classier optimization algorithms instead of all-match classier optimization algorithms. When using multiple TCAM chips, we found that it is best to use all-match specic optimization algorithms.","abstract_has_math":false,"creators":["Wender, Nicholas Jon"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Torng, Eric","Liu, Alex","Esfahanian, Abdol"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012","date_published":"2012","updated_at":"2026-11-18T19:01:35Z","subjects":["Algorithms","Computer science--Research"],"languages":["English"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:827","isbn:9781267308092","isbn:1267308095","oclc:931869222","umi:1509497","local:Wender_grad.msu_0128N_11176"],"render_values":[{"text":"etd:827","href":null,"code":true},{"text":"isbn:9781267308092","href":null,"code":true},{"text":"isbn:1267308095","href":null,"code":true},{"text":"oclc:931869222","href":null,"code":true},{"text":"umi:1509497","href":null,"code":true},{"text":"local:Wender_grad.msu_0128N_11176","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/3bs3-4z14","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/3bs3-4z14","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_827","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Torng, Eric","Liu, Alex","Esfahanian, Abdol"]},{"key":"dc:creator","label":"Author","values":["Wender, Nicholas Jon"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Text","Theses"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Algorithms","Computer science--Research"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:827","isbn:9781267308092","isbn:1267308095","oclc:931869222","umi:1509497","local:Wender_grad.msu_0128N_11176","https://doi.org/doi:10.25335/3bs3-4z14"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Network intrusion detection systems require all-match packet classication, where all rules matching a packet are reported by the system. The problem of eciently reporting all matching rules is known as the all-match optimization problem. One solution is to convert an all-match classier into a first-match classier (in which only the rst classier rule that matches a packet is reported), and use ternary content addressable memory (TCAM) forpacket classication.In this thesis, we evaluate two classier minimization approaches. First, we consider the use of all-match classier-specic optimization algorithms. Second, we use state-of-the-art first-match classier optimization algorithms in conjunction with all-match algorithms. Our results indicate the appropriate approach is related to the number of TCAM chips available for classication. When using one TCAM chip, we attain 70.85% TCAM space savings using rst-match classier optimization algorithms instead of all-match classier optimization algorithms. When using multiple TCAM chips, we found that it is best to use all-match specic optimization algorithms.","Thesis (M.S.)--Michigan State University. Computer Science, 2012","Includes bibliographical references (pages 42-43)"]},{"key":"dc:format","label":"Dc Format","values":["vii, 43 pages","application/pdf"]},{"key":"dc:title","label":"Title","values":["TCAM reduction techniques for all-match classifiers"]}]}],"canonical_facts":{"dc:contributor":["Torng, Eric","Liu, Alex","Esfahanian, Abdol"],"dc:creator":["Wender, Nicholas Jon"],"dc:date":["2012"],"dc:description":["Network intrusion detection systems require all-match packet classication, where all rules matching a packet are reported by the system. The problem of eciently reporting all matching rules is known as the all-match optimization problem. One solution is to convert an all-match classier into a first-match classier (in which only the rst classier rule that matches a packet is reported), and use ternary content addressable memory (TCAM) forpacket classication.In this thesis, we evaluate two classier minimization approaches. First, we consider the use of all-match classier-specic optimization algorithms. Second, we use state-of-the-art first-match classier optimization algorithms in conjunction with all-match algorithms. Our results indicate the appropriate approach is related to the number of TCAM chips available for classication. When using one TCAM chip, we attain 70.85% TCAM space savings using rst-match classier optimization algorithms instead of all-match classier optimization algorithms. When using multiple TCAM chips, we found that it is best to use all-match specic optimization algorithms.","Thesis (M.S.)--Michigan State University. Computer Science, 2012","Includes bibliographical references (pages 42-43)"],"dc:format":["vii, 43 pages","application/pdf"],"dc:identifier":["etd:827","isbn:9781267308092","isbn:1267308095","oclc:931869222","umi:1509497","local:Wender_grad.msu_0128N_11176","https://doi.org/doi:10.25335/3bs3-4z14"],"dc:language":["English"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Algorithms","Computer science--Research"],"dc:title":["TCAM reduction techniques for all-match classifiers"],"dc:type":["Text","Theses"]},"updated_at":"2026-11-18T19:01:35Z"}