Modelling chaotic behaviour of SIP retransmission mechanism

Hong, Yang; Huang, Changcheng; Yan, James

doi:10.1080/17445760.2011.647912

Cited by 10 publications

(10 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such buffers can be treated as pseudo-infinity. We have studied the dynamical behavior of an SIP server with infinite buffer in Hong et al [2009], where our analytical model and the related numerical results have theoretically verified the simulation observations in and Shen et al [2008] that a demand burst may cause the SIP server overload and overload can be migrated to the upstream server, thus bringing down the whole SIP network. However, the impact of finite buffer on the SIP retransmission mechanism has not been studied so far.…”

Section: Sip (Session Initiation Protocol)mentioning

confidence: 66%

Modeling and simulation of SIP tandem server with finite buffer

Hong

Huang

Yan

2011

ACM Trans. Model. Comput. Simul.

Self Cite

View full text Add to dashboard Cite

Recent collapses of SIP servers (e.g., Skype outage) indicate that the built-in SIP overload control mechanism cannot mitigate overload effectively. We introduce our analytical approach by investigating an overloaded tandem server scenario. Our analytical model: (1) considers a general case that both arrival rate and service rate for signaling messages are generic random processes; (2) makes a detailed analysis of departure processes; (3) allows us to run fluid-based simulations to observe and analyze SIP system performance under some specific scenarios. This approach is much faster than event-driven simulation which needs to track thousands of retransmission timers for outstanding messages and may crash a simulator due to limited computing resources. Our numerical results help us reach a counterintuitive conclusion: A SIP system with a large buffer size may continuously exhibit overload and long queuing delay after experiencing a short period of demand burst or a temporary server slowdown. Small buffer size, on the other hand, can mitigate overload quickly by rejecting a large portion of the requests from a demand burst, and then resume normal operation after a short period of time. Furthermore, numerical results demonstrate that overload at a downstream server may propagate or migrate to its upstream servers and therefore cause widespread server crashes in a real SIP network. ACM Reference Format:Hong, Y., Huang, C., and Yan, J. 2011. Modeling and simulation of SIP tandem server with finite buffer. ACM Trans. Model.

show abstract

Section: Sip (Session Initiation Protocol)mentioning

confidence: 66%

Modeling and simulation of SIP tandem server with finite buffer

Hong

Huang

Yan

2011

ACM Trans. Model. Comput. Simul.

Self Cite

View full text Add to dashboard Cite

show abstract

“…41,42 In this paper, each SIP server has a finite buffer, and messages will be dropped when the buffer becomes full. In addition, an analytical model of the SIP overload control algorithm is also developed.…”

Section: Fluid-based Simulation Versus Event-driven Simulationmentioning

confidence: 99%

Modeling and design of a Session Initiation Protocol overload control algorithm

2012

Self Cite

View full text Add to dashboard Cite

Recent collapses of Session Initiation Protocol (SIP) servers indicate that the built-in SIP overload control mechanism cannot mitigate overload effectively. In this paper, we propose a new SIP overload control algorithm by introducing a novel analytical approach to model the dynamic behavior of a SIP network where each server has a finite buffer. Three key breakthroughs of our modeling approach are the formulations of the message loss process, message retransmission process, and the complex departure process through detailed analysis. Our modeling results indicate that retransmissions triggered by the queuing delay are redundant, thus we propose a feedback control mechanism that regulates the retransmission message rate to mitigate the overload. We then demonstrate how to extend our analytical approach to the modeling of our overload control solution. Simulation based on this analytical model runs much faster than eventdriven simulation, which needs to track thousands of retransmission timers for outstanding messages and may crash a simulator due to limited computation resources. Performance evaluation demonstrates that: (1) without the control algorithm applied, the overload at a downstream server may propagate to its upstream servers and cause widespread network failure; (2) in the case of short-term overload, our feedback control solution can mitigate the overload effectively without rejecting calls intentionally or reducing network utilization, thus avoiding the disadvantages of existing overload control solutions. In addition, compared with the pushback solution, our retransmission-based solution achieves a better trade-off between the speed to cancel the overload and the call rejection rate when an overload lasts a short period.

show abstract

“…Using analytical modeling approach, [18] created a Markov-modulated Poisson process model to analyse the queueing mechanism of SIP server. A fluid model [19] depicts the dynamic behavior of retransmissions in SIP server with infinite buffer. From the literature survey as mentioned earlier, we observe that either solution is provided for local overload control [12][13][14] or hop-by-hop overload control [15][16][17][18][19].…”

mentioning

confidence: 99%

Reducing session establishment delay using timed out packets in SIP signaling network

Mishra

Selvamuthu

Kar

2014

Int J Communication

View full text Add to dashboard Cite

SUMMARYSession Initiation Protocol (SIP) has a retransmission mechanism to maintain the reliability for its real time transmission. But these real time transmissions cause overload in the server and creates redundant messages. SIP does not offer sufficient mechanisms for handling overload situations. In this paper, we study the SIP system behavior by separating signaling traffic in two different classes (I nvites and Non-invites) and creating a cut-off priority queueing model. SIP retransmission mechanism with timeout is modeled as a queueing system with impatient customers. Using this model, the effect of unnecessary retransmissions is studied, and delay distribution and loss probability (P b_loss) are calculated. The proposed analytical model is verified with simulations that demonstrate that the inclusion of timeout gives better delay performance. Using P b_loss, an algorithm is developed to control the overload in hop-by-hop transaction as described in RFC 6357. The simulation results for the proposed model with overload control and the standard SIP as per RFC 3261 are compared. The results demonstrate that the server utilization factor of an overloaded server always remains less than one and hence avoids system collapse. Further, the redundant messages in the system are reduced by 30% as compared with the standard SIP network.

show abstract

Modelling chaotic behaviour of SIP retransmission mechanism

Cited by 10 publications

References 19 publications

Modeling and simulation of SIP tandem server with finite buffer

Modeling and simulation of SIP tandem server with finite buffer

Modeling and design of a Session Initiation Protocol overload control algorithm

Reducing session establishment delay using timed out packets in SIP signaling network

Contact Info

Product

Resources

About