A study of methods for protecting an SCP from overload
Maria Kihl · 1995
This paper deals with overload control algorithms that should see to that throughput in an service control points (SCP) is kept high, also under severe overload conditions. A couple of basic overload control schemes like random admittance, call gapping and window flow control are examined. We stress that the algorithms should both be efficient and show fairness among a number of SSPs logically connected to the SCP over Signalling System Number 7. Without a proper exchange of load information between the SSPs and the SCP only efficiency can be achieved. To have fairness among the SSPs this exchange of information is necessary