Burst-level admission control protocols with multirate traffic and arbitrary network topology

In this paper, we investigate the performance of two burst-level admission control protocol for ATM networks that are based on simple random access techniques: fell-and-wait and tell-and-go. We develop an analytical model based on reduced load approximation to obtain throughput, end-to-end transfer delay and blocking probability characteristics far an arbitrary network topology with multirate traffic. We discuss the performance of these two protocols under varying propagation delays and peak bit rates. We discuss how the presence of multirate traffic introduces the issue of fairness into these burst-level admission control protocols, a phenomenon not observed previously.