AIPC : COUNTER-ACTIVE ANALYSIS OF OVERLOAD CONTROL MECHANISM FOR SIP SERVER

We have introduced a new mechanism similar to earlier used AIMD algorithm in which there will be a probabilistic change in the sending rate during the overload condition. The probabilistic change will be sender-receiver synchronized by mechanism “Additive Increase and Probabilistic Change (AIPC)”. We show that mechanism is effective, counter-active, reliable and fair. Sender will change its sending rate in accordance with the receiver’s capacity. Sender-receiver is synchronized such that former reduces the sending rate and the later prevents from being overloaded. Simulation is used to analyze the factors viz. effectiveness, efficiency, fairness and stability.