Overload control of SCP in advanced intelligent network with fairness and priority

In this paper we propose two mechanisms for overload control of SCP in AIN; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which an SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG and apply different call gapping times to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. Fairness about the probability of rejection is maintained with the same value on all SSPs. On the priority scheme, new arrival gapping method has better priority achievement than continuous gapping method.