«queueing networks»
۹۳۰۳ نتیجهWaiting times in queueing networks with a single shared server
We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the system or is routed to another queue. This
State Dependent Models of Material Handling Systems in Closed Queueing Networks
A comprehensive algorithmic analysis of finite state dependent queueing models and exponentially distributed workstations is formulated and presented. The material handling system is modeled with finite state dependent queueing network M/G/c/c models and the individual workstatio
Higher Order Approximations for Tandem Queueing Networks
In this paper a higher order approximation for single server queues and tandem queueing networks is proposed and studied. Di erent from the most popular twomoment based approximations in the literature, the higher order approximation uses the higher moments of the interarrival an
Using fluid models to prove stability of adversarial queueing networks
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
queueing: A Package For Analysis Of Queueing Networks and Models in R
queueing is a package that solves and provides the main performance measures for both basic Markovian queueing models and single and multiclass product-form queueing networks. It can be used both in education and for professional purposes. It provides an intuitive, straightforwar
Stabilizing Queueing Networks with Setups
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
Gamarnik : Using Fluid Models to Prove Stability of Adversarial Queueing Networks
| A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is deened 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 ev
Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks
While many single station queues possess explicit forms for their equilibrium probabilities, queueing networks are more problematic. Outside of the class of product form networks (e.g., Jackson, Kelly and BCMP networks), one must resort to bounds, simulation, asymptotic studies o
Deadlock properties of queueing networks with finite capacities and multiple routing chains
Blocking in queueing network models with nite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and suucient conditions for deadlock-free queueing networks with blocking
Stability of Multiclass Queueing Networks Under FIFO Service Discipline
In this paper, we rst formally identify a FIFO uid network that corresponds to the queueing network under a rst-in rst-out (FIFO) service discipline, thus complementing the result of Dai (1995a) for the use of the uid model for the stability of a multiclass queueing network under