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

본 논문에서는 GFR이 요구하는 최소 전송률 보장과 높은 공평성을 제공하기 위하여 퍼지 이론을 이용한 버퍼관리 알고리즘을 제안하였다. 제안된 알고리즘은 태깅정보, 전체 버퍼의 점유량, VC의 부하 정도로 구성된 세 개의 파라미터를 이용하여 패킷 폐기를 결정한다. 시뮬레이션 결과 MCR의 크기가 커질수록 제안된 알고리즘의 수율과 공평성이 우수하였으며. 스위치에서 버퍼의 크기 변화에서도 Double-EPD나 DFRA는 비슷한 성능을 보였고, 제안된 알고리즘은 좋은 수율과 공평성을 제공한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.404-406
• /
• 2003

C언어는 포인터형 변수를 제공하며 배열의 경계를 인식하지 않는다. 이러한 특성에서 기인한 버퍼넘침 (buffer overflew)은 널리 알려진 취약점으로서 보안침해 수단으로 널리 악용되고 있다. 이 문제를 해결하기 위한 한 방법으로 오용탐지기술은 버퍼넘침에 공통적으로 사용되는 시그너쳐(Signature)를 가지고 클라이언트(client)가 전송한 패킷을 검사함으로서 고전적인 버퍼넘침을 탐지하고 있다. 본 논문에서는 이러한 탐지 방법을 우회할 수 있는 보다 위협적이고 지능적인 보안침해 가능성을 제시한다.

• Journal of the Korean Vacuum Society
• /
• v.20 no.1
• /
• pp.50-56
• /
• 2011

In this study, the effects of ZnO buffer layer thickness and annealing temperature on the heterojunction diode, ZnO/b-ZnO/p-Si(111), were reported. The effects of those on the structural and electrical properties of zinc oxide (ZnO) films on ZnO buffered p-Si (111) substrate were also studied. Structural properties of ZnO thin films were studied by X-ray diffraction and I-V characteristics were measured by a semiconductor parameter analyzer. ZnO thin films with 70 nm thick buffer layer and annealing temperature of $700^{\circ}C$ showed the best c-axis preferred orientation. The best electrical property was found at the condition of buffer layer annealing temperature of $700^{\circ}C$ and 50nm thick ZnO buffer layer (resistivity: $2.58{\times}10^{-4}[{\Omega}-cm]$, carrier concentration: $1.16{\times}1020[cm^{-3}]$). The I-V characteristics for ZnO/b-ZnO/p-Si(111) heterojunction diode were improved with increasing buffer layer thickness at buffer layer annealing temperature of $700^{\circ}C$.

• Journal of KIISE:Databases
• /
• v.37 no.6
• /
• pp.308-314
• /
• 2010

As the price of flash memory continues to drop and the technology of flash SSD controller innovates, high performance flash SSDs with affordable prices flourish in the storage market. Nevertheless, it is hard to expect that flash SSDs will replace harddisks completely as database storage. Instead, the approach to use flash SSD as a cache for harddisks would be more practical, and, in fact, several hybrid storage architectures for flash memory and harddisk have been suggested in the literature. In this paper, we propose a new approach to use flash SSD as an extended buffer for main buffer in database systems, which stores the pages replaced out from main buffer and returns the pages which are re-referenced in the upper buffer layer, improving the system performance drastically. In contrast to the existing approaches to use flash SSD as a cache in the lower storage layer, our approach, which uses flash SSD as an extended buffer in the upper host, can provide fast random read speed for the warm pages which are being replaced out from the limited main buffer. In fact, for all the pages which are missing from the main buffer in a real TPC-C trace, the hit ratio in the extended buffer could be more than 60%, and this supports our conjecture that our simple extended buffer approach could be very effective as a cache. In terms of performance/price, our extended buffer architecture outperforms two other alternative approaches with the same cost, 1) large main buffer and 2) more harddisks.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.121-128
• /
• 2005

Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.137-146
• /
• 2002

In VOD server, in order to guarantee playback of continuous media, such as video, without hiccups for multiusers, the server has to manage its buffer sophisticatedly by prefeching a part of the data into the buffer As the continuous media data buffered by one user can be used again by the others, the number of disk accesses is reduced and then the latency time far the users is also reduced. In this paper, we propose a new buffer management technique for continuous media in VOD server. Our basic algorithm partitions the buffer into groups and then a group of buffer which has the lowest utilization is chosen and partitioned again for a new user. The basic algorithm is extended for supporting multiple streams and clip data and for providing VCR functions. Our proposed technique is able to increase in the number of concurrent users as increasing the utilization of the buffer and to minimize the average waiting time for multiuser accesses as the bandwidth of storage is slowly reached to the limit. In the simulation study for comparing the performance of our technique with that of the existing techniques, we show that the average waiting time is reduced mere than 50% and the number of concurrent users increases by 1 ∼5% as compared with those of the exiting techniques.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.797-809
• /
• 2006

To support the QoS streams for large scale clients, the internal resources of VOD servers should be utilized based on the characteristics of the streaming media service. Among the various resources in the server, the main memory is used for the buffer space to the media data loaded from the disks and the buffer hit ratio has a great impact upon the server performance. However, if the buffer data with high hit ratio are replaced for the new media data as a result of the number of clients and the required movie titles are increased, the negative impact on the scalability of server performance is occurred. To address this problem, the buffer replacement policy considers the intrinsic characteristics of the streaming media such as the sequential access to large volume data and the highly disproportionate preference to specific movies. In this paper, the preference-based segment buffer replacement policy is proposed in the cluster-based VOD server to exploit the characteristics of the streaming media. Since the proposed method reflects both the temporal locality by the clients' preference and the spatial locality by the sequential access to media data, the buffer hit ratio would be improved as compared to the existing buffer replacement policy. The enhanced buffer hit ratio causes the fact that the performance scalability of the cluster-based VOD server is linearly improved as the number of cluster nodes is increased.

• Journal of the Society of Naval Architects of Korea
• /
• v.39 no.3
• /
• pp.57-63
• /
• 2002

This paper describes a control algorithm for the buffer of a deep-sea mining system, in which the buffer is connected to a long slender pipe and then to a surface ship on one end, and to a collector on sea floor through a flexible hose on the other end. A mathematical modeling is established for designing the controller for buffer thrusters, in which the dynamic response of the long pipe is taken into account based on the mode superposition method. The fluid loading acting on the pipe is estimated by using Morison's formula. For simplicity, the surface ship is assumed to be kept stationary, the reaction from the flexible hose is ignored and only the lateral motions are considered. In order to guide the buffer to react only to the low-frequency motion of the surface vessel, the FIR digital filter is introduced to a PID-based controller It can be shown numerically that the high frequency component of the ship's motion can be effectively filtered out by using the FIR low pass filter.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.68-74
• /
• 2007

Critical Chain Project Management(CCPM) is a new project management system paradigm which maintains the advantages of PERT/CPM and improves the shortcomings of it. In CCPM the task durations are determined as 50% time estimates, ie average time discarding the their contingency. CCPM determines the critical chain the constraint of a projects considering the logical precedence relationship and resource conflict resolution. Project buffer is located at the end of critical chain to absorb the variations of critical chain. The size of project buffer is usually calculated as the half of the sum of critical chain length. Also feeding buffer is inserted after each non-critical chain which feeding into the critical chain to prevent the time delay of critical chain from uncertainties of non-critical chains. Resource buffer can be utilized to improve the availability of resources of critical chain. Buffer management is a project execution and control mechanism. Buffers are classified into 3 zones. They are OK zone, Watch and Plan zone and Expediting zone. If the project status is within Watch and Plan zone, contingency plan is established. And if it changes into Expediting zone, the preplanned contingency plan are executed to recover the time delay. In CCPM the workers are asked to work with relay runner work mechanism that they work fast if possible and report their completion to project manager for the succeeding task to start as soon as possible. The task durations are not considered as the promised time schedule. The multi-tasking is prohibited.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.8
• /
• pp.19-27
• /
• 2016

Nowadays the adaptive buffering techniques for burst stream packet configuration and its operation algorithm to save energy in IP core network have been studied. This paper explains the selection method of packet buffering interval for energy saving when configuring burst stream packet at the ingress router in IP core network. Especially the adaptive buffering interval and its implementation scheme are required to improve the energy saving efficiency at the input part of the ingress router. In this paper, we propose the best adaptive buffering scheme that a current buffering interval is adaptively buffering scheme based on the input traffic of the past buffering interval, and analyze its characteristics of energy saving and end-to-end delay by computer simulation. We show the improvement of energy saving effect and reduction of mean delay variation when using an appropriate inverse-function selecting the buffering interval for the configuration of burst stream packet in this paper. We confirm this method have superior properties compared to other method. The proposed method shows that it is less sensitive to the various input traffic type of ingress router and a practical method.