Efficient storage allocation for processing in backlog-controlled queueing networks using multicriteria techniques

Problems of efficient storage allocation arise in many real situations in which there exists competition for the use of available resources. In the present study, the problem of allocating efficiently waiting space for processing in closed queueing networks which support external backlog is investigated by a composite methodology based on operational (i.e. non-stochastic) queueing theory and multicriteria techniques. The usefulness of the methodology adopted is demonstrated in the field of computer communications for networks with arbitrary topology. For such networks, the above methodology can be implemented in a series of specific steps.