Bandwidth management/policing in ATM networks for serving multi-category traffic using a simple learning algorithm and a bucket bank

A simple learning algorithm based method for dynamically sharing a pool of bandwidth (BW) by multiple categories of traffic in asynchronous transfer mode (ATM) networks is proposed. For constant bit rate (CBR)-type traffic only the maximum of the consumable BW is defined (this can be implemented by using a suitable connection admission control algorithm), whereas for the other categories, a minimum portion of the BW is guaranteed when they are sufficiently active. The remaining portion of the BW is dynamically shared on the basis of pre-assigned priority level, discard eligibility, and current activity of the cells of a specific category. A number of functions for (i) fast reward fast penalty (FRFP), (ii) fast reward slow penalty (FRSP), (iii) slow reward slow penalty (SRSP), and (iv) slow reward fast penalty (SRFP), are proposed. Their impacts on the achievability of dynamic sharing of BW is investigated