Overload control in finite buffer message system with general distributed service time

Traffic consists of N classes arriving at a finite capacity message system in a bursty fashion. An overload control scheme is proposed which aims to maintain a strategic reserve of buffers for the higher priority traffic classes. Associated with each traffic class are two thresholds: a blocking threshold U_i and a resume threshold L_i for class i (i=1, ..., N). At the epoch when the buffer occupancy level reaches U_i for class i, the traffic class i is blocked and the system will resume admission of class i if the buffer occupancy level decreases to the resume threshold L_i (L_i<U_i). The problem with Poisson arrivals and general distributed service time is analyzed by means of supplementary variable method, and an efficient algorithm is developed for the steady state distribution of the buffer occupancy level and some other important measures are also obtained