Design and Performance Evaluation of a Scheduling Algorithm for Edge Node supporting Assured Service in High-speed Internet Access Networks 


Vol. 29,  No. 4, pp. 461-471, Apr.  2004


PDF
  Abstract

Recently, subscribers have strong desire to get QoS based personalized services in high-speed Internet access. Service providers have been rapidly replacing ADSL, cable broadband access networks with Metro-Ethernet based VDSL. But, it is difficult for Metro-Ethernet based broadband access networks to provide QoS based personalized services, because already deployed network elements cannot distinguish subscribers by specific traffic characteristics. In this paper, when the access network has tree topology, we show that it is possible to provide QoS for each downstream flow with only per flow traffic shaping at the edge node without QoS functions in access networks. In order to show that our suggested scheduling algorithm at the edge node can support the assured service in tree topology access networks, we evaluated its performance by simulation. The suggested scheduling algorithm can shape per-flow traffic based on the maximum bandwidth, and guarantees minimum bandwidth per flow by modifying the DRR scheduler. Simulation results show that congestion and loss in the access network elements are greatly reduced, TCP performance is highly enhanced and loss for assured CBR service flows is reduced by only shaping per-flow traffic at the edge node using our proposed scheduling algorithm.

  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]

D. Roh, J. Lee, B. Kim, "Design and Performance Evaluation of a Scheduling Algorithm for Edge Node supporting Assured Service in High-speed Internet Access Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 4, pp. 461-471, 2004. DOI: .

[ACM Style]

Dae-cheol Roh, Jae-Yong Lee, and Byung-Chul Kim. 2004. Design and Performance Evaluation of a Scheduling Algorithm for Edge Node supporting Assured Service in High-speed Internet Access Networks. The Journal of Korean Institute of Communications and Information Sciences, 29, 4, (2004), 461-471. DOI: .

[KICS Style]

Dae-cheol Roh, Jae-Yong Lee, Byung-Chul Kim, "Design and Performance Evaluation of a Scheduling Algorithm for Edge Node supporting Assured Service in High-speed Internet Access Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 4, pp. 461-471, 4. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880