Browse > Article

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

노대철 (KT 기술연구소)
이재용 (충남대학교 정보통신공학)
김병철 (충남대학교 정보통신공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.29, no.4C, 2004 , pp. 461-471 More about this Journal
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 Motto-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.
Keywords
Assured service; per-flow shaping; scheduling algorithm; Internet access networks;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Integrated services in the Internet architecture: An overview /
[ R.Braden;D.Clark;S.Shenker ] / RFC 1633
2 RTP: A transport protocol for real-time application /
[ H.Schulzrinne;S.Casner;R.Frederick;V.Jacobson ] / RFC
3 An efficient rate allocation algorithm for atm networks providing max-min faimess /
[ L.Kalampoukas;A.Varma;K.K.Ramakrishnan ] / Proc. of the 6th IFIP International Conference on High Performance Networking
4 /
[ 신효정;임태성;최양희;전효섭;이정수 ] / ISP 네트워크에 대한 QoS 제공 방안
5 /
[ S.Keshav ] / An engineering approach to computer networking
6 An architecture for differentiated services /
[ S.Blake;D.Black;M.Carlson;E.Davies;Z.Wang;W.Weiss ] / RFC 2475
7 A provider architecture for differentiated services and traffic engineering /
[ T.Li;Y.Rekhter ] / RFC 2430
8 Internet QoS: A big picture /
[ X.Xiao;L.Ni ] / IEEE Network
9 General weighted fairnes and its support in explicit rate switch algorithms /
[ Bobby Vandalore;Sonia Fahmy;Raj Jain;Rohit Goyal;Mukul Goyal ] / Computer Communications   DOI   ScienceOn
10 DSL evolution - architecture requirements for the support of QoS-enabled IP services /
[ Architecture & Transport Working Group ] / Technical Report DSL Forum TR-059
11 /
[] / The ns-2 simulator
12 A generalized processor sharing approach to flow control in integrated services networks: the single-node case /
[ A.K.Parekh;R.G.Gallagher ] / IEEE/ACM Transaction on Networking   DOI   ScienceOn
13 Efficient fair queuing using deficit round robin /
[ M.Shreedhar;G.Varghese ] / IEEE/ACM Transaction on Networking   DOI   ScienceOn
14 A self clocked fair queueing scheme for broadband applications /
[ S.Golestani ] / Proc. IEEE INFOCOMM'94
15 Virtual clock: A new traffic control algorithm for packet switched networks /
[ L.Zhang ] / ACM Transactions on Computer Systems   DOI
16 Traffic management specification version 4.1 /
[ The ATM Forum Traffic Management Working Group ] / ATM Forum/AF-TM-0121.000
17 On packet switches with infinite storage /
[ John Nagle ] / IEEE Transactions on Communications