On overload control of parlay application server in next generation network

After analyzing the features of the Parlay applicationserver(AS), which provides many services with different timeconstraints in the next generation network(NGN), a self-adapted overload control algorithm implemented in Parlay AS isproposed. In this algorithm, the service process module inparlay AS uses the earliest deadline first (EDF) serving rule toserve messages, and the overload control mechanism, using theleaky Bucket algorithm to control message flows, is triggeredby estimating the queue waiting time of a newly arrivingmessage. By simulation it shows that this algorithm is a simple,easy-to-use, and available algorithm.