Downloads & Free Reading Options - Results

As we already observed in the investigation of queueing networks with blocking that the throughout is a non-decreasing function of the number of jobs (3), i.e., the blocking events have the effect of violating the throughout results. Two questions arose from this observation: 1) How to distribute the total buffer capacity to the stations such that no deadlock will occur and a maximum (optional) throughout will be achieved?; and 2) Given the buffer capacity of each station in the network. How to select the total number of jobs in the network such that the throughput will be maximum (optimum)? To answer these questions first we assumed that all stations have infinite capacity and derived new formulas for optimal throughput and response times based on the well-known mean value analysis approach (4). Then in (5( we found necessary and sufficient conditions for buffer allocation in the cyclic networks with blocking such that an optimal throughput will be achieved.

Queueing networks with blocking have experienced a dramatic increase in their importance regarding performance evaluation of computer system and communication networks. Parametric Analysis is very interesting for cases in which only one station (e.g., a CPU) in a queueing network model is to be analyzed under various system washload. In order to execute parametric analysis of queueing networks with blocking the problem Computation of the Throughput Values of the Finite Capacity Subsystem is solved.The accuracy of the method has been validated by simulation of several test cases.