• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.2
• /
• pp.103-109
• /
• 2020

This paper finds solutions for using ZigBee in wireless networked control system (WNCS). The round trip time delay and packet loss rate of the WNCS are measured. On the basis of these measured data, a playback buffer is used to solve the variable time delay in WNCS, and a Smith predictor is introduced to compensate for the time delay. The WNCS was able to be actually constructed to perform DC motor position control with 40 Hz sampling frequency.

• The Journal of the Acoustical Society of Korea
• /
• v.8 no.5
• /
• pp.95-101
• /
• 1989

For developing new algorithms or dedicated hardware by using general purpose Digital Signal Processor chip, emulator H/W and simulator S/W are indispensible. But the most of DSP emulators have limitations on H/W flexibility according to their generalized architectures. In this paper, a DSP evaluation system for real time signal processing was developed using TMS 32020. The I/O buffers storing acquisition data of the system were designed to have variable length $(1\sim2048samp1es) &$ sampling frequency $l00\sim8KHz$.

• Journal of the Korean Mathematical Society
• /
• v.40 no.1
• /
• pp.87-107
• /
• 2003

In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail behavior of the queue length of the system is equivalent to that of the same queueing system with the D-BMAP being replaced by a batch renewal process. In the finite buffer case (of buffer size K), we derive upper and lower bounds of the asymptotic behavior of the loss probability as $K\;\longrightarrow\;\infty$.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.721-724
• /
• 2010

In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1669-1679
• /
• 1996

In this paper, we address the problem of how to replace huffers in multimedia database systems with time-varying skewed data access. The access pattern in the multimedia database system to support audio-on-demand and video-on-demand services is generally skewed with a few popular objects. In addition the access pattem of the skewed objects has a time-varying property. In such situations, our analysis indicates that conventional LRU(least Recently Used) and LFU(Least Frequently Used) schemes for buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural suited. We propose a new buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural Networks)using a neural network for multimedia database systems with time-varying skewed data access. The major role of our neural network classifies multimedia objects into two classes:a hot set frequently accessed with great popularity and a cold set randomly accessed with low populsrity. For the classification, the inter-arrival time values of sample objects are employed to train the neural network.Our algorithm partitions buffers into two regions to combine the best roperties of LRU and LFU.One region, which contains the 핫셋 objects, is managed by LFU replacement and the other region , which contains the cold set objects , is managed by LRUreplacement.We performed simulation experiments in an actual environment with time-varying skewed data accsee to compare our algorithm to LRU, LFU, and LRU-k which is a variation of LRU. Simulation resuults indicate that our proposed algorthm provides better performance as compared to the other algorithms. Good performance of the neural network-based replacement scheme means that this new approach can be also suited as an alternative to the existing page replacement and prefetching algorithms in virtual memory systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.629-642
• /
• 1996

ATM switch handles the traffic for a wide range of appliations with different QOS(Quality-of-Service) requirements. In ATM switch, the priority control mechanism is needed to improve effectively the required QOS requirements. In this paper, we propose a priority control mechanism using the cell transfer ratio type and discard threshold in order to archive the cell loss probability requirement and the delay requirement of each service class. The service classes of our concern are the service class with high time priority(class 1) and the service class with high loss priority control mechanism, cells for two kind of service classes are stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the shole range of the buffer and cells for class 1 are allocated up to discard threshold of the buffer. In case cells in the buffer are transmitted, one cell for class 1 is transmitted whenever the maximum K cells for class 2 are transmitted consecutively. We analyze the time delay and the loss probability for each class of traffic using Markov chain. The results show that the characteristics of the mean cell delay about cells for class 1 becomes better and that of the cell loss probability about cells for class 2 becomes better by selecting properly discard threshold of the buffer and the cell transfer ratio according to the condition of input traffic.

• Proceedings of the KSR Conference
• /
• 2009.05a
• /
• pp.1618-1623
• /
• 2009

In this paper, we describe the design method of carbody structure with side-buffer. Recently railroad industry has a new interest with stability, fixed time, low environment pollution and mass transportation. Accidents have little on the railroad but railroad industry is trying to minimize carbody damage and passenger injury in case of accidents. So a side-buffer having anti-climber is applied to meet each special needs. Carbody with side-buffer is assembled with aluminum(6005A-T6) parts that are extruded. As the results of the study, it is showed that carbody with side-buffer has sufficient energy absorbtion about crashworthiness.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.16 no.1
• /
• pp.123-136
• /
• 2018

The objective of this study is to propose a new methodology to fabricate a reliable engineering-scale buffer block, which shows homogeneous and uniform distribution in buffer block density, for in-situ experiments. In this study, for the first time in Korea, floating die press and CIP (Cold Isostatic Press) are applied for the manufacture of an engineering-scale bentonite buffer. The optimized condition and field applicability are also evaluated with respect to the method of manufacturing the buffer blocks. It is found that the standard deviation of the densities obtained decreases noticeably and that the average dry density increases slightly. In addition, buffer size is reduced by about 5% at the same time. Through the test production, it is indicated that the stress release phenomenon decreases after the application of the CIP method, which leads to a reduction in crack generation on the surface of the buffer blocks over time. Therefore, it is confirmed that the production of homogeneous buffer blocks on industrial scale is possible using the method suggested in this study, and that the produced blocks also meet the design conditions for dry density of buffer blocks in the AKRS (Advanced Korea Reference Disposal System of HLW).