Diffusion Parameters of Flows in Stable Queueing Networks
نویسندگان
چکیده
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes the system stable. An example is a generalized Jackson network with load less than unity and any work conserving policy. We find a simple diffusion limit for the inter-queue flows with an explicit computable expression for the covariance matrix. Specifically, we present a simple computable expression for the asymptotic variance of arrivals (or departures) of each of the individual queues and each of the flows in the network.
منابع مشابه
Modeling the IEE 802.11 Networks MAC Layer Using Diffusion Approximation
The article presents an analytical model of wireless networks using the IEEE 802.11 protocol to access the transport medium. The model allows to determine such key factors of the quality of service as transmission delays and losses. The model is based on diffusion approximation approach which was proposed three decades ago to model wired networks. We show that it can be adapted to take into con...
متن کاملFuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کاملDiffusion Approximation Models for Transient States and their Application to Priority Queues
The article presents a diffusion approximation model applied to investigate the behavior of priority queues. We discusses the use of the diffusion approximation in transient analysis of queueing models in the case of a single station and of a queueing network presenting the solutions. We emphasize the numerical aspect of the solution and analyze the errors. In classical queuing theory, the anal...
متن کاملQueueing Models and Stability of Message Flows in Distributed Simulators of Open Queueing Networks - Parallel and Distributed Simulation, 1996. Pads 96. Proceedings. Tenth Workshop on
In this paper we study message flow processes in distributed simulators of open queueing networks. We develop and study queueing models for distributed simulators with maximum lookahead sequencing. We characterize the “external” arrival process, and the message feedback process in the simulator of a simple queueing network with feedback. We show that a certain “natural” modelling construct for ...
متن کاملA control-theoretical approach for achieving fair bandwidth allocations in core-stateless networks
In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on the Scalable Core (SCORE) / Dynamic Packet State (DPS) architecture. In particular, we make use of the Linear Quadratic control method from optimal control theory to design stable and robust systems that are simple to implement. Simulation results show that this approach gives ...
متن کامل