• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.153-159
• /
• 2005

In this paper, we propose All-Optical WDM Buffer System for resolving the contention of Packets in Optical Packet Switching System. The proposed system consists of tunable wavelength converters based on SOA, N×N AWG, and fiber delay lines. This structure can reduce ASE and cross-talk noise because the contending packets are sent and buffered through each different path determined by a wavelength routing. We also performed buffering experiment for two contending WDM optical pulses with each 50ns width, and found that the contending problem is resolved well.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1391-1394
• /
• 2002

Diffserv에서 제시하고 있는 실시간 서비스에 대한 큐잉기법은 네트워크에서 사용자가 요구하는 다양한 서비스 특성을 배제하고 일반적인 우선순위를 할당하여 처리한다. 그러나, 이 기법은 실시간 서비스의 특징이 서로 다르고 요구되는 조건이 서로 다른 서비스에 대한 고려를 충분히 하고 있지 못하다. 따라서, 요구되는 조건이 서로 다른 다양한 서비스에 대한 서비스 품질(QoS;Quality of Service)를 보장하기 위하여, 기존의 버퍼관리 및 스케줄링 기법이 가지는 한계를 해결하기 위하여, 본 논문에서는 다양한 트래픽 특성에 따라 우선순위에 차등을 주어 효과적인 버퍼관리를 할 수 있는 방안을 제시하고 마른 동작을 위하여 기존의 복잡한 연산을 간략화 함으로써 스케줄러의 성능을 높인다. 또한, 기존의 버퍼관리 및 스케줄러와 시뮬레이션을 통하여 성능을 평가하고, 제안하는 버퍼관리기법과 스케줄링을 적용하고 구현하기 위하여, 다양한 실시간 서비스와 비실시간 서비스를 수용하고 있는 임베디드 RG(Residential Gateway)에 제안하는 우선순위 버퍼관리와 스케줄러를 구현한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.543-552
• /
• 2004

This paper proposes an energy optimization technique for latency and quality constrained video applications. It consists of two key techniques: frame-skipping technique and buffering technique. While buffering increases the slack time utilization at the OS level. frame skipping Increases the slack time itself at the application level, and both enhance the effectiveness of the dynamic voltage scaling technique. We use an H.263 encoder application as a test vehicle to which the proposed technique is applied. Experiments demonstrate that the proposed technique achieves noticeable energy reduction satisfying the given latency and video quality constraints.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.6
• /
• pp.989-1000
• /
• 2013

Mobile devices use VPN solution to transfer information securely through open network in mobile office environment. In this paper, we propose Pre_Buffered mechanism that improves the throughput of IPSec VPN using low performance H/W crypto Token. Pre_Buffered method precompute key stream, store them in Buffer and use them in IPSec engine for IP packet processing. Moreover, Design, analysis, and experimental results prove the efficiency and feasibility of our proposed method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1161-1174
• /
• 2021

UDP is an unreliable data transmission protocol, in contrast to TCP, which implements reliable data delivery based on flow control and retransmission methods. However, the TCP operation algorithm for guaranteeing reliability is inefficient in improving transmission performance, and above all, there is no need to transmit data using the TCP method for fields that do not require perfect integrity. In this paper, we intend to discuss ways to improve the stability while maintaining the existing performance of UDP. To this end, a program applied with packet buffering and relaying techniques was developed, and the performance and stability of the experiment were verified.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.75-89
• /
• 2006

LBS (Location-Based Service) systems have become a serious subject for research and development since recent rapid advances in wireless communication technologies and position measurement technologies such as global positioning system. The architecture named the GALIS (Gracefully Aging Location Information System) has been suggested which is a cluster-based distributed computing system architecture to overcome performance losses and to efficiently handle a large volume of data, at least millions. The GALIS consists of SLDS and LLDS. The SLDS manages current location information of moving objects and the LLDS manages past location information of moving objects. In this thesis, we implement a monitoring technique for the GALIS prototype, to allow dynamic load balancing among multiple computing nodes by keeping track of the load of each node in real-time during the location data management and spatio-temporal query processing. We also propose a buffering technique which efficiently manages the query results having overlapped query regions to improve query processing performance of the GALIS. The proposed scheme reduces query processing time by eliminating unnecessary query execution on the overlapped regions with the previous queries.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1755-1764
• /
• 1997

In this paper, we proposed the mechanism for the buffer allocation and a cell scheduling method with logical separation a single buffer in the ATm switch, and analyzed the cell loss probability and the delay of each trafic (CBR/VBR/ABR) based on the weighted value and the dynamic cell service scheduling algorithm. The proposed switch buffering system classifies composite trafics incoming to the switch, according to the characteristic of traffic, then stores them in the logically separated buffers, and adopts the round-robin service with weighted value in order to transmit cells in buffers though one output port. We analyzed 4 cell service scheduling algorithms with dynamic round-robinfor each logically separated service line of a single buffer, in which buffers have the respective weighted values and 3 classes on mixed traffic which characteristized by traffic descriptor. In simulation, using SIMCRIPT II.5., we model the VBR and the ABR traffics as ON/OFF processes, and the CBR traffic as a Poisson processes. As the results of analysis according to the proposed buffer management mechanism and cell service algorithm, we have found that the required QoS of each VC can be quaranteed depends on a scale of weighted values allocated to buffers that changed the weighted values, and cell scheduling algorithm.

• Journal of Digital Contents Society
• /
• v.8 no.1
• /
• pp.85-91
• /
• 2007

This paper proposes a new hybrid anti-aliasing method for reducing aliasing appearing on an implicit surface using the point sampling. The hybrid anti-aliasing method is a method that finds differences in the values of pixel shown in Z-buffers for an implicit surface and thereby uses each of three types of Z-buffer. After determining the level of differences, it expresses a 3 dimensional object by using a multi Z-buffer if the level is severe, a double Z-buffer for a middle level, and only the original Z-buffer for a negligible difference. In comparison with the existing method in which multi Z-buffers have been entirely used for enhancing the anti-aliasing effect, the hybrid anti-aliasing method is an efficient method demonstrating an effect similar to the one using a multi Z-buffer while reducing the number of Z-buffers to be used.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.256-258
• /
• 2001

이동 환경에서의 서비스가 대중화 되면서 문제가 되고 있는 것이 바로 이동 호스트의 전력 제어 문제이다. 이동 호스트는 충분한 전력을 얻기 힘들기 때문에 데이터 전송을 받지 않는 경우에는 최소한의 정보만을 교환하는 상태로의 전의가 필수적이다. 현재 IETF의 Seamoby Working Group에서 논의되고 있는 IP 페이징 프로토콜의 경우에는 요구사항과 논리적인 구조만이 정의되어 있다. 현재 정의되어 있는 구조의 문제점은 유휴 (formant) 모드에 있는 이동 호스트에 데이터를 전송하기 위해서는 Dormant Monitoring Agent(DMA)로 전송된 데이터에 대하여 버퍼링이 수행되어야만 한다. 버퍼링의 목적은 이동 호스트의 유휴 모드에서 활성 (active) 모드로 전의 되는 시간 동안의 데이터의 손실을 방지하기 위함이다. 따라서, 하나의 DMA해서 관리해야 하는 이동 호스트가 많은 경우에는 대회의 양이 문제가 된다. 즉, 확장성 문제점이 존재하게 된다. 본 논문은 이러한 문제점을 줄이기 위하여 Domain Name Server(DNS)를 이용한 IP 페이징 제공 방안을 제안한다. 본 메커니즘은 송신자가 DNS에 호스트의 IP주소를 얻고자 하는 경우 IP 페이징 프로토콜을 먼저 이동 호스트의 페이징 에이전트에 전송함으로써 미리 이동 호스트를 활성 모드로 변경하게 함으로써 이전 메커니즘에서 적용되어야 하는 버퍼의 크기를 줄일 수 있는 메커니즘이다.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.722-737
• /
• 2011

In this paper, we propose an estimation of network jitter that occurs when transmitting TCP packets containing MPEG-2 TS in progressive streaming service over wired or wireless Internet networks. Based on the estimated network jitter size, we can calculate required de-jitter buffering time to absorb the network jitter at the receiver side. For this purpose, by exploiting the PCR timestamp existing in the TS packet header, we create a new timestamp information that is marked in the optional field of TCP packet header to estimate the network jitter. By using the proposed de-jitter buffering scheme, it is possible to employ the conventional T-STD buffer model without any modification in the progressive streaming service over IP networks. The proposed method can be applicable to the recently developed international standard, MPEG DASH (dynamic adaptive streaming over HTTP) technology.