Blocking Probability of the Error Control Mechanism Using Object Information in SCTP 


Vol. 43,  No. 10, pp. 1619-1624, Oct.  2018
10.7840/kics.2018.43.10.1619


PDF Full-Text
  Abstract

Because multimedia object data is an integrated abstraction of each media object, it is necessary to have the new error recovery mechanism as integrated view point. We had designed and proposed the new error recovery mechanism for SCTP based on object information. In this paper, we have investigated its blocking probability by mathematic analyses and queuing theory. The results show that it provides lower blocking probability than those of the SRER (selected repeat error recovery)as conventional error recovery. The proposed mechanism should have the reduction effect of the network resources such as bandwidth, processing power, frame buffer and as well as satisfy the user requirements.

  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.


  Cite this article

[IEEE Style]

W. Choi, "Blocking Probability of the Error Control Mechanism Using Object Information in SCTP," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 10, pp. 1619-1624, 2018. DOI: 10.7840/kics.2018.43.10.1619.

[ACM Style]

Won-Keun Choi. 2018. Blocking Probability of the Error Control Mechanism Using Object Information in SCTP. The Journal of Korean Institute of Communications and Information Sciences, 43, 10, (2018), 1619-1624. DOI: 10.7840/kics.2018.43.10.1619.

[KICS Style]

Won-Keun Choi, "Blocking Probability of the Error Control Mechanism Using Object Information in SCTP," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 10, pp. 1619-1624, 10. 2018. (https://doi.org/10.7840/kics.2018.43.10.1619)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880