A Basic Dynamic Routing Problem and Diffusion
From MaRDI portal
Publication:4162932
DOI10.1109/TCOM.1978.1094075zbMath0383.90047MaRDI QIDQ4162932
Publication date: 1978
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Related Items
ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE, Optimal control of assignment of jobs to processors under heavy traffic, Unnamed Item, Task allocation in multiserver systems -- a survey of results., Time-dependent performance approximation of truck handling operations at an air cargo terminal, Asymptotically tight steady-state queue length bounds implied by drift conditions, Understanding the marginal impact of customer flexibility, Convexity and characterization of optimal policies in a dynamic routing problem, Optimal buffer size for a stochastic processing network in heavy traffic, Cooperative distributed dynamic load balancing, Martingale dynamics and optimal routing in a network, Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies, Upper and lower bounds for the waiting time in the symmetric shortest queue system, A level-crossing approach to the solution of the shortest-queue problem, The capacity of QoE for wireless networks with unreliable transmissions, Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling, A survey of Markov decision models for control of networks of queues, Heavy traffic limits for some queueing networks, Heavy traffic limit theorems for a sequence of shortest queueing systems, Approximating the mean response time of parallel queues with JSQ policy, Diffusion approximation of a multitype re-entrant line under smaller-buffer-first-served policy, Some first passage time problems for the shortest queue model, Analysis of the asymmetric shortest queue problem, Dynamic Scheduling of a Four-Station Queueing Network, DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
