A Novel Resource Allocation Scheme for QoS Guarantee of Assured Service in Differentiated Services 


Vol. 27,  No. 8, pp. 758-770, Aug.  2002


PDF
  Abstract

In this paper, we propose a novel resource allocation scheme which can maximize capacity for QoS guarantee of Assured Service in Differentiated Services. Performance of the proposed resource allocation scheme is analyzed with each buffer management scheme such as RIO and Adaptive RIO. To prevent an early random drop of the admitted In-profile packet, Adaptive RIO scheme updates parameters of RIO scheme every time interval according to the estimated numbers of maximum packet arrivals of In-profile traffic and Out-of-profile traffic during the next time interval. The numbers of maximum packet arrivals during the next time interval are estimated based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. We can find from simulation results that proposed resource allocation scheme with Adaptive RIO can guarantee QoS and can maximize capacity for Assured Service.

  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]

K. Hur, S. Cho, D. Eom, K. H. Tchah, "A Novel Resource Allocation Scheme for QoS Guarantee of Assured Service in Differentiated Services," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 8, pp. 758-770, 2002. DOI: .

[ACM Style]

Kyeong Hur, Seong-Dae Cho, Doo-Seop Eom, and Kyun Hyon Tchah. 2002. A Novel Resource Allocation Scheme for QoS Guarantee of Assured Service in Differentiated Services. The Journal of Korean Institute of Communications and Information Sciences, 27, 8, (2002), 758-770. DOI: .

[KICS Style]

Kyeong Hur, Seong-Dae Cho, Doo-Seop Eom, Kyun Hyon Tchah, "A Novel Resource Allocation Scheme for QoS Guarantee of Assured Service in Differentiated Services," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 8, pp. 758-770, 8. 2002.