Fast Jackson Networks with Dynamic Routing

Authors:
Yu. M. Suhov;N. D. Vvedenskaya
Affiliations:
-;-
Venue:
Problems of Information Transmission
Year:
2002

Citing 3
Cited 4

Analysis of the asymmetric shortest queue problem

Queueing Systems: Theory and Applications
On the stability of a partially accessible multi-station queue with state-dependent routing

Queueing Systems: Theory and Applications
The power of two choices in randomized load balancing

The power of two choices in randomized load balancing

Balancing Queues by Mean Field Interaction

Queueing Systems: Theory and Applications
Steady state analysis of balanced-allocation routing

Random Structures & Algorithms
Stability of a retrial queueing network with different classes of customers and restricted resource pooling

Proceedings of the 5th International Conference on Queueing Theory and Network Applications
A matrix-analytic solution for randomized load balancing models with PH service times

PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new class of models of queueing networks with load-balanced dynamic routing is considered. We propose a sufficient condition for positive recurrence of the arising Markov process and a limiting mean-field approximation where the process becomes deterministic and is described by a system of nonlinear ordinary differential equations.