• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.33-39
• /
• 1998

A queueing model for performance evaluation of finite buffered inter-node communication system is proposed in this paper. Each components are modeled as M/M/I/B queues to obtain the steady state probabilities and ar-rival rate and to analyze finite buffer behavior, The overall sysrem is integrated as series queues with blocking. Average delay and throughput are the performance measures studied in this analysis. The analytical results are first validated through simulation. Next, the effect of buffer length is discussed using the proposed model.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1291-1293
• /
• 2007

Due to dense deployment and innumerable amount of traffic flow in wireless sensor networks (WSNs), congestion becomes more common phenomenon from simple periodic traffic to unpredictable bursts of messages triggered by external events. Even for simple network topology and periodic traffic, congestion is a likely event due to dynamically time varying wireless channel condition and contention caused due to interference by concurrent transmissions. In this paper, we have proposed three mechanisms: upstream source count and buffer based rate control and snoop based MAC level ACK scheme to avoid congestion. The simulation results show that our proposed mechanism achieves around 80% delivery ratio even under bursty traffic condition

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.1
• /
• pp.59-73
• /
• 1997

This papaer analyzes a system with consists of two workstations that are separated by finite buffer storage. In this system, we assume that the processing time in each station in a random variable and each station is not vulnerable to failure. To control the in-process inventory in the serial production system we use the (R, r) policy which is similar to the (s, S) policy in the inventory theory. Under the (R, r) policy the preceding station is forced down when the inventory level in the buffer reaches R and starts operation again when the inventory level falls to r. For the model developed, we analyze the system characteristics and the system performances.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.345-348
• /
• 2017

버퍼 오버플로우(Buffer Overflow) 취약점은 시스템 보안에서 아주 중요하다. 본 논문은 바이너리 파일에서 버퍼 오버플로우 취약점을 자동 감지하는 시스템을 제안하였다. 다양한 버퍼 오버플로우 샘플소스를 이용하여 패턴을 만들고, 이렇게 만들어진 패턴을 이용하여 바이너리 파일에서 버퍼 오버플로우 취약점이 포함되어 있는지를 판단한다. 제안한 시스템의 유용성을 위해 실험을 하였고, 어느 정도 의미 있는 결과를 얻을 수 있었다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.47-52
• /
• 1999

In this paper we propose new approximate method for the performance analysis of closed-loop production system with unreliable machines and random processing times. The approximate method decomposes the production system consisting of K machines into a set of K subsystems, each subsystem consisting of two machines separated by a finite buffer. Then, each subsystem is analyzed by analyzing method n isolation. The population constraint of the closed-loop production system is taken into account by prescribing that the sum of average buffer level in the subsystems is equal to the number of customers in the closed-loop production system,. We establish a set of equations that characterizes unknown parameters of the servers in the subsystems. An iterative procedure is then used to determine the unknown parameters. Experimental results show that these methods provide a good estimation of the throughput.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.240-253
• /
• 1999

In this paper we propose new approximate methods for the performance analysis of closed-loop production systems with unreliable machines and random processing times. Each approximate method decomposes the production system consisting of K machines into a set of K subsystems, each subsystem consisting of two machines separated by a finite buffer. Then, each subsystem is analyzed by three different analyzing methods in isolation. The population constraint of the closed-loop production system is taken into account by prescribing that the sum of average buffer levels in the subsystems is equal to the number of customers in the closed-loop production system. We establish a set of equations that characterize unknown parameters of the servers in the subsystems. An iterative procedure is then used to determine the unknown parameters. Experimental results show that these methods provide a good estimation of the throughput.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3642-3651
• /
• 1999

In this paper, we propose a new caching scheme for continuous media data where the buffer allocation unit is divided into two modes : interval and object. All of objects' access patterns are monitored and based on the results of monitoring, a request for an object is decided to cache its data with either interval mode or object mode. The results of our simulation show that our proposed caching scheme is better than the existing caching algorithms such as interval caching where the access patterns of the objects are changed with time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1593-1596
• /
• 2015

실시간 영상회의 시스템은 네트워크 및 버퍼링의 지연으로 사용자 정보의 전달이 시스템 간에 효율적으로 이루어지지 않고 있어 실시간성이 완벽하게 보장되지 않고 있는 것이 현실이다. 하지만, 네트워크 인프라의 보강과 지터 지연에 대한 연구는 활발하지만, 버퍼링에 대한 연구는 미흡한 상태이다. 본 논문에서는 버퍼링 지연에 따른 문제 해결을 위한 FRCB(Frame-Rate Control Buffer) 관리 기법을 제안하고자 한다. FRCB는 버퍼의 Overflow와 Underflow를 방지하기 위한 FTH(Fist-play THreshold)와 STH(Slow-play THreshold)로 구성되며, CPU 부하가 높은 상황에서도 좋은 성능을 보여 고품질의 실시간 영상회의에 적합함을 보였다.

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

Multi-processor system with fast I/O devices improves processing performance and reduces the bottleneck by I/O concentration. In the system, the Performance influenced by shared memory used for exchanging data between processors varies with configuration and utilization. This paper suggests a prediction model for buffer and shared memory optimization under interrupt recognition method using mailbox. Ethernet (IEEE 802.3) packets are used as the input of system and the amount of utilized memory is measured for different network bandwidth and burstiness. Some empirical studies show that the amount of buffer and shared memory varies with packet concentration rate as well as I/O bandwidth. And the studies also show the correlation between two memories.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.12
• /
• pp.66-76
• /
• 1998

In this paper, we implement a buffer capable of handling short loops references to statistically lower the miss rate of variable-length instructions stored in the instruction buffer. MAU(Mark Appending Unit) takes the instructions as they are fetched from external memory, performs some initial decode operations and stores the results of the decode in the buffer for reducing multiple decodes when instructions are executed repeatedly such as in a loop. It includes a decision block of whether hit or not for effectively processing branch instructions Each module of the proposed architecture of processing variable-length instruction is described in VHDL structurally and behaviorally and whether it is working well or not is checked on V-System simulator of Model Technology Inc. We synthesized and simulated the architecture using an ASIC Synthesizer tool with 0.6$\mu\textrm{m}$ 5-Volt CMOS COMPASS library. Operation speed is up to 140MHz. The architecture includes about 17,000 gates.