Shortest expected delay routing for Erlang servers
type: Item
instance of: scholarly article
title: Shortest expected delay routing for Erlang servers
zbMATH Open document ID: 0879.60095
DOI: 10.1007/BF01206552
author: J. Wessels
author: Ivo Adan
published in: Queueing Systems
publication date: 1997-08-03T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 1042826
zbMATH Keywords: dynamic routing
zbMATH Keywords: equilibrium distribution
zbMATH Keywords: queues
zbMATH Keywords: random walks
MaRDI profile type: Publication
cites work: J.comput. appl. math
cites work: Analysis of the asymmetric shortest queue problem with threshold jockeying
cites work: Analysis of the asymmetric shortest queue problem
cites work: A compensation approach for two-dimensional Markov processes
cites work: Analyzing \(E_k/E_r/ c\) queues
cites work: A compensation procedure for multiprogramming queues
cites work: Q3662408
cites work: On a class of two-dimensional nearest-neighbour random walks
cites work: On the Stochastic Matrices Associated with Certain Queuing Processes
cites work: TWO QUEUES IN PARALLEL
cites work: On the Optimality of the Generalized Shortest Queue Policy
cites work: Two Similar Queues in Parallel
cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
cites work: On the optimal assignment of customers to parallel servers
cites work: Poisson Arrivals See Time Averages
description: scientific article; zbMATH DE number 1042826