New admission control algorithm based on effective bandwidth for a multi-class network

This paper presents the analysis and estimation of effective bandwidth of a router, handling multi-class traffic. Analysis is done with marginal buffering as well as large buffers. Performance of a periodic on-off source is compared with that of a Poisson¿s source with marginal buffering. Bandwidth requirement of the sources for a given Quality of Service is worked out. The analysis is then extended to routers with large buffers. Estimated performance parameters based on effective bandwidth are found out mathematically. Trade-off between required bandwidth and buffer provisioning is shown. A humble admission control algorithm, based on the measurement of certain parameters of the incoming flows is proposed. Finally the efficacy of the algorithm is shown by comparing its performance with the calculated bounds of the probability of overflow.