{"id":"https://openalex.org/W4387871104","doi":"https://doi.org/10.1109/icc45041.2023.10279235","title":"Jointly Optimal Routing and Caching with Bounded Link Capacities","display_name":"Jointly Optimal Routing and Caching with Bounded Link Capacities","publication_year":2023,"publication_date":"2023-05-28","ids":{"openalex":"https://openalex.org/W4387871104","doi":"https://doi.org/10.1109/icc45041.2023.10279235"},"language":"en","primary_location":{"id":"doi:10.1109/icc45041.2023.10279235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc45041.2023.10279235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2023 - IEEE International Conference on Communications","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/A5100384391","display_name":"Yuanyuan Li","orcid":"https://orcid.org/0000-0001-5889-0075"},"institutions":[{"id":"https://openalex.org/I87182695","display_name":"Universidad del Noreste","ror":"https://ror.org/02ahky613","country_code":"MX","type":"education","lineage":["https://openalex.org/I87182695"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Yuanyuan Li","raw_affiliation_strings":["Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I87182695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100649609","display_name":"Yuchao Zhang","orcid":"https://orcid.org/0000-0002-0135-8915"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]},{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["CN","GB"],"is_corresponding":false,"raw_author_name":"Yuchao Zhang","raw_affiliation_strings":["University of Cambridge","Beijing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"Beijing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049931304","display_name":"Stratis Ioannidis","orcid":"https://orcid.org/0000-0001-8355-4751"},"institutions":[{"id":"https://openalex.org/I87182695","display_name":"Universidad del Noreste","ror":"https://ror.org/02ahky613","country_code":"MX","type":"education","lineage":["https://openalex.org/I87182695"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Stratis Ioannidis","raw_affiliation_strings":["Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I87182695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062093738","display_name":"Jon Crowcroft","orcid":"https://orcid.org/0000-0002-7013-0121"},"institutions":[{"id":"https://openalex.org/I87182695","display_name":"Universidad del Noreste","ror":"https://ror.org/02ahky613","country_code":"MX","type":"education","lineage":["https://openalex.org/I87182695"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Jon Crowcroft","raw_affiliation_strings":["Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I87182695"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.444,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81190876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1130","last_page":"1136"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"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/T12038","display_name":"Covalent Organic Framework Applications","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.725692868232727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5988397002220154},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.597924530506134},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.5381816625595093},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5316194891929626},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5233649015426636},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5104042887687683},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4881933331489563},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.48032346367836},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43437623977661133},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4197826683521271},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2300589680671692},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21482697129249573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21001043915748596}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.725692868232727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5988397002220154},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.597924530506134},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.5381816625595093},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5316194891929626},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5233649015426636},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5104042887687683},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4881933331489563},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.48032346367836},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43437623977661133},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4197826683521271},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2300589680671692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21482697129249573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21001043915748596},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc45041.2023.10279235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc45041.2023.10279235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2023 - IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6014330289","display_name":null,"funder_award_id":"2019YFB1802603","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G6162837587","display_name":null,"funder_award_id":"62172054","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G777811099","display_name":"NeTS: Small: Caching Networks with Optimality Guarantees","funder_award_id":"1718355","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1551092876","https://openalex.org/W1972738071","https://openalex.org/W2000108799","https://openalex.org/W2027982384","https://openalex.org/W2030448197","https://openalex.org/W2083261812","https://openalex.org/W2128678576","https://openalex.org/W2138597123","https://openalex.org/W2566831443","https://openalex.org/W2601836945","https://openalex.org/W2807161440","https://openalex.org/W2952875946","https://openalex.org/W2964189474","https://openalex.org/W2967531314","https://openalex.org/W3009116850","https://openalex.org/W3016867234","https://openalex.org/W3024327082","https://openalex.org/W3047337089","https://openalex.org/W3133809140","https://openalex.org/W3153988350","https://openalex.org/W3195411805","https://openalex.org/W4294408192","https://openalex.org/W4297734155","https://openalex.org/W4387871104","https://openalex.org/W6680646936","https://openalex.org/W6718475064","https://openalex.org/W6743222942","https://openalex.org/W6776770148"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4313343266"],"abstract_inverted_index":{"We":[0,15,56],"study":[1],"a":[2,41,58],"cache":[3],"network":[4,33],"in":[5,64],"which":[6,65],"intermediate":[7],"nodes":[8],"equipped":[9],"with":[10,26],"caches":[11],"can":[12,37],"serve":[13],"requests.":[14],"model":[16],"the":[17,76],"problem":[18,36,47],"of":[19],"jointly":[20],"optimizing":[21],"caching":[22],"and":[23,53],"routing":[24],"decisions":[25],"link":[27],"capacity":[28],"constraints":[29],"over":[30],"an":[31],"arbitrary":[32],"topology.":[34],"This":[35],"be":[38],"formulated":[39],"as":[40],"continuous":[42,50],"diminishing-returns":[43],"(DR)":[44],"submodular":[45],"maximization":[46],"under":[48],"multiple":[49],"DR-supermodular":[51],"constraints,":[52],"is":[54],"NP-hard.":[55],"propose":[57],"poly-time":[59],"alternating":[60],"primal-dual":[61],"heuristic":[62],"algorithm,":[63],"primal":[66],"steps":[67],"produce":[68],"solutions":[69],"within":[70],"1":[71],"-":[72],"approximation":[73],"factor":[74],"from":[75],"optimal.":[77],"Through":[78],"extensive":[79],"experiments,":[80],"we":[81],"demonstrate":[82],"that":[83],"our":[84],"proposed":[85],"algorithm":[86],"significantly":[87],"out-performs":[88],"competitors.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}