• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.123-134
• /
• 2002

The requirement for QoS (Quality of Service) has become an important Issue as real-time or high bandwidth services are increasing, such as Internet Telephony, Internet broadcasting, and multimedia service etc. In order to guarantee the QoS of Internet application services, several approaches are being sought including IntServ (Integrated Service) DiffServ(Differentiated Srvices), and MPLS(Multi-Protocol Label Switching). In this paper, we describe the performance analysis of QoS guarantee mechanism using the DiffServ. To analyze how the DiffServ performance was affected by diverse input traffic models and the weight value in WFQ(Weighted Fair Queueing), we simulated and performed performance evaluation under a random, bursty, and self-similar input traffic models and for diverse input parameters. leased on the results of performance analysis, it was confirmed that significant difference exist in packet delay and loss depending on the input traffic models used. However, it was revealed that QoS guarantee is possible to the EF (expedited Forwarding) class and the service separation between RF and BE (Best Effort) classes may also be achieved. Next, we discussed the performance synthesis problem. (i. e. derived the conservation laws for a DiffServ networks, and analysed the performance variation and dynamic behavior based on the resource allocation (i.e., weight value) in WFQ.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.25-28
• /
• 2000

As Internet users and network traffics are explosively increased, many researches have been done to provide fast and guaranteed Internet services. The results of these efforts are Multiprotocol Lab el Switching(MPLS) and differentiated service(Diff serv) emerging as a next generation backbone net work. In this paper, we make a research on gearing (or interworking) two technology needed to support end-to-end QoS and explain sequential procedure. And we simulate the L-LSP/E-LSP proposed by Working Group of IETF to be deployed to the DiffServ module which is implemented based on the MPLS network simulator and analyze the performance of the simulation result.

• 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 는 토큰버킷 단계, 확률결정 단계, 그리고 버퍼관리 단계로 이루어져 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.319-321
• /
• 2000

현재 인터넷이 제공하는 최선의 서비스(best-effort)를 개선하기 위해서 IETF(Internet Engineering Task Force)의 DiffServ(Differentiated Service)WG에서는 현재의 인터넷 서비스를 보다 차별화된 QoS를 제공할 수 있도록 하는 방안으로서 Differentiated Service를 제안하였다. 본 논문에서는 이러한 Differentiated Service의 개념과 구조를 살펴보고 Differentiated Service에서 트래픽 포워딩을 효율적으로 제공하기 위한 하나의 방법으로서 CBQ를 이용한 패킷 전송 기법을 제안한다. 본 논문에서 제안하고 있는 이러한 방법을 통해 서비스 측면에서 어느 정도까지의 QoS를 보장할 수 있는지를 실험적으로 보이고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.105-116
• /
• 2003

The differentiated service architecture is based on a simple model by applying a per-class service in the core node of the network. However, due to the simplified network behavior, the network structure and provisioning were more complicated. If a service provider wants the dynamic provisioning or better bandwidth guarantee, signaling protocol with QoS parameters or admission control method should be deployed in DiffServ network. However, these methods increase the complexity. Therefore, we proposed DPM2 mechanism for admission control in the DiffServ network. In this paper, we describe and survey the admission control methods that are applicable to IP networks and propose also the dynamic provisioning mechanism based on the bandwidth broker and distributed measurement based admission control and movable boundary bandwidth management to support heterogeneous QoS services in differentiated service networks. For the performance evaluation for proposed mechanism, we used ns-2 simulator.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.638-640
• /
• 2003

급변하는 네트워크 서비스에 대한 요구에 신속히 대응하고 새로운 특징에 대한 시스템의 수정과 보완이 용이하도록 고안된 것이 네트워크 프로세서이다. 본 논문은 네트워크 관련 응용에 특화된 인텔의 IXP1200 네트워크 프로세서를 이용하여 Differentiated Service를 위한 간단한 DiffServ Ingress Boundary Node로서의 Edge Router를 설계한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.444-454
• /
• 2004

To support diverse transmission requirements of multimedia applications, Quality of Service (QoS) should be provided in the Internet, where only the best-effort service is available. In this paper, we describe our recent effort on the implementation and verification of an extendable and flexible QoS allocation and resource management system based on the bandwidth broker model for realizing the IETF differentiated service (DiffServ). Focusing on the bandwidth issue over single administrative domain, the implemented system provides real-time resource reservation and allocation, delayed call admission control, simple QoS negotiation between sewer and users, and simple resource monitoring. The implemented system is verified by evaluating the performance of a resource-intensive application over the real-world testbed network.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.947-956
• /
• 2003

The current IP Routing Protocolspacket networks also need to provide the network QoS based of DiffServ, RSVP, MPLStraffic model which is standardized as IETF reference model for NGN. The first topic of this paper is to propose Traffic-Balanced Routing Protocol(TBRP) to process existing best effort traffic. TBRP will process low priority interactive data and background data which is not sensitive to dealy. Secondly Hierarchical Traffic-Traffic-Scheduling Routing Protocol(HTSRP) is also proposed. HTSRP is the hierarchical routing algorithm for backbone and access networkin case of fixed-wireless convergence network. Finally, HTSRP_Q is proposed to meet the QoS requirement when user want interactive or streaming packet service. This protocol will maximize the usage of resources of access layer based on the QoS parameters and process delay-sensitive traffic. Service classes are categorized into 5 types by the user request, such as conversational, streaming, high priority interactive, low priority interactive, and background class. It could be processed efficiently by the routing protocolstraffic model proposed in this paper. The proposed routing protocolstraffic model provides the increase of efficiency and stability of the next generation network thanks to the routing according to the characteristic of the specialized service categories.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.