2017 American Control Conference (ACC) 2017
DOI: 10.23919/acc.2017.7963205
|View full text |Cite
|
Sign up to set email alerts
|

Join-the-shortest-queue scheduling with delay

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…Similar balancing approaches are widely adopted such as Least Connection (LC) weighted algorithms, Round Robin (RR) weighted algorithms [27], Random selection, and Shortest-Queue [28,29]. These balancing approaches are provided as a service by popular cloud providers such as Windows Azure, Amazon ELB, and HP-CLB [30].…”
Section: Background and Related Workmentioning
confidence: 99%
“…Similar balancing approaches are widely adopted such as Least Connection (LC) weighted algorithms, Round Robin (RR) weighted algorithms [27], Random selection, and Shortest-Queue [28,29]. These balancing approaches are provided as a service by popular cloud providers such as Windows Azure, Amazon ELB, and HP-CLB [30].…”
Section: Background and Related Workmentioning
confidence: 99%
“…Previous works on stability of queuing networks are typically based on full knowledge of model data [1,[8][9][10][11][12][13]. So far, the best-studied MDI control policy is the join-the-shortestqueue (JSQ) routing policy for parallel queues [14][15][16][17][18][19][20][21] or simple networks [22], which requires only the queue lengths and does not rely on model data [23]. When and only when the network is stabilizable, i.e., the demand is less than capacity (service rate), the JSQ policy guarantees the stability of parallel queues/simple networks [22,24] and the optimality of homogeneous servers [15].…”
Section: Introductionmentioning
confidence: 99%