ویراساینس.
سند علمی

Stability in Queueing Networks via the Finite Decomposition Property

Utku 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 with the fluid network is not rate stable. In that paper the FDP was demonstrated for two station queueing networks only. In this paper, we show that the property holds for certain classes of queueing networks with any number of stations, thus allowing one to completely analyze the global stability of such queueing networks via the fluid model. Short Title: Fluid Networks

اسناد مشابه

  • Stabilizing Queueing Networks with Setups

    سند علمی۲۰۰۴Math. Oper. Res.J. G. Dai, Otis B. Jennings

    For multiclass queueing networks, dispatch policies govern the assignment of servers to the jobs they process. Production policies perform the analogous task for queueing networks whose servers are subject to switch-over delays or setups, a model we refer to as setup networks. It

  • An Efficient and Accurate Decomposition Method for Open Finite- and Infinite-Buffer Queueing Networks

    سند علمی۱۹۹۹Ramin Sadre, Boudewijn R. Haverkort, Alexander Ost

    We address a decomposition approach for the evaluation of large, open networks of mixed finiteand infinite-buffer queues with phase-type distributed service and interarrival times. Such queueing networks can be seen as high-level specifications of continuous-time Markov chains (C

  • Properties and Analysis of Queueing Network Models with Finite Capacities

    سند علمی۱۹۹۳Performance/SIGMETRICS TutorialsSimonetta Balsamo

    A b s t r a c t Queueing network models with finite capacity queues and blocking are used to represent systems with finite capacity resources and with resource constraints, such as production, communication and computer systems. Various blocking mechanisms have been defined in li

  • Information Theoretic Decomposition of GE-Type Closed Queueing Networks with Finite Capacity and Multiple Servers

    سند علمی۱۹۹۹Vassilios D. Tsiantos, Demetres D. Kouvatsos

    In this paper, the information theoretic principle of Minimum Relative Entropy (MRE), given fully decomposable subset and aggregate mean value constraints, is applied, in conduction with classical queueing theory, to extend earlier works and derive new analytic approximations for

  • Decomposition-Based Analysis of Queueing Networks

    سند علمی۲۰۰۷Ramin Sadre

    Model-based numerical analysis is an important branch of the model-based performance evaluation. Especially state-oriented formalisms and methods based on Markovian processes, like stochastic Petri nets and Markov chains, have been successfully adopted because they are mathematic

  • Approximate Analysis of Queueing Networks with Finite Bu ers and Losses by Decomposition

    سند علمی۱۹۹۸Armin Heindl

    Decomposition as an approximate solution technique for large queueing networks with generally distributed interarrival and service intervals has been studied intensively for nodes with innnite buuers. The network is partitioned into subsystems which are analyzed in isolation by c