{"id":"https://openalex.org/W2813271351","doi":"https://doi.org/10.1109/infcomw.2018.8406909","title":"Statistical guarantee optimization for age of information for the D/G/1 queue","display_name":"Statistical guarantee optimization for age of information for the D/G/1 queue","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2813271351","doi":"https://doi.org/10.1109/infcomw.2018.8406909","mag":"2813271351"},"language":"en","primary_location":{"id":"doi:10.1109/infcomw.2018.8406909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2018.8406909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239836","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025956807","display_name":"Jaya Prakash Champati","orcid":"https://orcid.org/0000-0002-5127-8497"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jaya Prakash Champati","raw_affiliation_strings":["School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108742631","display_name":"Hussein Al-Zubaidy","orcid":null},"institutions":[{"id":"https://openalex.org/I746986","display_name":"Halmstad University","ror":"https://ror.org/03h0qfp10","country_code":"SE","type":"education","lineage":["https://openalex.org/I746986"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Hussein Al-Zubaidy","raw_affiliation_strings":["School of Information Technology (ITE), Halmstad University, Halmstad, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology (ITE), Halmstad University, Halmstad, Sweden","institution_ids":["https://openalex.org/I746986"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037402766","display_name":"James Gross","orcid":"https://orcid.org/0000-0001-6682-6559"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"James Gross","raw_affiliation_strings":["School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.9208,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.98553544,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"130","last_page":"135"},"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/T10300","display_name":"Congenital Heart Disease Studies","score":0.9725000262260437,"subfield":{"id":"https://openalex.org/subfields/2713","display_name":"Epidemiology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12079","display_name":"IoT Networks and Protocols","score":0.9194999933242798,"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.6921107769012451},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6334919929504395},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6261348724365234},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.604253888130188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6022930145263672},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5458621382713318},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5351342558860779},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5087078213691711},{"id":"https://openalex.org/keywords/information-age","display_name":"Information Age","score":0.49699142575263977},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4340822100639343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18276327848434448},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08208394050598145},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07053184509277344}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6921107769012451},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6334919929504395},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6261348724365234},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.604253888130188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6022930145263672},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5458621382713318},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5351342558860779},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5087078213691711},{"id":"https://openalex.org/C91093795","wikidata":"https://www.wikidata.org/wiki/Q956129","display_name":"Information Age","level":2,"score":0.49699142575263977},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4340822100639343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18276327848434448},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08208394050598145},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07053184509277344},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcomw.2018.8406909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2018.8406909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},{"id":"pmh:oai:DiVA.org:kth-239836","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239836","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:kth-239836","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239836","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1640967807","https://openalex.org/W1677318746","https://openalex.org/W1932416753","https://openalex.org/W1970679118","https://openalex.org/W1993918491","https://openalex.org/W2069689609","https://openalex.org/W2146487252","https://openalex.org/W2742988081","https://openalex.org/W2744248483","https://openalex.org/W2963230953","https://openalex.org/W4237072601","https://openalex.org/W6637169243"],"related_works":["https://openalex.org/W2365647353","https://openalex.org/W4385401023","https://openalex.org/W2044363610","https://openalex.org/W3151522584","https://openalex.org/W2363056536","https://openalex.org/W2029548118","https://openalex.org/W2295575944","https://openalex.org/W2060911134","https://openalex.org/W2347400435","https://openalex.org/W1497123311"],"abstract_inverted_index":{"Age":[0],"of":[1,19,43,54,61,65,75,83,122,161,187],"Information":[2],"(AoI)":[3],"has":[4,26],"proven":[5],"to":[6,72,129,152],"be":[7,110,150],"a":[8,59,85,117,131],"useful":[9],"metric":[10],"in":[11],"networked":[12],"systems":[13],"where":[14,139],"timely":[15],"information":[16,77],"updates":[17,39],"are":[18,180],"importance.":[20],"Recently,":[21],"minimizing":[22,62,184],"the":[23,38,44,52,55,63,66,73,80,88,104,120,123,159,168,176,185,188],"\u201caverage":[24],"age\u201d":[25],"received":[27],"considerable":[28],"attention.":[29],"However,":[30],"various":[31],"applications":[32],"pose":[33],"stricter":[34],"age":[35],"requirements":[36],"on":[37,119],"which":[40],"demand":[41],"knowledge":[42],"AoI":[45,56,67,105,124,189],"distribution.":[46,190],"In":[47],"this":[48],"work,":[49],"we":[50,113],"study":[51],"distribution":[53,68,106,125],"and":[57,126],"devise":[58],"problem":[60],"tail":[64,121,186],"function":[69],"with":[70],"respect":[71],"frequency":[74],"generating":[76],"updates,":[78],"i.e.,":[79],"sampling":[81],"rate":[82,177],"monitoring":[84],"process,":[86],"for":[87,103,115,167,183],"D/G/1":[89],"queue":[90],"model":[91],"under":[92],"FCFS":[93],"queuing":[94],"discipline.":[95],"We":[96,157,171],"argue":[97],"that":[98,175],"computing":[99,116],"an":[100,144],"exact":[101],"expression":[102],"may":[107],"not":[108],"always":[109],"feasible.":[111],"Therefore,":[112],"opt":[114],"bound":[118],"use":[127],"it":[128],"formulate":[130],"tractable":[132],"a-relaxed":[133],"Upper":[134],"Bound":[135],"Minimization":[136],"Problem":[137],"(\u03b1-UBMP),":[138],"\u03b1":[140],">":[141],"1":[142],"is":[143],"approximation":[145,148],"factor.":[146],"This":[147],"can":[149],"used":[151],"obtain":[153],"\u201cgood\u201d":[154],"heuristic":[155],"solutions.":[156],"demonstrate":[158],"efficacy":[160],"our":[162],"approach":[163],"by":[164],"solving":[165],"a-UBMP":[166],"D/M/1":[169],"queue.":[170],"show,":[172],"using":[173],"simulation,":[174],"solutions":[178],"obtained":[179],"near":[181],"optimal":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":3}],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2018-07-19T00:00:00"}