Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
نویسنده
چکیده
Queueing networks have been used to model the performance of a variety of complex systems, however, exact results exist for a limited class of networks. The methodology that has been used extensively to analyse networks of queues is the decomposition approach. In this paper, we consider open queueing networks with multiple product classes, deterministic routings and general arrival and service distributions. We examine the decomposition method for such systems and show that it provides estimates of key parameters with an accuracy that is not acceptable in many practical settings. Recognizing this weakness, we enriched the approach by modelling a phenomenon previously ignored. We consider interference among products and describe its effect on the variance of the departure streams. The recognition of this effect has significantly improved the performance of this methodology. We provide extensive experimental results based on the data of a manufacturer of semiconductor devices.
منابع مشابه
Interference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملResource Allocation in General Queueing Networks with Applications to Data Networks
We consider the problem of how best to assign the service effort in a queueing network in order to minimise the expected delay under a cost constraint. We shall study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time ...
متن کاملOptimal capacity assignment in general queueing networks
We consider the problem of how best to assign the service capacity in a queueing network in order to minimise the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time dist...
متن کاملPartial-Fraction Decomposition Approach to the M/H2/2 Queue
Here, a two server queueing system with Poisson arrivals and two different types of customers (M/H2/2 queue) is analyzed. A novel straightforward method is presented to acquire the exact and explicit forms of the performance measures. First, the steady state equations along with their Z-transforms are derived for the aforementioned queueing system. Using some limiting behaviors of the steady-st...
متن کاملResource Allocation in General Queueing Networks
We consider the problem of how best to assign the service effort in a queueing network in order to minimize the expected delay under a cost constraint. We shall study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008