Allocation of buffer capacities in queueing networks with arbitrary topologies
The authors present two algorithms to allocate \(M\) buffers to \(N\) service stations which are connected in a feedforward manner. All service times and the interarrival times are assumed to be exponentially distributed. The algorithms use appropriate decompositions of the network followed by iterative improvements.
scientific article; zbMATH DE number 513140