Achieving statistical gain in ATM networks with the same complexity as peak allocation strategy

This paper deals with a novel strategy for connection admission control in ATM networks. This strategy, called worst deterministic pattern allocation (WDPA), aims at reaping statistical gain of ATM, through a simple and controllable bandwidth allocation. WDPA is based on the concept of preventively constraining information sources to emit their cells according to a superimposed deterministic mask. Resource allocation is performed taking into account only the parameters of the declared deterministic mask. The same allocation rule is utilized in every network section. Application of WDPA to input and output queueing switches is also discussed and its compatibility with both these architectures is demonstrated. A performance study is presented. A comparison of the efficiency resulting from WDPA application with that relevant to peak allocation and pure statistical allocation is presented. Results show that, by fixing a maximum transit delay, WDPA outperforms statistical allocation if path length exceed few hops