{"id":"https://openalex.org/W4289655108","doi":"https://doi.org/10.1109/isit50566.2022.9834697","title":"How Useful Is Delayed Feedback in AoI Minimization \u2014 A Study on Systems With Queues in Both Forward and Backward Directions","display_name":"How Useful Is Delayed Feedback in AoI Minimization \u2014 A Study on Systems With Queues in Both Forward and Backward Directions","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655108","doi":"https://doi.org/10.1109/isit50566.2022.9834697"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834697","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834697","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5006311047","display_name":"Chih-Chun Wang","orcid":"https://orcid.org/0000-0002-1685-820X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chih-Chun Wang","raw_affiliation_strings":["Purdue University,Elmore Family School of ECE,USA","Elmore Family School of ECE, Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"Purdue University,Elmore Family School of ECE,USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Elmore Family School of ECE, Purdue University, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006311047"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":2.1604,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88781298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3192","last_page":"3197"},"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.9635000228881836,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.7339404225349426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7022665143013},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.7019369602203369},{"id":"https://openalex.org/keywords/acknowledgement","display_name":"Acknowledgement","score":0.5513553023338318},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.48287537693977356},{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.48012566566467285},{"id":"https://openalex.org/keywords/feedback-loop","display_name":"Feedback loop","score":0.43993908166885376},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.43514636158943176},{"id":"https://openalex.org/keywords/fork\u2013join-queue","display_name":"Fork\u2013join queue","score":0.41544556617736816},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.35231560468673706},{"id":"https://openalex.org/keywords/queue-management-system","display_name":"Queue management system","score":0.2172374725341797},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21246492862701416},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11077234148979187},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.10428208112716675},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.08193421363830566}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.7339404225349426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7022665143013},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7019369602203369},{"id":"https://openalex.org/C2777880217","wikidata":"https://www.wikidata.org/wiki/Q4674282","display_name":"Acknowledgement","level":2,"score":0.5513553023338318},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.48287537693977356},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.48012566566467285},{"id":"https://openalex.org/C186886427","wikidata":"https://www.wikidata.org/wiki/Q5441213","display_name":"Feedback loop","level":2,"score":0.43993908166885376},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.43514636158943176},{"id":"https://openalex.org/C124444977","wikidata":"https://www.wikidata.org/wiki/Q4025962","display_name":"Fork\u2013join queue","level":4,"score":0.41544556617736816},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35231560468673706},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.2172374725341797},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21246492862701416},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11077234148979187},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.10428208112716675},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.08193421363830566},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834697","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834697","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6800000071525574}],"awards":[],"funders":[{"id":"https://openalex.org/F4320318238","display_name":"National Spectrum Consortium","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1677318746","https://openalex.org/W1997177885","https://openalex.org/W2066786775","https://openalex.org/W2098432798","https://openalex.org/W2744248483","https://openalex.org/W2886323539","https://openalex.org/W2919517595","https://openalex.org/W2963082493","https://openalex.org/W2963294159","https://openalex.org/W2964345816","https://openalex.org/W2970983057","https://openalex.org/W2976631814","https://openalex.org/W3046993672","https://openalex.org/W3081244218","https://openalex.org/W3131354038","https://openalex.org/W3164366798","https://openalex.org/W3198349153","https://openalex.org/W6637169243","https://openalex.org/W6760249958"],"related_works":["https://openalex.org/W1571046458","https://openalex.org/W2136328827","https://openalex.org/W2055315068","https://openalex.org/W2169200370","https://openalex.org/W2485682392","https://openalex.org/W564284091","https://openalex.org/W4297956590","https://openalex.org/W2082229021","https://openalex.org/W2889212717","https://openalex.org/W4289655108"],"abstract_inverted_index":{"One":[0],"canonical":[1],"example":[2],"of":[3,26,117],"Age-Of-Information":[4],"(AoI)":[5],"minimization":[6,122],"is":[7,24,40,82],"the":[8,22,27,33,38,70,79,97,100,107,115,124],"update-through-queues":[9,125],"models.":[10],"Existing":[11],"results":[12,112],"fall":[13],"into":[14],"two":[15],"categories:":[16],"The":[17,111],"open-loop":[18],"setting":[19,35,47],"for":[20,36,120],"which":[21,37,53,93],"sender":[23],"oblivious":[25],"actual":[28],"packet":[29],"departure":[30],"time,":[31],"versus":[32],"closed-loop":[34,80],"decision":[39,81],"based":[41,84],"on":[42,57,85,104],"instantaneous":[43],"Acknowledgement":[44],"(ACK).":[45],"Neither":[46],"perfectly":[48],"reflects":[49],"modern":[50],"networked":[51],"systems,":[52],"almost":[54],"always":[55],"rely":[56],"feedback":[58,108,119],"that":[59,78],"experiences":[60],"some":[61],"delay.":[62],"Motivated":[63],"by":[64],"this":[65,67],"observation,":[66],"work":[68],"subjects":[69],"ACK":[71],"traffic":[72],"to":[73,99],"an":[74],"independent":[75],"queue":[76],"so":[77],"made":[83],"delayed":[86,118],"feedback.":[87],"Near-optimal":[88],"schedulers":[89],"have":[90],"been":[91],"devised,":[92],"smoothly":[94],"transition":[95],"from":[96],"instantaneous-ACK":[98],"openloop":[101],"schemes":[102],"depending":[103],"how":[105],"long":[106],"delay":[109],"is.":[110],"thus":[113],"quantify":[114],"benefits":[116],"AoI":[121],"in":[123],"systems.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}