Handling load with less stress

DOI10.1007/S11134-006-8218-ZzbMath1101.90016OpenAlexW2038594010MaRDI QIDQ851238

Nikhil Bansal, David Gamarnik

Publication date: 17 November 2006

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-006-8218-z

zbMATH Keywords

heavy trafficlarge deviationsheavy tailed distributionsM/G/1 queuesaverage solourn time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Heavy-tailed limits for medium size jobs and comparison scheduling ⋮ A large-deviations analysis of the GI/GI/1 SRPT queue ⋮ Heavy-Traffic Analysis of Sojourn Time Under the Foreground–Background Scheduling Policy ⋮ Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies ⋮ Achievable Performance of Blind Policies in Heavy Traffic

Cites Work

• On the large deviations behavior of acyclic networks of \(G/G/1\) queues
• On the average sojourn time under \(M/M/1/\)SRPT
• Task assignment with unknown duration
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• Technical Note—Distribution of Attained and Residual Service in General Queuing Systems
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Handling load with less stress