Modeling of priority-based request scheduling mechanism for finite buffer SIP servers

Demir Y. Yavas; Ibrahim Hokelek; Bilge Gunsel

doi:10.1145/3016032.3016055

Modeling of priority-based request scheduling mechanism for finite buffer SIP servers

Demir Y. Yavas, Ibrahim Hokelek, Bilge Gunsel

Department of Electronics and Communication Engineering

Istanbul Technical University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper, we present a fluid-flow model to characterize the behavior of the overloaded Session Initiation Protocol (SIP) server with a finite buffer. Our model includes a priority-based request scheduling mechanism (PRSM) which diminishes redundant retransmissions to overcome the overloading of SIP servers. The numerical results closely match with the simulation results, indicating that the proposed models can accurately capture the dynamic behavior of a SIP server with the PRSM. Using the Markov Modulated Poisson Process (MMPP) traffic model, the failure ratio of the PRSM is reduced to zero when the buffer size is higher than 1K while it linearly increases for the conventional SIP. The mean response delay of the PRSM is kept constant around 175 ms while it reaches as high as 179 seconds for the conventional SIP when the buffer size is around 200K.

Original language	English
Title of host publication	Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016
Publisher	Association for Computing Machinery
ISBN (Electronic)	9781450348423
DOIs	https://doi.org/10.1145/3016032.3016055
Publication status	Published - 13 Dec 2016
Event	11th International Conference on Queueing Theory and Network Applications, QTNA 2016 - Wellington, New Zealand Duration: 13 Dec 2016 → 15 Dec 2016

Publication series

Name	ACM International Conference Proceeding Series

Conference

Conference	11th International Conference on Queueing Theory and Network Applications, QTNA 2016
Country/Territory	New Zealand
City	Wellington
Period	13/12/16 → 15/12/16

Bibliographical note

Publisher Copyright:
© 2016 ACM.

Keywords

Fluidflow
Priority queuing
Server-overloading
SIP retransmission

Access to Document

10.1145/3016032.3016055

Cite this

Yavas, D. Y., Hokelek, I., & Gunsel, B. (2016). Modeling of priority-based request scheduling mechanism for finite buffer SIP servers. In Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016 Article a6 (ACM International Conference Proceeding Series). Association for Computing Machinery. https://doi.org/10.1145/3016032.3016055

@inproceedings{ac8df7d311264039a6d381b92291adae,

title = "Modeling of priority-based request scheduling mechanism for finite buffer SIP servers",

abstract = "In this paper, we present a fluid-flow model to characterize the behavior of the overloaded Session Initiation Protocol (SIP) server with a finite buffer. Our model includes a priority-based request scheduling mechanism (PRSM) which diminishes redundant retransmissions to overcome the overloading of SIP servers. The numerical results closely match with the simulation results, indicating that the proposed models can accurately capture the dynamic behavior of a SIP server with the PRSM. Using the Markov Modulated Poisson Process (MMPP) traffic model, the failure ratio of the PRSM is reduced to zero when the buffer size is higher than 1K while it linearly increases for the conventional SIP. The mean response delay of the PRSM is kept constant around 175 ms while it reaches as high as 179 seconds for the conventional SIP when the buffer size is around 200K.",

keywords = "Fluidflow, Priority queuing, Server-overloading, SIP retransmission",

author = "Yavas, {Demir Y.} and Ibrahim Hokelek and Bilge Gunsel",

note = "Publisher Copyright: {\textcopyright} 2016 ACM.; 11th International Conference on Queueing Theory and Network Applications, QTNA 2016 ; Conference date: 13-12-2016 Through 15-12-2016",

year = "2016",

month = dec,

day = "13",

doi = "10.1145/3016032.3016055",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

booktitle = "Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016",

}

Yavas, DY, Hokelek, I & Gunsel, B 2016, Modeling of priority-based request scheduling mechanism for finite buffer SIP servers. in Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016., a6, ACM International Conference Proceeding Series, Association for Computing Machinery, 11th International Conference on Queueing Theory and Network Applications, QTNA 2016, Wellington, New Zealand, 13/12/16. https://doi.org/10.1145/3016032.3016055

Modeling of priority-based request scheduling mechanism for finite buffer SIP servers. / Yavas, Demir Y.; Hokelek, Ibrahim; Gunsel, Bilge.
Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016. Association for Computing Machinery, 2016. a6 (ACM International Conference Proceeding Series).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Modeling of priority-based request scheduling mechanism for finite buffer SIP servers

AU - Yavas, Demir Y.

AU - Hokelek, Ibrahim

AU - Gunsel, Bilge

PY - 2016/12/13

Y1 - 2016/12/13

N2 - In this paper, we present a fluid-flow model to characterize the behavior of the overloaded Session Initiation Protocol (SIP) server with a finite buffer. Our model includes a priority-based request scheduling mechanism (PRSM) which diminishes redundant retransmissions to overcome the overloading of SIP servers. The numerical results closely match with the simulation results, indicating that the proposed models can accurately capture the dynamic behavior of a SIP server with the PRSM. Using the Markov Modulated Poisson Process (MMPP) traffic model, the failure ratio of the PRSM is reduced to zero when the buffer size is higher than 1K while it linearly increases for the conventional SIP. The mean response delay of the PRSM is kept constant around 175 ms while it reaches as high as 179 seconds for the conventional SIP when the buffer size is around 200K.

AB - In this paper, we present a fluid-flow model to characterize the behavior of the overloaded Session Initiation Protocol (SIP) server with a finite buffer. Our model includes a priority-based request scheduling mechanism (PRSM) which diminishes redundant retransmissions to overcome the overloading of SIP servers. The numerical results closely match with the simulation results, indicating that the proposed models can accurately capture the dynamic behavior of a SIP server with the PRSM. Using the Markov Modulated Poisson Process (MMPP) traffic model, the failure ratio of the PRSM is reduced to zero when the buffer size is higher than 1K while it linearly increases for the conventional SIP. The mean response delay of the PRSM is kept constant around 175 ms while it reaches as high as 179 seconds for the conventional SIP when the buffer size is around 200K.

KW - Fluidflow

KW - Priority queuing

KW - Server-overloading

KW - SIP retransmission

UR - http://www.scopus.com/inward/record.url?scp=85015185231&partnerID=8YFLogxK

U2 - 10.1145/3016032.3016055

DO - 10.1145/3016032.3016055

M3 - Conference contribution

AN - SCOPUS:85015185231

T3 - ACM International Conference Proceeding Series

BT - Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016

PB - Association for Computing Machinery

T2 - 11th International Conference on Queueing Theory and Network Applications, QTNA 2016

Y2 - 13 December 2016 through 15 December 2016

ER -

Modeling of priority-based request scheduling mechanism for finite buffer SIP servers

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this