An overload control of SCP in advanced intelligent network with fairness and priority

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