{"id":"https://openalex.org/W2886142489","doi":"https://doi.org/10.23919/acc.2018.8430990","title":"Robustness of Join-the-Shortest-Queue Scheduling to Communication Delay","display_name":"Robustness of Join-the-Shortest-Queue Scheduling to Communication Delay","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886142489","doi":"https://doi.org/10.23919/acc.2018.8430990","mag":"2886142489"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2018.8430990","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8430990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual American Control Conference (ACC)","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/A5050833121","display_name":"Saied Mahdian","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saied Mahdian","raw_affiliation_strings":["Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088606320","display_name":"Zhengyuan Zhou","orcid":"https://orcid.org/0000-0002-0005-9411"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhengyuan Zhou","raw_affiliation_strings":["Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002056995","display_name":"Nicholas Bambos","orcid":"https://orcid.org/0000-0001-9250-4553"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas Bambos","raw_affiliation_strings":["Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3708","last_page":"3713"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9991000294685364,"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/T13553","display_name":"Age of Information Optimization","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7687426805496216},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6764669418334961},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.61041259765625},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5956209301948547},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5913824439048767},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5419784784317017},{"id":"https://openalex.org/keywords/fork\u2013join-queue","display_name":"Fork\u2013join queue","score":0.5157649517059326},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4449698328971863},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.4445961117744446},{"id":"https://openalex.org/keywords/multilevel-queue","display_name":"Multilevel queue","score":0.41888749599456787},{"id":"https://openalex.org/keywords/queue-management-system","display_name":"Queue management system","score":0.3893834948539734},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3757207989692688},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3721693158149719},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2983604073524475},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1478985846042633},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.12322008609771729}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7687426805496216},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6764669418334961},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.61041259765625},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5956209301948547},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5913824439048767},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5419784784317017},{"id":"https://openalex.org/C124444977","wikidata":"https://www.wikidata.org/wiki/Q4025962","display_name":"Fork\u2013join queue","level":4,"score":0.5157649517059326},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4449698328971863},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.4445961117744446},{"id":"https://openalex.org/C201511382","wikidata":"https://www.wikidata.org/wiki/Q16801758","display_name":"Multilevel queue","level":4,"score":0.41888749599456787},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.3893834948539734},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3757207989692688},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3721693158149719},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2983604073524475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1478985846042633},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.12322008609771729},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2018.8430990","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8430990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual American Control Conference (ACC)","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":16,"referenced_works":["https://openalex.org/W1590502744","https://openalex.org/W2018165881","https://openalex.org/W2021088586","https://openalex.org/W2064823719","https://openalex.org/W2066826005","https://openalex.org/W2118827342","https://openalex.org/W2119813346","https://openalex.org/W2126212847","https://openalex.org/W2139346833","https://openalex.org/W2153780889","https://openalex.org/W2154007983","https://openalex.org/W2156296037","https://openalex.org/W2159321445","https://openalex.org/W2734540495","https://openalex.org/W2786762820","https://openalex.org/W4248531701"],"related_works":["https://openalex.org/W2019329854","https://openalex.org/W2379185310","https://openalex.org/W2984741874","https://openalex.org/W1976117154","https://openalex.org/W2031779232","https://openalex.org/W2078068723","https://openalex.org/W2891736122","https://openalex.org/W93114864","https://openalex.org/W2460352323","https://openalex.org/W96460855"],"abstract_inverted_index":{"An":[0],"important":[1],"issue":[2],"facing":[3],"schedulers":[4],"in":[5,10,66],"queueing":[6],"networks":[7],"(e.g.":[8],"computing/communication)":[9],"practice":[11],"is":[12,60],"delayed":[13,34],"access":[14,35],"to":[15,36],"communication":[16],"information.":[17,39],"In":[18],"this":[19],"work,":[20],"we":[21,74,82],"study":[22],"the":[23,26,52,58,63,67],"robustness":[24,76],"of":[25,77],"widely":[27],"used":[28],"join-the-shortest-queue":[29],"scheduling":[30,80],"scheme":[31],"under":[32],"randomly":[33],"queue":[37,79],"backlog":[38],"We":[40],"consider":[41],"different":[42],"information":[43,54],"update":[44],"scenarios":[45],"and":[46,62,81],"show":[47],"that":[48],"as":[49,51],"long":[50],"expected":[53,64],"delays":[55],"are":[56,69],"finite,":[57],"system":[59,68],"stable":[61],"backlogs":[65],"also":[70],"finite.":[71],"Through":[72],"simulations,":[73],"demonstrate":[75],"join-the-shortest":[78],"discuss":[83],"some":[84],"interesting":[85],"observation.":[86]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}