Allocation of buffer capacities in queueing networks with arbitrary topologies.

Two algorithms are developed to allocate M buffers to N service stations connected arbitrarily in a feed-forward manner. All service times and the interarrival times are assumed to be exponentially distributed. Both methodologies are easy-to-use tools to explore alternative buffer storage configurations and parameter settings during the initial design stages of production systems, communications networks, and flexible manufacturing systems. [ABSTRACT FROM AUTHOR]