Traffic management for connectionless services over ATM

This paper is concerned with the transport of connectionless traffic over ATM networks. Several architectures have been defined and standardized for this purpose, like LANE, CBDS, Classical IP or MPOA. However traffic management for resources optimization of these architectures remains mostly an open issue. One of the key problem there is to control – and dimension – the capacity of the required ATM virtual circuits. In [19,21], dynamic capacity allocation schemes have been defined for this purpose. They have shown great promise through simulation and analytical studies. In this paper, we analyze the behavior of a multiplexer with such dynamic capacity allocation schemes when fed by several bursty flows. EATA properties [5,18] are used to compute the loss probability seen by each individual multiplexed stream, extending the analytical analysis of [9]. The study gives insight into the usefulness of these schemes and highlights several interesting properties: namely, the reduction of inter‐dependency between multiplexed flows and the reduction of the average queue occupancy. Such properties allow a better multiplexing gain. The particular case of dynamic allocation schemes for TCP/IP is then discussed.