Gamarnik : Using Fluid Models to Prove Stability of Adversarial Queueing Networks

اسناد مشابه

• Using fluid models to prove stability of adversarial queueing networks

  سند علمی۲۰۰۰IEEE Trans. Automat. Contr.David Gamarnik

  A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under eve

• On the stability of queueing networks and fluid models

  سند علمی۲۰۱۰Dieter Armbruster, Erjen Lefeber

  The stability of the Lu-Kumar queueing network is re-analyzed. It is shown that the associated fluid network is a hybrid dynamical system that has a succession of invariant subspaces leading to global stability. It is explained why large enough stochastic perturbations of the pro

• Using fluid models to prove stability of adversarial queueing networks

  مقاله‌ی دسترسی آزاد۲۰۰۰IEEE Transactions on Automatic ControlD.Gamarnik

• CORC REPORT TR-2003-06 Effective Routing and Scheduling in Adversarial Queueing Networks∗

  سند علمی۲۰۰۳Jay Sethuraman, Chung-Piaw Teo

  Motivation. Scheduling and packet-routing have emerged as important problems in modern computer and communication systems. In this paper, we consider such problems in the setting of an arbitrary synchronous, adversarial network. In an adversarial network, the nature of the incomi

• Stability in Queueing Networks via the Finite Decomposition Property

  سند علمی۲۰۰۸APJORUtku Yildirim, John J. Hasenbein

  Determination of the stability behavior of a queueing network is an important part of analyzing such systems. In Gamarnik and Hasenbein (2005) it is shown if a fluid network has the finite decomposition property (FDP) and is not weakly stable, then any queueing network associated

• Fluid Limit of Generalized Jackson Queueing Networks with Stationary and Ergodic Arrivals and Service Times

  سند علمی۲۰۰۵MARC LELARGE, M. LELARGE

  We use a sample-path technique to derive asymptotics of generalized Jackson queueing networks in the fluid scale; that is, when space and time are scaled by the same factor n. The analysis only presupposes the existence of long-run averages and is based on some monotonicity and c