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

Abstract

In this paper we propose two mechanisms for overload control of the service control point (SCP) in an AIN; a continuous gapping method and a new arrival gapping method. They are all interactive mechanisms in which an SCP and service switching points (SSPs) exchange load information for overload control. These mechanisms are based on general automatic code gapping and apply different call gapping times to each SSP under the fairness scheme. Also in the mechanisms, a priority scheme is implemented. The two mechanisms show almost the 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, the new arrival gapping method has better priority achievement than the continuous gapping method.