On overload control of parlay application server in next generation network

After analyzing the features of the Parlay application server(AS), which provides many services with different time constraints in the next generation network (NGN), a self-adapted overload control algorithm implemented in Parlay AS is proposed. In this algorithm, the service process module in parlay AS uses the earliest deadline first (EDF) serving rule to serve messages, and the overload control mechanism, using the Leaky Bucket algorithm to control message flows, is triggered by estimating the queue waiting time of a newly arriving message. By simulation it shows that this algorithm is a simple, easy-to-use, and available algorithm.