{"id":"https://openalex.org/W3160605758","doi":"https://doi.org/10.1109/icassp39728.2021.9413706","title":"Data-Driven Adaptive Network Resource Slicing for Multi-Tenant Networks","display_name":"Data-Driven Adaptive Network Resource Slicing for Multi-Tenant Networks","publication_year":2021,"publication_date":"2021-05-13","ids":{"openalex":"https://openalex.org/W3160605758","doi":"https://doi.org/10.1109/icassp39728.2021.9413706","mag":"3160605758"},"language":"en","primary_location":{"id":"doi:10.1109/icassp39728.2021.9413706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp39728.2021.9413706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5012518133","display_name":"Navid Reyhanian","orcid":"https://orcid.org/0000-0002-2653-943X"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Navid Reyhanian","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Twin Cities, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Twin Cities, MN, USA","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028318474","display_name":"Hamid Farmanbar","orcid":"https://orcid.org/0000-0001-7967-6553"},"institutions":[{"id":"https://openalex.org/I4210115038","display_name":"Huawei Technologies (Canada)","ror":"https://ror.org/026venb53","country_code":"CA","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210115038"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hamid Farmanbar","raw_affiliation_strings":["Huawei Canada Research Center, Ottawa, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huawei Canada Research Center, Ottawa, Canada","institution_ids":["https://openalex.org/I4210115038"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101766226","display_name":"Zhi\u2010Quan Luo","orcid":"https://orcid.org/0000-0003-3995-914X"},"institutions":[{"id":"https://openalex.org/I4210099586","display_name":"Shenzhen Research Institute of Big Data","ror":"https://ror.org/00z1gwf89","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210099586"]},{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhi-Quan Luo","raw_affiliation_strings":["Shenzhen Research Institute of Big Data, The Chinese University of Hong Kong, Shenzhen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shenzhen Research Institute of Big Data, The Chinese University of Hong Kong, Shenzhen, China","institution_ids":["https://openalex.org/I4210099586","https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3565,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77381193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"55","issue":null,"first_page":"4715","last_page":"4719"},"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.9997000098228455,"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.9997000098228455,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8386602997779846},{"id":"https://openalex.org/keywords/slicing","display_name":"Slicing","score":0.6403066515922546},{"id":"https://openalex.org/keywords/backhaul","display_name":"Backhaul (telecommunications)","score":0.5757645964622498},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5309459567070007},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5228897929191589},{"id":"https://openalex.org/keywords/multitenancy","display_name":"Multitenancy","score":0.5221983790397644},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.48277297616004944},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.44991207122802734},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41257408261299133},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3470746874809265},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.23500826954841614},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.17145425081253052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1706630289554596}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8386602997779846},{"id":"https://openalex.org/C2776190703","wikidata":"https://www.wikidata.org/wiki/Q488148","display_name":"Slicing","level":2,"score":0.6403066515922546},{"id":"https://openalex.org/C103760667","wikidata":"https://www.wikidata.org/wiki/Q798444","display_name":"Backhaul (telecommunications)","level":3,"score":0.5757645964622498},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5309459567070007},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5228897929191589},{"id":"https://openalex.org/C69016650","wikidata":"https://www.wikidata.org/wiki/Q1364211","display_name":"Multitenancy","level":5,"score":0.5221983790397644},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.48277297616004944},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.44991207122802734},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41257408261299133},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3470746874809265},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.23500826954841614},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.17145425081253052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1706630289554596},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C175133352","wikidata":"https://www.wikidata.org/wiki/Q1254596","display_name":"Software as a service","level":4,"score":0.0},{"id":"https://openalex.org/C529173508","wikidata":"https://www.wikidata.org/wiki/Q638608","display_name":"Software development","level":3,"score":0.0},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp39728.2021.9413706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp39728.2021.9413706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W2050968963","https://openalex.org/W2107861471","https://openalex.org/W2142717204","https://openalex.org/W2148058923","https://openalex.org/W2162436073","https://openalex.org/W2181468422","https://openalex.org/W2187760791","https://openalex.org/W2210084516","https://openalex.org/W2489133234","https://openalex.org/W2496609900","https://openalex.org/W2573590785","https://openalex.org/W2605961225","https://openalex.org/W2754368137","https://openalex.org/W2891148312","https://openalex.org/W2911345821","https://openalex.org/W2911562155","https://openalex.org/W2911820391","https://openalex.org/W2918735386","https://openalex.org/W2945492819","https://openalex.org/W2950926719","https://openalex.org/W3005680381","https://openalex.org/W3008924942","https://openalex.org/W3015590302","https://openalex.org/W3028194223","https://openalex.org/W3047421624","https://openalex.org/W3172944283","https://openalex.org/W4250589301","https://openalex.org/W4253383968","https://openalex.org/W6781218682","https://openalex.org/W6796874483"],"related_works":["https://openalex.org/W3137235196","https://openalex.org/W2805570840","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4382725876","https://openalex.org/W2084892497","https://openalex.org/W2115614142","https://openalex.org/W4320477335","https://openalex.org/W1561889708"],"abstract_inverted_index":{"Network":[0,43],"slicing":[1,26],"to":[2,50,89,109,122],"support":[3],"multi-tenancy":[4],"plays":[5],"a":[6,21,77,85,129],"key":[7],"role":[8],"in":[9,37],"improving":[10],"the":[11,28,32,38,51,59,70,80,96,113,135,145,149],"performance":[12],"of":[13,30,35,61,76,99,131,134,148],"5G":[14],"networks.":[15],"In":[16],"this":[17,124],"paper,":[18],"we":[19,46,83],"propose":[20],"novel":[22],"framework":[23],"for":[24,92],"network":[25,93],"with":[27,95],"goal":[29],"maximizing":[31],"expected":[33,71],"utilities":[34],"tenants":[36],"backhaul":[39],"and":[40,55,66,68,79,107,117],"Radio":[41],"Access":[42],"(RAN),":[44],"where":[45],"reconfigure":[47,90],"slices":[48,94],"according":[49],"time-varying":[52],"user":[53],"traffic":[54],"channel":[56],"states.":[57],"Upon":[58],"arrival":[60],"new":[62],"statistics":[63],"from":[64,73],"users":[65,75],"channels":[67],"considering":[69],"utility":[72],"serving":[74],"slice":[78],"reconfiguration":[81],"cost,":[82],"formulate":[84],"sparse":[86],"optimization":[87,104],"problem":[88,125],"resources":[91],"maximum":[97],"isolation":[98],"reserved":[100],"resources.":[101],"The":[102],"formulated":[103],"is":[105],"non-convex":[106],"difficult":[108],"solve.":[110],"We":[111],"use":[112],"group":[114],"LASSO":[115],"regularization":[116],"successive":[118],"upper-bound":[119],"minimization":[120],"techniques":[121],"solve":[123],"by":[126],"iteratively":[127],"solving":[128],"sequence":[130],"convex":[132],"approximations":[133],"original":[136],"problem.":[137],"Simulation":[138],"results":[139],"verify":[140],"that":[141],"our":[142],"approach":[143],"outperforms":[144],"existing":[146],"state":[147],"art":[150],"method.":[151]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}