Analytical Model of Priority Based Request Scheduling Mechanism Preventing SIP Server Overload

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

doi:10.1109/milcom.2016.7795467

Cited by 3 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The elements of S s n are vectors consisting of the number of processed nonredundant retransmitted messages r e jj+1 (n − k); ( j = 1, … , 6) joined the queue at time slot (n − k). r e jj+1 (n − k) can be calculated recursively through Equations 10-15 and specifically by using Equation 14 for time slot (n − k).…”

Section: Secondary Removal Processmentioning

confidence: 99%

“…The removal process is proposed to remove redundant retransmissions from queue upon the corresponding request message is served. Unlike our previous model published in Yavas et al for infinite buffer, both original request and retransmitted messages can be dropped when there is no place in the finite buffer of the SIP server, creating nonredundant retransmissions. In the proposed model, we introduced the secondary removal and secondary queue arrival time slot–tracking processes to handle nonredundant retransmission for the finite buffer case.…”

Section: Introductionmentioning

confidence: 95%

“…The performance evaluation of the PRSM has been performed in our previous works using both discrete event–based simulation tool and real‐time JAIN‐SIP prototype . In Yavas et al, we developed a discrete‐time fluid‐flow model for an infinite buffer SIP server equipped with the PRSM. For the infinite buffer case, there is no packet drop in the network due to the buffer overflow, and therefore, all retransmissions are redundant.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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: Secondary Removal Processmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 95%

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

show abstract

On modeling of priority-based SIP request scheduling

Yavaş

Hökelek

Günsel

2018

Simulation Modelling Practice and Theory

View full text Add to dashboard Cite

Scalability and Performance Analysis of SIP based Multimedia Services over Mission Critical Communication Systems

Ali

Al‐Begain

Ware

2019

International Journal of Interactive Communication Systems and Technologies

View full text Add to dashboard Cite

Various studies have suggested enhancing the performance of large-scale systems, such as mission critical communication systems (MCCSs). However, few have modelled and evaluated the performance of such systems in a way that targets overall system performance in real time. Moreover, it is not enough to define the Key Performance Indicators (KPIs) for a system without using them for system performance measurement and performance evaluation. The Session Initiation Protocol (SIP) and IP Multimedia Subsystem (IMS) both have a set of KPIs, such as the registration process delay, that can be used to measure and thus optimize overall system performance. This article articulates different options for system simulation and evaluation. The registration process affects performance and reflects the overall system performance. The article shows how the registration process is delayed and how the overall system scalability are negatively impacted by system overload.

show abstract

Analytical Model of Priority Based Request Scheduling Mechanism Preventing SIP Server Overload

Cited by 3 publications

References 10 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

On modeling of priority-based SIP request scheduling

Scalability and Performance Analysis of SIP based Multimedia Services over Mission Critical Communication Systems

Contact Info

Product

Resources

About