Allocation of flows in closed bipartite queueing networks

Characteristics of Optimal Workload Allocation for Closed Queueing Networks

We consider the problem of allocating a given workload among the stations in a multi-server product-form closed queueing network to maximize the throughput. We first investigate properties of the throughput function and prove that it is pseudoconcave for some special cases. Some other characteristics of the optimal workload and its physical interpretation are also provided. We then develop two ...

Performance Analysis of Closed Queueing Networks - ReadingSample

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 ...

Perfect Sampling for Multiclass Closed Queueing Networks

In this paper we present an exact sampling method for multiclass closed queuing networks. We consider networks for which stationary distribution does not necessarily have a product form. The proposed method uses a compact representation of sets of states, that is used to derive a bounding chain with significantly lower complexity of one-step transition in the coupling from the past scheme. The ...

Perfect sampling for closed queueing networks

In this paper we investigate coupling from the past (CFTP) algorithms for closed queueing networks. The stationary distribution has a product form only in a very limited number of particular cases when queue capacity is nite, and numerical algorithms are intractable due to the cardinality of the state space. Moreover, closed networks do not exhibit any monotonic property enabling e cient CFTP. ...