• 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.

• 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.

• 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.

• 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.

• 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.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.539-544
• /
• 2011

In this paper, a parameter optimization method of RIO-DC (RED (Random Early Detection) with In and Out-De-Coupled Queues) scheme for Assured Service (AS) in Differentiated Services (DiffServ) is proposed. In order to optimize QoS (Quality of Service) performance of the RIO-DC policy for AS in terms of maximum tolerable latency, link utilization, fairness, etc., we should design router nodes with proper RIO-DC operating parameter values. Therefore, we propose a RIO-DC configuration method and the admission control criterion, considering the allocated bandwidth to each subclass and the corresponding buffer size, to increase throughput for In-profile traffic and link utilization. Simulation results show that RIO-DC with the proposed parameter values guarantees QoS performance comparable with the RIO scheme and it improves fairness between AS flows remarkably.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1351-1354
• /
• 2001

본 논문에서는 Differentiated Services (DiffServ) 망의 edge 라우터에 적용되는 3 단계 트래픽 제어기 (3 phased traffic conditioner : 3PTC)를 제안하였다. 제안된 3PTC 는 TCP 트래픽의 예약된 대역폭 (reserved rate) 의 차이, UDP/TCP의 상호작용, RTT 및 집합된 트래픽을 구성하는 작은 트래픽 수에 의한 영향을 최소화함으로써, DiffServ 망에서 제공하는 Assured Services 사용자들에게 공정한 대역폭을 보장해 줄 수 있다. 3PTC 는 토큰버킷 단계, 확률결정 단계, 그리고 버퍼관리 단계로 이루어져 있다.

• 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.

• 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.

• 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.