Join the shortest queue: Stability and exact asymptotics

From MaRDI portal
Revision as of 11:44, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1872454

zbMath1016.60078MaRDI QIDQ1872454

David R. McDonald, Robert D. Foley

Publication date: 6 May 2003

Published in: The Annals of Applied Probability (Search for Journal in Brave)




Related Items (55)

Networks with cascading overloadsThe kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systemsInteracting queues with server selection and coordinated scheduling-application to cellular data networksThe shorter queue polling modelDynamic routing in distinguishable parallel queues: an application of product returns for remanufacturingUnderstanding the marginal impact of customer flexibilityScalable Load Balancing in Networked Systems: A Survey of Recent AdvancesQueueing systems with different service disciplinesApproximations for a queueing game model with join-the-shortest-queue strategyStationary analysis of the shortest queue problemRare event asymptotics for a random walk in the quarter planePolling Models with Unequal Service Rates under Limited Service Policies—Sharp AsymptoticsThe generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximationsSteady-state analysis of shortest expected delay routingLight tail asymptotics in multidimensional reflecting processes for queueing networksSome first passage time problems for the shortest queue modelA 3-queue polling system with join the shortest-serve the longest policyCost-aware defense for parallel server systems against reliability and security failuresOn Accommodating Customer Flexibility in Service SystemsStability of join the shortest queue networksJoin the shortest queue among \(k\) parallel queues: tail asymptotics of its stationary distributionLimit theorems for queueing systems with various service disciplines in heavy-traffic conditionsA survey on skill-based routing with applications to service operations managementMalyshev's theory and JS-queues. Asymptotics of stationary probabilitiesQueues with boundary assistance: The effects of truncationAnalysis of job transfer policies in systems with unreliable serversResource pooling in the presence of failures: efficiency versus riskLarge deviations for a feed-forward networkStability of Multi-Dimensional Birth-and-Death Processes with State-Dependent 0-Homogeneous JumpsThe stationary tail asymptotics in the GI/G/1-type queue with countably many background statesTail asymptotics of two parallel queues with transfers of customersStability criteria for controlled queueing systemsExact tail asymptotics in a priority queue -- characterizations of the preemptive modelLarge deviations of a modified Jackson network: stability and rough asymptoticsBridges and networks: exact asymptoticsAsymptotic behavior for MAP/PH/\(c\) queue with shortest queue discipline and jockeyingPerformance Analysis of Joining the Shortest Queue Model Among a Large Number of QueuesDecay rate for a PH/M/2 queue with shortest queue disciplineReplicate to the shortest queuesCircle of interacting servers: spontaneous collective behavior in the case of large fluctuationsMartingales and buffer overflow for the symmetric shortest queue modelTail asymptotics for service systems with transfers of customers in an alternating environmentDecay rates for quasi-birth-and-death processes with countably many phases and tridiagonal block generatorsConfiguration of overloaded servers with dynamic routingOn walks avoiding a quadrantExact asymptotics for the stationary distribution of a Markov chain: a production modelDiscrete harmonic functions in the three-quarter planeMultiple-server system with flexible arrivalsOn the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfersBalancing queues by mean field interactionPartial Flexibility in Routeing and SchedulingA polling system with `join the shortest -- serve the longest' policySignaling for decentralized routing in a queueing networkUnnamed ItemLarge deviations without principle: join the shortest queue







This page was built for publication: Join the shortest queue: Stability and exact asymptotics