Shortest expected delay routing for Erlang servers

DOI10.1007/BF01206552zbMath0879.60095MaRDI QIDQ1362301

Jaap Wessels, Ivo J. B. F. Adan

Publication date: 3 August 1997

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

zbMATH Keywords

random walks; queues; equilibrium distribution; dynamic routing

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

A finite compensation procedure for a class of two-dimensional random walks, The shorter queue polling model, Analyzing \(E_k/E_r/ c\) queues, Steady-state analysis of shortest expected delay routing, Analysis of the shortest relay queue policy in a cooperative random access network with collisions

Cites Work

• Unnamed Item
• A compensation procedure for multiprogramming queues
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Analyzing \(E_k/E_r/ c\) queues
• Analysis of the asymmetric shortest queue problem
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel
• On the Optimality of the Generalized Shortest Queue Policy
• J.comput. appl. math
• Poisson Arrivals See Time Averages
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• On the optimal assignment of customers to parallel servers
• A compensation approach for two-dimensional Markov processes
• On a class of two-dimensional nearest-neighbour random walks
• On the Stochastic Matrices Associated with Certain Queuing Processes