Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The Journal of China Universities of Posts and Telecommunications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
