Abstract

We formulate a model for the optimal location of switches in ATM communications networks. The networks are designed in such a way that, at their arrival to the switches, ATM cells find free space in a buffer of length b, with a probability alpha. The model avoids the impairment to the communication caused by both cell loss (because of shorter buffers) and cell-delay variations (because of longer buffers). It is also shown how to transform a non-linear, probabilistic, constraint into a linear form. Computational experience is provided for the model.