A Basic Dynamic Routing Problem and Diffusion

DOI10.1109/TCOM.1978.1094075MaRDI QIDQ4162932zbMATH OpenFDO

Authors Gerard J. Foschini, Jack Salz

Publication date 1978

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCOM.1978.1094075

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Queues and service in operations research (90B22)

Cited in

(36)

• 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
• Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
• A load balancing system in the many-server heavy-traffic asymptotics
• Some first passage time problems for the shortest queue model
• Analysis of the asymmetric shortest queue problem
• Steady-state analysis of the join-the-shortest-queue model in the Halfin-Whitt regime
• Dynamic Scheduling of a Four-Station Queueing Network
• Time-dependent performance approximation of truck handling operations at an air cargo terminal
• DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• Understanding the marginal impact of customer flexibility
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• Optimal control of assignment of jobs to processors under heavy traffic
• To pool or not to pool: queueing design for large-scale service systems
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Stability of parallel server systems
• Persistent-idle load-distribution
• Transform methods for heavy-traffic analysis
• On the power of (even a little) resource pooling
• Performance analysis of joining the shortest queue model among a large number of queues
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• Task allocation in multiserver systems -- a survey of results.
• The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations
• Convexity and characterization of optimal policies in a dynamic routing problem
• Optimal buffer size for a stochastic processing network in heavy traffic

This page was built for publication: A Basic Dynamic Routing Problem and Diffusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162932)