• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.399-407
• /
• 2004

As the number of IP-users are increasing, it is getting so important for service providers to check the state of the current Internet and their service quality by measuring the traffic quality. We describe a general concept of measurement architecture and internet QoS (Quality of Service) parameters, and we review measurement tools. To meet these requirements, we design and implement the Internet traffic management system.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.57-60
• /
• 2013

본 논문에서는 멀티네트워크 인프라 환경에서 제공되는 단대단 멀티 경로에서 응용이 요구하는 품질 서비스를 보장하기 위한 네트워크 인터페이스 기반 경로 선택 기법을 제안한다. 제안 기법은 셀 네트워크와 애드혹 네트워크로 구성된 멀티네트워크 환경에 응용이 요구하는 경로 탐색을 위해 각 네트워크 QoS 경로 탐색 기법 및 인터페이스 선택 기법 등으로 구성되어있다. 제안하는 기법의 장점은 단대단 경로 탐색 시 멀티경로를 탐색하고 탐색된 경로 중에서 응용이 요구하는 품질을 보장할 수 있는 경로를 제공한다. 성능평가 결과 멀티네트워크 내 플로우들이 안정된 서비스를 제공받는 것으로 확인되었다.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.408-416
• /
• 2005

Quality of service (QoS) provision is an important and indispensable function for multi-service wireless networks. In this paper, we present a new scheduling/admission control frame­work, including an efficient rate-guaranteed opportunistic scheduling (ROS) scheme and a coordinated admission control (ROS­CAC) policy to support statistic QoS guarantee in multi-service wireless networks. Based on our proposed mathematical model, we derive the probability distribution function (PDF) of queue length under ROS and deduce the packet loss rate (PLR) for individual flows. The new admission control policy makes admission decision for a new incoming flow to ensure that the PLR requirements of all flows (including the new flow) are satisfied. The numerical results based on ns-2 simulations demonstrate the effectiveness of the new joint packet scheduling/admission control framework.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.417-422
• /
• 2010

In this paper, we propose a new routing scheme based on the multiple layer routing strategy. This algorithm can guarantee the required QoS while maximizing energy efficiency in wireless sensor networks. The principle contributions of this work are its simplicity, scalability and responsiveness to current network situations. Simulation results indicate the superior performance of our proposed algorithm, while other existing scheme cannot offer such an attractive performance balance.

• Proceedings of the KAIS Fall Conference
• /
• 2006.05a
• /
• pp.482-484
• /
• 2006

최근 휴대용 컴퓨터와 무선통신 기술의 발달로 설치 장소에 관계없이 이동 컴퓨팅 환경에 대한 관심이 증가하고 있다. 하지만 현재 무선망에서는 핸드오버시 이동 단말과의 연결 끊김으로 인한 데이터 손실 및 처리율의 저하를 가져온다. 본 논문에서는 QoS 보장을 위한 핸드오버 모델 기능 및 수행절차를 분석하고, 시뮬레이션을 통한 무선망에서의 성능 분석을 수행하였다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.1
• /
• pp.33-39
• /
• 2011

H.264 decoders usually have pipeline architecture by a macroblock or a 4 ${\times}$ 4 sub-block. The period of the pipeline is usually fixed to guarantee the operation in the worst case which results in many idle cycles and higher data bandwidth. Adaptive pipeline architecture for H.264 decoders has been proposed for efficient decoding and lower the requirement of the bandwidth for the memory bus. However, it requires a controller for the adaptive priority control to utilize the advantage. We propose a smart bus arbiter that replaces the controller. It is introduced to adjust the priority adaptively the QoS (Quality of Service) control of the decoding process. The smart arbiter can be integrated the arbiter of bus systems and it works when certain conditions are met so that it does not affect the original functions of the arbiter. An H.264 decoder using the proposed architecture is designed and implemented to verify the operation using an FPGA.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.49-57
• /
• 2016

In this paper we propose the resource allocation scheme for the overlaid macro-femtocell networks, which considers the type of handovers such as the inter-macrocell, macrocell-to-femtocell, femtocell-to-macrocell, or inter-femtocell in order to guarantee Quality of Service (QoS) and expand the accommodation capacity. Our proposed scheme takes into account the movement of mobile terminals, the QoS degradation, or the load control which trigger handovers in the overlaid networks, before it allocates resources dynamically. Moreover it considers QoS requirements of realtime or non-realtime mobile multimedia services such as video communication, Video on Demand (VoD) and dataa services. Simulation results show that our scheme provides better performances than the conventional one with respect to the outage probability, data transmission throughput and handover failure rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.580-592
• /
• 1997

Since an ATM network consists of a number of VPC/VCC requiring various QoS requirements, the end-to-end QoS for each VPC/VCC should be guaranteed. Although many research works on the traffic control are under study to guarantee the QoS, there have been research efforts to reflect the results of network management functions into the traffic control mechanism. To effectively make use of the performance management functions into the VPC/VCC management, threre is a need for the network manager to rapidly retrieve the relevant information. In this research, the mechanism to effectively retrieve the management information using SNMP is suggested. First of all, we construct the MIBs in the agent for the corresponding VPC/VCC. Also, we suggest the way to retrieve MIB with minimum cost. Mathematical analysis shows that the proposed technique has better performance than that using the existing SNMP.

• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.485-490
• /
• 2011

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA, PCRTT and others. But, these algorithms build a transmission plan per frame unit. So, these algorithms cause frame burst or GOP burst. In order to improve it, MVBAG algorithm build a transmission plan per GOP. But this algorithm may not guarantee QoS when frame's size is abruptly larger or smaller than the computed transmission rate. In this paper, a smoothing algorithm is proposed to enhance MVBAG algorithm's problem. In order to show the proposed algorithm's performance, the proposed algorithm is compared with MVBAG algorithm using various evaluation factors such as number of frames that do not meet the QoS, average transmission rate variability per frame, average transmission rate variability per GOP. Experimental results show that the proposed algorithm outperforms MVBAG algorithm in number of frames that do not meet the QoS.