Fast Jackson networks with dynamic routing

DOI10.1023/A:1020010710507MaRDI QIDQ1812352zbMATH OpenOpenAlexFDO

Authors Yuri Suhov, N. Vvedenskaya

Publication date 8 September 2003

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020010710507

zbMATH Keywords

queueing networkslimiting mean-field approximationload-balanced dynamic routing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Fast Jackson networks
• scientific article; zbMATH DE number 1936535
• Models and analysis of queueing networks
• Analysis of loss networks with routing
• On the Jackson networks

Cited in

(13)

• Nonlinear Markov processes in big networks
• Performance analysis of joining the shortest queue model among a large number of queues
• On a doubly dynamically controlled supermarket model with impatient customers
• The mean-field computation in a supermarket model with server multiple vacations
• Rate of convergence to stationary distribution for unreliable Jackson-type queueing network with dynamic routing
• Analysis of unreliable open queueing network with dynamic routing
• Optimal dynamic scheduling in Jackson networks
• Balancing queues by mean field interaction
• Stability of join-the-shortest-queue networks
• Decay of tails at equilibrium for FIFO join the shortest queue networks
• Tail probabilities in queueing processes
• Block-structured supermarket models
• Stability of join the shortest queue networks

This page was built for publication: Fast Jackson networks with dynamic routing

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