Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fast Jackson Networks with Dynamic Routing

Fast Jackson Networks with Dynamic Routing 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Fast Jackson Networks with Dynamic Routing

Loading next page...
1
 
/lp/springer-journals/fast-jackson-networks-with-dynamic-routing-3SMxuhJFR0

References (21)

Publisher
Springer Journals
Copyright
Copyright © 2002 by MAIK “Nauka/Interperiodica”
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1023/A:1020010710507
Publisher site
See Article on Publisher Site

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.

Journal

Problems of Information TransmissionSpringer Journals

Published: Oct 13, 2004

There are no references for this article.