• Title/Summary/Keyword: Assured Service

Search Result 87, Processing Time 0.02 seconds

A Configuration method of RIO for the Assured Service in Differentiated Services (DiffServ 방식의 Assured Service를 위한 자원 할당 및 RIO 변수 설정 방안의 제안)

  • Hur, Kyeong;Lee, Heyung-Sub;Shin, Dong-Beom;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6C
    • /
    • pp.571-580
    • /
    • 2002
  • In this paper, we relatively differentiate maximum delay for each Assured Service subclass in Differentiated Services by allocating bandwidth to each subclass differently. To maximize the throughput for the In-profile traffic and the link utilization, we propose a Cofiguration method of RIO and the admission control criterion based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. Simulation results show that the proposed method can calculate the capacity to guarantee the QoS for the Assured Service and maximize the throughput for the In-profile traffic and the link utilization by applying the RIO parameter values set through the proposed configuration method.

Charging the Assured-Bandwidth Service (최저대역보장형 서비스에 대한 과금)

  • 이훈;이광휘
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.3
    • /
    • pp.179-179
    • /
    • 2004
  • In the near future we can expect a change in charging the Internet service. The flat charging maybe replaced with a usage-based charging. In line with this movement, we propose a method of charging the assured-quality Internet services for the next generation network by introducing a UBC (usage-based charging) scheme over the conventional flat charging platform. First, we investigate the attribute of elastic traffic generated by assured services in IP network. Next, we propose a new method to relate the bandwidth usage with the pricing for the elastic traffic, which is based partially on the usage rate of the network bandwidth. Next, we propose a charging function for elastic traffic, which is applicable to any type of assured Internet services. Finally, we discuss the implication of the work via simple numerical experiments.

Charging the Assured-Bandwidth Service (최저대역보장형 서비스에 대한 과금)

  • Seok, Seung-Hak;Lee, Hoon;Lee, Kwang-Hui
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.3
    • /
    • pp.21-28
    • /
    • 2004
  • In the near future we can expect a change in charging the Internet service. The flat charging maybe replaced with a usage-based charging. In line with this movement, we propose a method of charging the assured-quality Internet services for the next generation network by introducing a UBC (usage-based charging) scheme over the conventional flat charging platform. First, we investigate the attribute of elastic traffic generated by assured services in IP network. Next, we propose a new method to relate the bandwidth usage with the pricing for the elastic traffic, which is based partially on the usage rate of the network bandwidth. Next, we propose a charging function for elastic traffic, which is applicable to any type of assured Internet services. Finally, we discuss the implication of the work via simple numerical experiments.

A Novel Resource Allocation Scheme for QoS guarantee of Assured Service in Differentiated Services (DiffServ 방식의 Assured Service에서 QoS 보장을 위한 효율적인 자원 할당 방안)

  • Hur, Kyeong;Cho, Seong-Dae;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8C
    • /
    • pp.758-770
    • /
    • 2002
  • 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.

Performance comparisons of RIO and RIO-DC for QoS guarantee of the Assured Service in Differentiated Services (DiffServ 방식에서 Assured Service의 QoS 보장을 위한 RIO 및 RIO-DC 방식의 성능 비교)

  • Hur, Kyeong;Shin, Dong-Beom;Lee, Sang-Woo;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.342-352
    • /
    • 2002
  • In this paper, we compare the performances of RIO and RIO-DC buffer management schemes for DiffServ AF PHB standardized in IETF. For the comparison, we relatively differentiate maximum delay for each Assured Service subclass in Differentiated Services by allocating bandwidth to each subclass differently. In addition, we set the values of RIO and RIO-DC parameters considering the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. In this simulation environment, the performances of RIO and RIO-DC schemes are analyzed focusing on the throughput of the In-profile traffic, the link utilization and the fairness. Simulation results show that the performance of RIO-DC scheme is comparable to that of RIO scheme with regard to the throughput of the In-profile traffic and the link utilization. However, under the simulation condition RIO-DC scheme improves the fairness between flows much better than RIO scheme.

An Aggregate Three Color Marker without Per Flow Management for End-to-End QoS Improvement of Assured Service in DiffServ (DiffServ 방식에서 플로별 관리 없이 Assured Service의 End-to-End QoS를 향상하기위한 Aggregate Three Color Marker)

  • Hur, Kyeong;Park, Ji-Hoon;Roh, Young-Sup;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6B
    • /
    • pp.588-603
    • /
    • 2003
  • In this paper, we propose an Aggregate Three Color Marker without per flow management which is required for an Edge router to improve End-to-End QoS of Assured Service in DiffServ. Proposed Aggregate Three Color Marker is used with the Adaptive RIO-DC scheme to achieve the minimum rate guarantee without per flow management. Assuming that the admission control for Assured Service has been performed, proposed Aggregate Three Color Marker measures incoming In-profile traffic rate at the output link of an edge router using a token-bucket with a token rate equal to the sum of contracted rates of admitted flows passing the edge router. If there are token losses from the token bucket, out-of-profile packets are promoted to Yellow packets within the aggregate traffic profile. And yellow packets are demoted to out-of-profile packets at the input link to an Edge router fer the purpose of fairness maintenance. In-profile packets and Yellow packets are processed identically at the RIO-DC buffer management scheme in our proposed method. Simulation results show that through using proposed Aggregate Three Color Marker with the Adaptive RIO-DC scheme, the minimum rate guarantee for Assured Service can be achieved without per flow management at multiple DiffServ domains.

An Adaptive RIO buffer management scheme for QoS guarantee of Assured Service in Differentiated Services (DiffServ 방식의 Assured Service에서 QoS 보장을 위한 Adaptive RIO 방식의 제안)

  • Hur, Kyeong;Kim, Moon-Kyu;Lee, Seung-Hyun;Cho, Seong-Dae;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6C
    • /
    • pp.581-593
    • /
    • 2002
  • In this paper, we proposed an Adaptive RIO scheme to solve the problem of RIO scheme that occurs when admission control is performed for QoS guarantee of Assured Service in Differentiated Services. To prevent an early random drop of the admitted In-profile packet, proposed 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 total 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 found from simulation results that, compared with RIO scheme, proposed Adaptive RIO scheme can improve performance of the throughput for In-profile traffic when admission control is performed or congestion occurs.

A modified RIO queue management scheme that reduces the bandwidth skew problem in Assured Service

  • Kim, hyogon;Park, Won-Hyoung;Saewoong Bahk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.423-426
    • /
    • 1999
  • In offering a statistical end-to-end bandwidth guarantee service, typically called Assured Service, in Differentiated Serviced (Diff-Serv) framework, the biggest issue is its inconsistency. Larger profile TCP flows fail to achieve the guaranteed rate when competing with many smaller profile flows. This phenomenon, which we call "bandwidth skew", stems from the fact that larger profile flows take longer time to recover from the congestion window size backoff after a packet drop. Proposed solutions to this problem, therefore, are focused on modifying the TCP behavior. However, TCP modification is not practicable, mainly due to its large installation base. We look to other mechanisms in the Diff-Serv framework to find more realistic solutions. In particular, we demonstrate that RIO, the de facto standard packet differentiation mechanism used for Assured Service, also contributes to the bandwidth skew. Based on this new finding, we design a modified RIO mechanism called RI+O. RI+O uses OUT queue length in addition to IN and IN+OUT queue length to calculate OUT packet drop probability. We show through extensive simulation that RI+O significantly alleviates the bandwidth skew, expanding the operating regime for Assured Service.d Service.

  • PDF

Performance Analysis of Random Early Dropping Effect at an Edge Router for TCP Fairness of DiffServ Assured Service

  • Hur Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.255-269
    • /
    • 2006
  • The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

A novel Adaptive Re-Marking Strategy for TCP Fairness of DiffServ Assured Services (DiffServ Assured Service에서 TCP 공평성 보장을 위한 적응적인 패킷 Re-Marking 방안)

  • Hur, Kyeong
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.2
    • /
    • pp.99-106
    • /
    • 2008
  • In this paper, we have proposed a novel re-marking strategy at tbe ingressive edge router to improve TCP fairness of DiffServ Assured Services. Our re-marking strategy introduces a configuration method of the Temporary Permitted Rate (TPR). By using this new configuration method of TPR, IN packets of greedy TCP flows are re-marked to OUT packets pertinently and constantly whenever the network traffic changes. Simulation Results show that this novel re-marking strategy can regulate the packet transmission rate of each TCP flow to the contract rate without a decrease in the link utilization.

  • PDF