• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.117-124
• /
• 1998

As window sized increases, the throughput input-buffered packet switch with a window scheme improves on random traffic condition. However, the improvement diminishes quickly under bursty traffic. In this paper, we propose Burst Head Addressable FIFO mechanism and memory structure having search capability in unit of burst header to compensate the sensitiveness of the windowed scheme to bursty traffic. The performance of a input-buffered switch using the proposed Burst Header Addressable FIFO input buffer was analyzed using computer simulations. The maximum throughput of the conventional FIFO scheme approaches an asymptotic value 0.5 as mean burst length increases. The maximum throughput of the proposed scheme is greater than that of the conventional scheme for any mean burst length and window size.

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

• The Journal of Information Technology
• /
• v.1 no.2
• /
• pp.65-79
• /
• 1998

In this thesis, a buffer alloction and management algorithm is proposed in order to satisfy the QoS of CBR/VBR traffics incomming to ATM networks. Proposed traffic menagement algorithm is based on the route seperation mechanism that allocates buffers acoording to traffic characterics, and sets threshold to allocated buffers. We developed a cell scheduling algorithm and evaluated cell delay and loss probability characteristics according to incomming traffic classes. The cell scheduling algorithm uses buffer size thresholds to control overload traffic flow.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.514-520
• /
• 2004

In WDM networt a WDM buffer is one of essential elements for realizing all-optical packet switching system. In this paper, we propose and demonstrate a single loop type all-optical WDM buffer system. The proposed one consists of NOLM and feedback loop, and provides more than 40 turns buffering (more than 20${\mu}\textrm{s}$) for single input pulse (1550nm, width: 20㎱) before selected by control signal pulse (1553nm, width: 30㎱).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.349-352
• /
• 2002

다단계 상호연결 네트워크 (multistage interconnection network : MIN) 동작 연구에 있어서 가장 중요한 것 중의 하나가 네트워크 사이클의 운영 방법이라 할 수 있다. 일반적인 MIN 기반 교환기 구조에서 최악의 경우는 수신 버퍼 모듈이 비어있어서 셀이 가장 앞쪽의 버퍼 위치로 움직여야만 하는 상황에서 발생한다. 그러나 실제적으로는 입력 로드의 실질적인 크기에 대해서 대부분의 버퍼 모듈들은 거의 항상 확 차게 된다. 그렇기 때문에 일반적인 체계의 긴 네트워크 사이클은 대역폭의 낭비를 가져오게 된다. 본 논문에서는 이런 문제점을 수정하여 고안한 단위 단계 버퍼링 체계를 사용하여 입력 버퍼에 관한 분석 모델을 제안하였다. 이 제안된 체계는 매개변수의 수와 상태전이 다이어그램에 있어서 기존의 모델링 기법들보다 매우 단순하다. 제안된 모델과 시뮬레이션의 처리율 및 지연시간의 비교를 통해서 제안된 모델의 정확성을 검증하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.386-390
• /
• 2004

유무선 혼합 망에서 GFR서비스의 최소대역, 효율 및 트래픽 제어를 위한 버퍼관리 기법 등을 유무선 혼합망의 셀기반 네트워크에서 가중치를 높이는 시뮬레이션을 통해 공평성을 입증하는 연구를 한다. GFR서비스는 TCP/IP 패킷의 품질보장과 베스트 에포트 트래픽에 대한 최소의 대역폭 보장을 하며, 가용 대역폭에 대한 공평성 있는 대역할당을 지원해야 하기 때문에 버퍼관리를 통한 셀 폐기와 셀 스케줄링 둥이 중요한 요소이다. 본 논문에서는 유무선 혼합 네트워크에서 MCR을 보장하기 위하여 버퍼의 사용 가능한 영역의 활성 VC에 각 VC가중치를 비례해 할당하는 per-VC 어카운트에 기초한 트래픽 제어의 버퍼관리에 대한 유동적 WBA알고리즘을 제안하고 GFR 서비스의 효율 및 공평성을 유무선 혼합 망 셀 기반의 스위치를 이용하여 시뮬레이션으로 결과를 보인다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.95-102
• /
• 2003

The buffering is a promising solution to resolve the contention problem in optical network. we study the packet loss probability and the dimensioning of optical buffer using a Fiber Delay Line for variable length packet. In this paper, we study the relation between the granularity and the loss of FDL buffer in Single-Stage FDL buffer and propose the Single-Bundle Multi-Stage FDL buffer. The Multi-Stage FDL buffer is too early yet to apply to the current backbone network, considering the current technology in view of costs. but we assume that the above restriction will be resolved in these days. The appropriate number of delay and pass line for a dimensioning is based on a amount of occupied time by packets. Once more another multi-stage FDL buffer is proposed, Split-Bundle multi-stage FDL buffer. The Split-Bundle ms-FDL buffer is more feasible for a FDL buffer structure, considering not only a size of switching matrix but also a bulk of switching element. its feasibility will be demonstrated from a loss probability.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.375-384
• /
• 2001

The shared disk file systems use a technique known as file system journaling to support recovery of metadata on the SAN(Storage Area Network). In the existing journaling technique, the metadata that is dirtied by one host must be updated to disk space before some hosts access it. The system performance is decreased because the disk access number is increased. In this paper, we describe a new recovery technique using a global buffer to decrease disk I/O. It transmits the dirtied metadata into the other hosts through Fibre Channel network on the SAN instead of disk I/O and supports recovery of a critical data by journaling a data as well as metadata.