Controlling SIP server overload with priority based request scheduling

Yavaş, Demir Y.; Hökelek, İbrahim; Günsel, Bilge

doi:10.1109/iccnc.2015.7069396

Cited by 8 publications

(11 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In our previous works, we introduce the PRSM as a new overload prevention method. The PRSM identifies and removes redundant retransmissions in the queue to minimize processing effort in the overloaded SIP server.…”

Section: Prsm Backgroundmentioning

confidence: 99%

“…In our previous works, we developed a priority‐based SIP‐server request scheduling mechanism (PRSM) as a new overload prevention approach by diminishing the negative effect of redundant retransmissions. The main idea is to identify retransmitted messages before queuing and to provide strict priority for the original incoming SIP requests over the retransmissions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On fluid‐flow modeling of priority based request scheduling for finite buffer SIP server

Yavaş

Hökelek

Günsel

2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary With the widespread deployments of voice‐over‐internet protocol services, the existing session initiation protocol (SIP) design cannot scale up for large network sizes. Events triggering a demand burst or a server slowdown can cause SIP server overload, overload propagation, and crash, thus bringing down the whole SIP network. Since the SIP retransmission mechanism exacerbates the overload condition, existing models created for a stable SIP system cannot be effectively used to analyze an overloaded server. In this paper, we propose a fluid‐flow model to characterize the behavior of the finite buffer SIP server equipped with priority‐based request scheduling mechanism (PRSM). The model for the PRSM uses primary and secondary queues for the original request messages and the retransmitted requests, respectively. The performance metrics, namely, the failed call attempts and the response delay from sending INVITE request until receiving a 100‐Trying response, are derived using the arrival time‐slot tracking and the removal processes of the proposed fluid‐flow model. We conducted test cases under the heavy traffic conditions, where the overload is caused by bulk and bursty arrivals or server slowdown. The numerical results closely match with the simulation results for all experiments, indicating that the proposed model can accurately capture the dynamic behavior of an SIP server with the PRSM. The experiments demonstrate that the number of failed call attempts is close to 0 and the mean response delay is kept constant around 175 ms for the PRSM when the buffer size is higher than 1K while both metrics are significantly higher for the conventional SIP.

show abstract

Section: Prsm Backgroundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On fluid‐flow modeling of priority based request scheduling for finite buffer SIP server

Yavaş

Hökelek

Günsel

2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…Ek olarak, analiz araCl, normal ve yeniden iletilen mesajlan sunucu kuyrugunda onceliklendirebilecek bi<;irnde yapllandmlabilmektedir. Bu ozellik, <;e�itli onceliklendirme varsayrrnlan altmda ana liz yapma olanagl saglamaktadrr [5,6]. (QueueObserver) QS'in kuyruk istatistiiini gozleyen bir yaplyl geryekler.…”

unclassified

“…ikinci durumda, her bir kuyruk iyin arabellek buyUkliigU ayrl degerlerde olabilir. Onceliklendirme yaplsl [5] Sebeke kaYlplarmm goz online almmadlgl durumda, yeniden iletirnin olu�masl iyin ya gelen mesajm kuyrukta yer bulamamasl (kuyruk kaybl), ya da uytan-uca gecikmenin varsaYllandan bUyUk olmasl gerekir. Bu durumda, MMPP(2)/MI1/N iyin yeniden iletrne olaslhgl a�agldaki denklem kullamlarak hesaplanabilir [9]: Prt = P(qiO 2:: 11T1) + P(qil 2:: 11T1) + Pb (1) Denklemde Pb kaYlp olaslhgl qiO ve qil, srraslyla, a�1fI yiik ve normal yiik kiplerindeki kuyruk uzunlugunu gostermektedir (O-sJgvy.…”

unclassified

See 1 more Smart Citation

Analysis tool for SIP server loading

Yavaş

Hökelek

Günsel

2015

2015 23nd Signal Processing and Communications Applications Conference (SIU)

Self Cite

View full text Add to dashboard Cite

Ozetr;e-Yeni nesil mobil servislerin yarathgl yogun trafik nedeniyle operatorler VoIP (Voice over IP) protokollerinin olt;eklendirme problemleriyle kar�1 kar�lya kalmaktadlr. Bu bildiride, SIP (Session Initiation Protocol) yeniden iletme mekanizmasmm a�1rI yiik altmdaki SIP sunuculan iizerindeki etkisini incelemek amaclyla geli�tirdigimiz aynk-olayh yazlhm araci sunulmaktadlr. MMPP (Markov Modulated Poisson Process) trafik modelini temel alan yazllim araclmlz farkll van� ve servis siire�leri saglayabilmektedir. <;:ah�mada farkll MMMP parametreleri ve SIP sunucu kuyruk arabellek biiyiikliikleri kullandarak yeniden iletim mekanizmasmm SIP sunucularm a�1rI yiiklenmesine olan etkisini gosteren sonu�lar rapor edilmektedir. Geli�tirilen ara�la, sunucuya ilk defa gelen ile yeniden iletilen mesajlar arasmda servis onceliklendirilmesi yapdmasml oneren �izelgeleyicinin performans analizi de yapllml�tlr ve ayrmtlll sonu�lar �e�itli �ah�malanmlzda raporlanml�tlr. A�lk kaynak kod kullamma a�lIml� olup, bu konuda �ah�an ara�tlrmacdarm yeni diizenlemeler yapmasma olanak vermektedir. Anahtar Kelimeler -SIP, MMPP, yeniden iteam, a §lrl yiiklenme Abstract-As the amount of traffic generated by next generation mobile services keeps increasing, the operators face the scalability challenges of VoIP protocols. This paper presents an analysis tool to evaluate the etTect of SIP retransmission mechanism on the SIP server overloading. Our tool is capable of creating various arrival and departure processes using Markov Modulated Poisson Process (MMPP). In order to evaluate effects of the SIP retransmission mechanism on server overloading, test resul ts obtained by using various MMPP parameters and butTer sizes are reported. The performance analysis of priority based SIP server scheduling mechanism in which the original incoming SIP requests have strict priority over the retransmitted requests has been performed and published in our previous papers. Researchers can access to the developed open source software that allows modifications.

show abstract

A dynamic distributed overload control mechanism in SIP networks with holonic multi-agent systems

Khazaei

Mozayani

2015

Telecommun Syst

View full text Add to dashboard Cite

Controlling SIP server overload with priority based request scheduling

Cited by 8 publications

References 4 publications

On fluid‐flow modeling of priority based request scheduling for finite buffer SIP server

On fluid‐flow modeling of priority based request scheduling for finite buffer SIP server

Analysis tool for SIP server loading

A dynamic distributed overload control mechanism in SIP networks with holonic multi-agent systems

Contact Info

Product

Resources

About