A SIP INVITE Flooding Detection algorithm Considering Upperbound of Possible Number of SIP Messages
Vol. 34, No. 8, pp. 797-804, Aug. 2009
PDF Full-Text
Abstract
Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
J. Ryu, K. Ryu, B. Roh, "A SIP INVITE Flooding Detection algorithm Considering Upperbound of Possible Number of SIP Messages," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 8, pp. 797-804, 2009. DOI: .
[ACM Style]
Jea-Tek Ryu, Ki-Yeol Ryu, and Byeong-hee Roh. 2009. A SIP INVITE Flooding Detection algorithm Considering Upperbound of Possible Number of SIP Messages. The Journal of Korean Institute of Communications and Information Sciences, 34, 8, (2009), 797-804. DOI: .
[KICS Style]
Jea-Tek Ryu, Ki-Yeol Ryu, Byeong-hee Roh, "A SIP INVITE Flooding Detection algorithm Considering Upperbound of Possible Number of SIP Messages," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 8, pp. 797-804, 8. 2009.