• Journal of Communications and Networks
• /
• 제5권1호
• /
• pp.82-89
• /
• 2003

In this paper, an efficient threshold-based filtering (TF) buffer management scheme is proposed. The TF is capable of minimizing the overall loss performance and improving the fairness of buffer usage in a shared buffer packet switch. The TF consists of two mechanisms. One mechanism is to classify the output ports as sctive or inactive by comparing their queue lengths with a dedicated buffer allocation factor. The other mechanism is to filter the arrival packets of inactive output ports when the total queue length exceeds a threshold value. A theoretical queuing model of TF is formulated and resolved for the overall packet loss probability. Computer simulations are used to compare the overall loss performance of TF, dynamic threshold (DT), static threshold (ST) and pushout (PO). We find that TF scheme is more robust against dynamic traffic variations than DT and ST. Also, although the over-all loss performance between TF and PO are close to each other, the implementation of TF is much simpler than the PO.

• 한국정보과학회논문지:데이타베이스
• /
• 제27권4호
• /
• pp.549-561
• /
• 2000

데이터베이스 관리 시스템(DBMS)에서의 부분 철회는 수행 중인 트랜잭션 전체를 철회하지 않고 일부분만을 철회할 수 있는 유용한 기능으로 많은 관계형 DBMS(RDBMS)에서 지원되고 있다. 그러나, RDBMS와는 달리 객체지향 DBMS(OODBMS)에서는 객체 버퍼와 페이지 버퍼로 구성되는 이중의 버퍼구조를 유지하므로 페이지 버퍼만을 유지하는 RDBMS에서 사용하던 기존의 부분 철회 방식을 그대로 이용할 수 없다. 따라서, 이러한 이중 버퍼 내의 데이터를 효과적으로 부분 철회할 수 있는 새로운 회복 방법이 필요하다. 본 논문에서는 이중 버퍼구조를 사용하는 OODBMS를 위한 네가지 부분 철회 방식들을 제안한다. 제안된 부분 철회 방식들은 부분 철회의 주요 대상인 버퍼의 구조에 따라 단일 버퍼 기반 부분 철회, 소프트 로그를 이용한 이중 버퍼 기반 부분 철회, 그리고 섀도우를 이용한 이중 버퍼기반 부분 철회 방식으로 세분화한다. 수학적 분석 및 실험을 통한 성능 평가에 의하면 이중 버퍼 기반 부분 철회 방식의 성능이 가장 우수한 것으로 나타났다.

• 한국멀티미디어학회논문지
• /
• 제6권5호
• /
• pp.842-848
• /
• 2003

ATM 망에서 GFR 서비스는 TCP/IP에 기초를 둔 비실시간 트래픽을 지원하기 위해 고안되었다. GFR 서비스에 있어서 서비스 품질보장을 만족시키기 위한 중요한 요소 중의 하나는 버퍼관리이다 즉, ATM 스위치에서 untagged된 셀에 대해 MCR(Minimum Cell Rate)을 보장하기 위해서는 효율적인 버퍼관리가 필요하다. 본 논문에서는 GFR서비스에서 비실시간트래픽에 대한 효율적인 트래픽제어를 통하여 공평성과 수율을 향상시킬 수 있는 버퍼관리 기법을 제안하였다. 제안된 알고리즘의 성능을 평가하기 위하여 시뮬레이션을 통하여 공평성과 수율을 기존의 기법과 비교하였다. 시뮬레이션 결과 제안된 기법이 기존의 기법보다 공평성과 수율면에서 향상되었음을 확인 할 수 있었다.

• 한국시뮬레이션학회논문지
• /
• 제12권2호
• /
• pp.35-44
• /
• 2003

The effectiveness of buffer cache replacement algorithms is critical to the performance of I/O systems. In this paper, we propose the degree of inter-reference gap (DIG) based block replacement scheme that retains merits of the least recently used (LRU) such as simple implementation and good cache hit ratio (CHR) for general patterns of references, and improves CHR further. In the proposed scheme, cache blocks with low DIGs are distinguished from blocks with high DIGs and the replacement block is selected among high DIGs blocks as done in the low inter-reference recency set (LIRS) scheme. Thus, by having the effect of the partitioning the cache memory dynamically based on DIGs, CHR is improved. Trace-driven simulation is employed to verified the superiority of the DIG based scheme and shows that the performance improves up to about 175% compared to the LRU scheme and 3% compared to the LIRS scheme for the same traces.

• 한국정보처리학회논문지
• /
• 제7권2S호
• /
• pp.721-732
• /
• 2000

Multimedia communication systems require not only high-performance computer hardwares and high-speed networks, but also a buffer management mechanism to process many data efficiently. Two buffer handling methods, Push and Pull, are commonly used. In the Push method, a server controls the flow of dat to a client, while in the Pull method, a client controls the flow of data from a server. Those buffering schemes can be applied to the data transfer between the packet receiving buffer, which receives media data from a network server, and media playout devices, which play the recived media data. However, the buffer management mechanism in client-sides mainly support either one of the Push or the Pull method. Consequently, they have some limitations to support various media playout devices. Futhermore, even though some of them support both methods, it is difficult to use since they can't provide a unified structure. To resolved these problems, in this paper, we propose an efficient and flexible Push/Pull buffer management mechanism at client-side. The proposed buffer management scheme supports both Push and Pull method to provide various media playout devices and to support buffering function to absorb network jitter. The proposed scheme can support the various media playback devices using a single buffer space which in consequence, saves memory space compared to the case that a client keeps tow types of buffers. Moreover, it facilitates the single buffer as a mechanism for the absorbing network jitter effectively and efficiently. The proposed scheme has been implemented in an existing multimedia communication system, so called ISSA (Integrated Streaming Service Architecture), and it shows a good performance result compared to the conventional buffering methods in multimedia communication environments.

• 디지털콘텐츠학회 논문지
• /
• 제14권2호
• /
• pp.215-222
• /
• 2013

낸드 플래시 기반 SSD는 HDD와 비교하여 많은 장점을 가지고 있다. 하지만 임의 접근 쓰기 요청은 임의 접근 읽기 요청이나 연속 접급 쓰기와 읽기에 비하여 SSD의 접근성을 떨어뜨리고 수명을 단축시키는 문제점을 발생시킨다. 이런 문제점을 해결하기위해 SSD 내부에서는 낸드 플래시 메모리의 일부분을 로그 블록으로 관리하는 기법과 DRAM 혹은 비휘발성 메모리를 쓰기 버퍼로 관리하는 기법들이 제안되었다. 하지만 지금까지 로그 블록 관리와 쓰기 버퍼 관리는 다른 계층에서 연구되어왔다. 즉 로그블록 관리는 쓰기 버퍼의 상태를 고려하지 않았고 또한 쓰기 버퍼 관리 기법도 로그 블록의 상태를 고려하지 않았다. 본 논문에서는 처음으로 로그 블록과 쓰기 버퍼 사이의 관련성을 통해 두 계층의 통합관리의 필요성을 제시한다. 그리고 통합된 쓰기 버퍼 설계를 위해 세 가지 고려해야할 사항을 제공한다.

• 전자공학회논문지A
• /
• 제33A권6호
• /
• pp.23-32
• /
• 1996

This paper proposes a new buffer management scheme to service delay-sensitive traffic and loss-sensitive traffic fairly in ATM networks. The proposed scheme uses tow buffers for delay-sensitive traffic and loss-sensitive traffic. To satisfy the average delay time of delay-sensitive traffic, cells in real-time buffer are served first. When congestion occurs in nonreal-time buffer, low loss priority cell in real-time buffer can be pushed out by high loss priority cell in nonreal-time buffer can be transferred to real-time buffer considering threshold value in real-time buffer. Using computer simulation, the existing methods and proposed scheme are compared and analyzed with respect to cell loss rate and average delay time. Simulation results show that the proposed scheme have superior performance to conventional schemes.

• 한국경영과학회지
• /
• 제31권1호
• /
• pp.117-129
• /
• 2006

In this paper, we consider broadband satellite networks using MF-TDMA (Multi-Frequency Time Division Multiple Access) scheme. We analyze the number of expected lost packets in each terminal, and mathematically formulate optimal buffer and timeslot allocation model to minimize the weighted sum of the numbers of expected lost packets. We also suggest optimal buffer and timeslot allocation scheme based on Lagrangean relaxation technique to solve the proposed model in a fast time. Extensive experiments show that the proposed scheme provides encouraging results.

• ETRI Journal
• /
• 제27권1호
• /
• pp.1-12
• /
• 2005

We propose a heuristic buffer management scheme that uses both positive and negative acknowledgments to provide scalability and reliability. Under our scheme, most receiver nodes only send negative acknowledgments to their repair nodes to request packet retransmissions while some representative nodes also send positive acknowledgments to indicate which packets can be discarded from the repair node's buffer. Our scheme provides scalability because it significantly reduces the number of feedbacks sent by the receiver nodes. In addition, it provides fast recovery of transmission errors since the packets requested from the receiver nodes are almost always available in their buffers. Our scheme also reduces the number of additional retransmissions from the original sender node or upstream repair nodes. These features satisfy the original goal of treebased protocols since most packet retransmissions are performed within a local group.

• ETRI Journal
• /
• 제27권6호
• /
• pp.725-732
• /
• 2005

The reconfiguration management scheme changes a logical topology in response to changing traffic patterns in the higher layer of a network or the congestion level on the logical topology. In this paper, we formulate a reconfiguration scheme with a shared buffer-constrained cost model based on required quality-of-service (QoS) constraints, reconfiguration penalty cost, and buffer gain cost through traffic aggregation. The proposed scheme maximizes the derived expected reward-cost function as well as guarantees the required flow's QoS. Simulation results show that our reconfiguration scheme significantly outperforms the conventional one, while the required physical resources are limited.