Ensuring robust call throughput and fairness for SCP overload controls

The paper analyzes the performance of two different types of service control point (SCP) overload control algorithms, table-driven controls and an adaptive control. As performance measures, the author uses aggregate transaction throughput and fairness (whether the control algorithm allocates SCP capacity to individual traffic sources as desired). It is found that, even when parameters are well-matched to source characteristics, table-driven controls do not perform as well as the adaptive control. In addition, the adaptive control is more robust to traffic patterns and SCP internal operation than the table-driven controls