{"id":"https://openalex.org/W2584116668","doi":"https://doi.org/10.1109/glocom.2016.7841861","title":"Global Optimization for Hash-Based Splitting","display_name":"Global Optimization for Hash-Based Splitting","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2584116668","doi":"https://doi.org/10.1109/glocom.2016.7841861","mag":"2584116668"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2016.7841861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2016.7841861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Global Communications Conference (GLOBECOM)","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/A5081881036","display_name":"Paolo Medagliani","orcid":"https://orcid.org/0000-0001-8520-3664"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Paolo Medagliani","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045586541","display_name":"J\u00e9r\u00e9mie Leguay","orcid":"https://orcid.org/0000-0002-4670-6389"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jeremie Leguay","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113875662","display_name":"Mohammed Abdullah","orcid":null},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohammed Abdullah","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015149788","display_name":"Mathieu Leconte","orcid":null},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Leconte","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106687466","display_name":"Stefano Paris","orcid":"https://orcid.org/0000-0002-1771-9033"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Stefano Paris","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., Boulogne-Billancourt, France","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5081881036"],"corresponding_institution_ids":["https://openalex.org/I4210123571"],"apc_list":null,"apc_paid":null,"fwci":0.8686,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.79181411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9994000196456909,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7536642551422119},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6623740792274475},{"id":"https://openalex.org/keywords/content-addressable-memory","display_name":"Content-addressable memory","score":0.5427312254905701},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5038625597953796},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46518009901046753},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4464612603187561},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.44125819206237793},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.43024250864982605},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4223291873931885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41473519802093506},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3389321565628052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3156197667121887},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21237686276435852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16928404569625854}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7536642551422119},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6623740792274475},{"id":"https://openalex.org/C53442348","wikidata":"https://www.wikidata.org/wiki/Q745101","display_name":"Content-addressable memory","level":3,"score":0.5427312254905701},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5038625597953796},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46518009901046753},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4464612603187561},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.44125819206237793},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.43024250864982605},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4223291873931885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41473519802093506},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3389321565628052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3156197667121887},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21237686276435852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16928404569625854},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2016.7841861","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2016.7841861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1978175770","https://openalex.org/W2022368378","https://openalex.org/W2079300367","https://openalex.org/W2079897489","https://openalex.org/W2087178199","https://openalex.org/W2103110737","https://openalex.org/W2147118406","https://openalex.org/W2232720325","https://openalex.org/W2263821018","https://openalex.org/W2264766172","https://openalex.org/W2271171620","https://openalex.org/W2545078974","https://openalex.org/W3145128584","https://openalex.org/W4232492804","https://openalex.org/W4237445262","https://openalex.org/W4241051765","https://openalex.org/W4246219036","https://openalex.org/W4253200893","https://openalex.org/W6729409162"],"related_works":["https://openalex.org/W4281971614","https://openalex.org/W2390933768","https://openalex.org/W2467236363","https://openalex.org/W3175260668","https://openalex.org/W2953259538","https://openalex.org/W3122721839","https://openalex.org/W2184455175","https://openalex.org/W2292909562","https://openalex.org/W4247716783","https://openalex.org/W2132957413"],"abstract_inverted_index":{"Load-balancing":[0],"and":[1],"network":[2,115],"optimization":[3],"in":[4,23,45,85,113,151],"SDN":[5],"networks":[6],"require":[7],"efficient":[8,54],"flow":[9,18,66,78,102],"splitting":[10,19,103],"during":[11],"the":[12,28,36,42,65,75,81,107,114,118,124,128,133,148],"path":[13],"computation":[14],"phase.":[15],"The":[16],"way":[17],"is":[20,25,83,135],"typically":[21],"implemented":[22],"switches":[24],"to":[26,41,87,117],"map":[27],"output":[29],"of":[30,38,77,93,110,147,155],"an":[31],"hash":[32],"function":[33],"computed":[34],"on":[35],"headers":[37],"incoming":[39],"flows":[40],"content":[43],"stored":[44],"a":[46,52,59,72,90,101,152],"Ternary":[47],"Content":[48],"Addressable":[49],"Memory":[50],"(TCAM),":[51],"very":[53],"but":[55],"scarce":[56],"resource.":[57],"Although":[58,132],"large":[60],"TCAM":[61,94,119],"budget":[62],"means":[63],"that":[64,105,141],"distribution":[67,76],"can":[68,143],"more":[69],"accurately":[70],"model":[71],"fractional":[73],"ideal,":[74],"volume":[79],"amongst":[80],"paths":[82],"constrained":[84],"reality":[86],"use":[88],"only":[89],"limited":[91],"number":[92,109],"rows.":[95],"In":[96],"this":[97],"paper,":[98],"we":[99,137,142],"present":[100],"algorithm":[104],"maximizes":[106],"total":[108,129],"demands":[111],"allocated":[112],"according":[116],"size":[120],"constraints":[121],"and,":[122],"at":[123],"same":[125],"time,":[126],"minimize":[127],"routing":[130],"cost.":[131],"problem":[134],"NP-hard,":[136],"show":[138],"through":[139],"simulations":[140],"achieve":[144],"good":[145],"approximations":[146],"optimal":[149],"solution":[150],"reasonable":[153],"amount":[154],"time.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
