Fast and robust signaling overload control

Telecommunication switches implement overload controls to maintain call throughput and delay, at acceptable levels during periods of high load. Existing work has mostly focused on controls under sustained overload-they do not inert the demands of modern telecommunication systems where the increased number of services and mobile subscribers often creates fast changing hot spots. We introduce new algorithins that are designed to be highly reactive to sudden bursts of load. One algorithm is a modified version of RED for signaling traffic that measures the queue size. The second algorithm uses two measures: call acceptance rate and processor occupancy. Using simulations of realistic system models, we compare these new algorithms with each other and an existing algorithm that uses processor occupancy only. Our simulation results and qualitative arguments show that the combination of acceptance rate and processor occupancy results in a highly, reactive and robust signaling overload control.