{"id":"https://openalex.org/W2164905748","doi":"https://doi.org/10.1145/1851182.1851208","title":"EffiCuts","display_name":"EffiCuts","publication_year":2010,"publication_date":"2010-08-30","ids":{"openalex":"https://openalex.org/W2164905748","doi":"https://doi.org/10.1145/1851182.1851208","mag":"2164905748"},"language":"en","primary_location":{"id":"doi:10.1145/1851182.1851208","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1851182.1851208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGCOMM 2010 conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003246454","display_name":"Balajee Vamanan","orcid":"https://orcid.org/0000-0002-7581-6624"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balajee Vamanan","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033812794","display_name":"Gwendolyn Voskuilen","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gwendolyn Voskuilen","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103145581","display_name":"T. N. Vijaykumar","orcid":"https://orcid.org/0000-0001-6624-4372"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. N. Vijaykumar","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":8.6058,"has_fulltext":false,"cited_by_count":168,"citation_normalized_percentile":{"value":0.98001487,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9316999912261963,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7081838250160217},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6684724688529968},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.613007128238678},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.5342096090316772},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.46487095952033997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3892247974872589},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38692834973335266},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29806360602378845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19918292760849},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.15205731987953186}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7081838250160217},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6684724688529968},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.613007128238678},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.5342096090316772},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.46487095952033997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3892247974872589},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38692834973335266},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29806360602378845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19918292760849},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.15205731987953186},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1851182.1851208","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1851182.1851208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGCOMM 2010 conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2022106793","https://openalex.org/W2062652918","https://openalex.org/W2063773589","https://openalex.org/W2077688755","https://openalex.org/W2094051614","https://openalex.org/W2108084305","https://openalex.org/W2115278163","https://openalex.org/W2139587756","https://openalex.org/W2139751271","https://openalex.org/W2143377393","https://openalex.org/W2150702922","https://openalex.org/W2153246888","https://openalex.org/W2155771881","https://openalex.org/W2157085439","https://openalex.org/W2168626603","https://openalex.org/W2169553922","https://openalex.org/W2464177207","https://openalex.org/W3139942419"],"related_works":["https://openalex.org/W48124421","https://openalex.org/W2293223786","https://openalex.org/W2120739134","https://openalex.org/W2184426101","https://openalex.org/W2951478555","https://openalex.org/W2181425632","https://openalex.org/W2952782208","https://openalex.org/W1488047477","https://openalex.org/W4300506559","https://openalex.org/W2100562604"],"abstract_inverted_index":{"Packet":[0],"Classification":[1],"is":[2],"a":[3,23,43,71,99,130,151,221,235,260],"key":[4],"functionality":[5],"provided":[6],"by":[7],"modern":[8],"routers.":[9],"Previous":[10],"decision-tree":[11],"algorithms,":[12],"HiCuts":[13,253],"and":[14,46,118,125,254,262,282],"HyperCuts,":[15,255],"cut":[16,163],"the":[17,29,47,55,61,66,77,83,88,139,167,174,186,226,232,240],"multi-dimensional":[18],"rule":[19],"space":[20],"to":[21,36,64,134,165,172],"separate":[22,122,166,173],"classifier's":[24,72],"rules.":[25,68,101,127],"Despite":[26],"their":[27],"optimizations,":[28],"algorithms":[30],"incur":[31],"considerable":[32],"memory":[33,279],"overhead":[34,238],"due":[35],"two":[37],"issues:":[38],"(1)":[39,110],"Many":[40],"rules":[41,49,63,133,140,176,200,223],"in":[42,52,92,146,207,239],"classifier":[44],"overlap":[45,115],"overlapping":[48],"vary":[50],"vastly":[51],"size,":[53],"causing":[54],"algorithms'":[56,78],"fine":[57],"cuts":[58,80,218],"for":[59,81,154,270],"separating":[60,82],"small":[62,117,124,143,175,204,236],"replicate":[65],"large":[67,119,126,145,168,206],"(2)":[69,180],"Because":[70],"rule-space":[73],"density":[74],"varies":[75],"significantly,":[76],"equi-sized":[79],"dense":[84],"parts":[85,258],"needlessly":[86],"partition":[87],"sparse":[89],"parts,":[90],"resulting":[91],"many":[93],"ineffectual":[94,229],"nodes":[95,230],"that":[96,201,269],"hold":[97],"only":[98],"few":[100],"We":[102,128,149,215],"propose":[103],"EffiCuts":[104,273],"which":[105,191,219],"employs":[106],"four":[107],"novel":[108],"ideas:":[109],"Separable":[111],"trees:":[112],"To":[113,184,246],"eliminate":[114],"among":[116,225],"rules,":[120,169],"we":[121,194,256,267],"all":[123,138],"define":[129],"subset":[131,157],"of":[132,234,259,276,283],"be":[135,162,203],"separable":[136,197],"if":[137],"are":[141],"either":[142],"or":[144,170,205],"each":[147,155,159],"dimension.":[148,211],"build":[150],"distinct":[152],"tree":[153,182,241],"such":[156],"where":[158],"dimension":[160],"can":[161],"coarsely":[164],"finely":[171],"without":[177],"incurring":[178],"replication.":[179],"Selective":[181],"merging:":[183],"reduce":[185],"multiple":[187],"trees'":[188],"extra":[189],"accesses":[190,249],"degrade":[192],"throughput,":[193],"selectively":[195],"merge":[196],"trees":[198],"mixing":[199],"may":[202],"at":[208,231],"most":[209],"one":[210],"(3)":[212],"Equi-dense":[213],"cuts:":[214],"employ":[216],"unequal":[217],"distribute":[220],"node's":[222],"evenly":[224],"children,":[227],"avoiding":[228],"cost":[233],"processing":[237],"traversal.":[242],"(4)":[243],"Node":[244],"Co-location:":[245],"achieve":[247],"fewer":[248],"per":[250],"node":[251,261],"than":[252,280,287],"co-locate":[257],"its":[263],"children.":[264],"Using":[265],"ClassBench,":[266],"show":[268],"similar":[271],"throughput":[272],"needs":[274],"factors":[275],"57":[277],"less":[278,285],"HyperCuts":[281],"4-8":[284],"power":[286],"TCAM.":[288]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":10}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2016-06-24T00:00:00"}