{"id":"https://openalex.org/W2903529520","doi":"https://doi.org/10.1145/3323679.3326502","title":"Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication","display_name":"Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication","publication_year":2019,"publication_date":"2019-06-04","ids":{"openalex":"https://openalex.org/W2903529520","doi":"https://doi.org/10.1145/3323679.3326502","mag":"2903529520"},"language":"en","primary_location":{"id":"doi:10.1145/3323679.3326502","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323679.3326502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1811.12605","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Qingyu Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qingyu Liu","raw_affiliation_strings":["Electrical and Computer Engineering, Virginia Tech"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Virginia Tech","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Haibo Zeng","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haibo Zeng","raw_affiliation_strings":["Electrical and Computer Engineering, Virginia Tech"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Virginia Tech","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":null,"display_name":"Minghua Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Minghua Chen","raw_affiliation_strings":["Information Engineering, The Chinese University of Hong Kong"],"affiliations":[{"raw_affiliation_string":"Information Engineering, The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":3.151,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92172728,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"41","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","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/T13553","display_name":"Age of Information Optimization","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/T12079","display_name":"IoT Networks and Protocols","score":0.9557999968528748,"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"}},{"id":"https://openalex.org/T13471","display_name":"Cognitive Functions and Memory","score":0.9419999718666077,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.7103999853134155},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6578999757766724},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5949000120162964},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5681999921798706},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.46470001339912415},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.40799999237060547},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4077000021934509}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7103999853134155},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6578999757766724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6367999911308289},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5949000120162964},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5921000242233276},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5681999921798706},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.40799999237060547},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4077000021934509},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36329999566078186},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3255000114440918},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.311599999666214},{"id":"https://openalex.org/C152623178","wikidata":"https://www.wikidata.org/wiki/Q436417","display_name":"Network delay","level":3,"score":0.3070000112056732},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2621999979019165}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3323679.3326502","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323679.3326502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1811.12605","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.12605","pdf_url":"https://arxiv.org/pdf/1811.12605","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1811.12605","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.12605","pdf_url":"https://arxiv.org/pdf/1811.12605","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1677318746","https://openalex.org/W1966109186","https://openalex.org/W1993918491","https://openalex.org/W2102760493","https://openalex.org/W2106007310","https://openalex.org/W2146487252","https://openalex.org/W2167264214","https://openalex.org/W2185752976","https://openalex.org/W2469279958","https://openalex.org/W2534339435","https://openalex.org/W2566954515","https://openalex.org/W2742405391","https://openalex.org/W2744248483","https://openalex.org/W2759063821","https://openalex.org/W2782611477","https://openalex.org/W2789828687","https://openalex.org/W2791487310","https://openalex.org/W2903529520","https://openalex.org/W2963028458","https://openalex.org/W2964065984","https://openalex.org/W2964217103"],"related_works":[],"abstract_inverted_index":{"We":[0,51,78,112],"consider":[1],"the":[2,64,92,99,106,133,139,172,181],"scenario":[3],"where":[4],"a":[5,9,14,17,74,118,168],"sender":[6],"periodically":[7],"sends":[8],"batch":[10,39],"of":[11,38,98,105,132,183],"data":[12],"to":[13,27,33,116,155],"receiver":[15],"over":[16,176],"multi-hop":[18],"network,":[19],"possibly":[20],"using":[21],"multiple":[22],"paths.":[23],"Our":[24],"objective":[25],"is":[26,101,167],"minimize":[28],"peak/average":[29],"Age-of-Information":[30],"(AoI)":[31],"subject":[32],"throughput":[34,173],"requirements.":[35,174],"The":[36],"consideration":[37],"generation":[40],"and":[41,84],"multi-path":[42],"communication":[43],"differentiates":[44],"our":[45,55,123,184],"AoI":[46,56,83],"study":[47],"from":[48],"existing":[49],"ones.":[50],"first":[52],"show":[53],"that":[54,81,94],"minimization":[57,136],"problems":[58],"are":[59,88],"NP-hard,":[60],"but":[61],"only":[62],"in":[63,91,141],"weak":[65],"sense,":[66],"as":[67],"we":[68],"develop":[69],"an":[70,102,157],"optimal":[71,96],"algorithm":[72,131,140],"with":[73,108,143],"pseudo-polynomial":[75],"time":[76],"complexity.":[77],"then":[79],"prove":[80],"minimizing":[82,85,163],"maximum":[86,134],"delay":[87,135],"\"roughly\"":[89],"equivalent,":[90],"sense":[93],"any":[95,129,150],"solution":[97,104,161],"latter":[100],"approximate":[103],"former":[107],"bounded":[109],"optimality":[110],"loss.":[111],"leverage":[113],"this":[114],"understanding":[115],"design":[117],"general":[119],"approximation":[120],"framework":[121],"for":[122,162],"problems.":[124],"It":[125],"can":[126],"build":[127],"upon":[128],"\u03b1-approximation":[130],"problem,":[137],"e.g.,":[138],"[13]":[142],"\u03b1":[144],"=":[145],"1":[146],"+":[147,159],"\u03f5":[148,152],"given":[149],"user-defined":[151],">":[153],"0,":[154],"construct":[156],"(\u03b1":[158],"c)-approximate":[160],"AoI.":[164],"Here":[165],"c":[166],"constant":[169],"depending":[170],"on":[171],"Simulations":[175],"various":[177],"network":[178],"topologies":[179],"validate":[180],"effectiveness":[182],"approach.":[185]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2018-12-11T00:00:00"}