• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.453-458
• /
• 2002

Recently, the number of hacking, that use buffer overflow vulnerabilities, are increasing. Although the buffer overflow Problem has been known for a long time, for the following reasons, it continuos to present a serious security threat. There are three defense method of buffer overflow attack. First, allow overwrite but do not allow unauthorized change of control flow. Second, do not allow overwriting at all. Third, allow change of control flow, but prevents execution of injected code. This paper is for allowing overwrites but do not allow unauthorized change of control flow which is the solution of extending compiler. The previous defense method has two defects. First, a program company with overhead because it do much thing before than applying for the method In execution of process. Second, each time function returns, it store return address in reserved memory created by compiler. This cause waste of memory too much. The new proposed method is to extend compiler, by processing after compiling and linking time. To complement these defects, we can reduce things to do in execution time. By processing additional steps after compile/linking time and before execution time. We can reduce overhead.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.314-314
• /
• 1996

We investigate the scheduling problem for periodic job shops with blocking. We develop Petri net models for periodic job shops with finite buffers. A buffer control method would allow the jobs to enter the input buffer of the next machine in the order for which they are completed. We discuss difficulties in using such a random order buffer control method and random access buffers. We thus propose an alternative buffer control policy that restricts the jobs to enter the input buffer of the next machine in a predetermined order. The buffer control method simplifies job flows and control systems. Further, it requires only a cost-effective simple sequential buffer. We show that the periodic scheduling model with finite buffers using the buffer control policy can be transformed into an equivalent periodic scheduling model with no buffer, which is modeled as a timed marked graph. We characterize the structural properties for deadlock detection. Finally, we develop a mixed integer programming model for the no buffer problem that finds a deadlock-free optimal sequence that minimizes the cycle time.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.447-458
• /
• 2021

The quality of experience (QoE) of video streaming is degraded by playback interruptions, which can be mitigated by the playout buffers of end users. To analyze the impact of playout buffer dynamics on the QoE of wireless adaptive hypertext transfer protocol (HTTP) progressive video, we model the playout buffer as a G/D/1 queue with an arbitrary packet arrival rate and deterministic service time. Because all video packets within a block must be available in the playout buffer before that block is decoded, playback interruption can occur even when the playout buffer is non-empty. We analyze the queue length evolution of the playout buffer using diffusion approximation. Closed-form expressions for user-perceived video quality are derived in terms of the buffering delay, playback duration, and interruption probability for an infinite buffer size, the packet loss probability and re-buffering probability for a finite buffer size. Simulation results verify our theoretical analysis and reveal that the impact of playout buffer dynamics on QoE is content dependent, which can contribute to the design of QoE-driven wireless adaptive HTTP progressive video management.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.4
• /
• pp.39-45
• /
• 2020

In the production process, the buffer acts as a buffer to alleviate some of the problems such as delays in delivery and process control failures in unexpected situations. Determining the optimal buffer size can contribute to system performance, such as increased output and resource utilization. However, there are difficulties in allocating the optimal buffer due to the complexity of the process or the increase in the number of variables. Therefore, the purpose of this research is proposing an optimal buffer allocation that maximizes throughput. First step is to design the production process to carry out the research. The second step is to maximize the throughput through the harmony search algorithm and to find the buffer capacity that minimizes the lead time. To verify the efficiency, comparing the ratio of the total increase in throughput to the total increase in buffer capacity.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.685-687
• /
• 2007

In this letter, we propose a new online buffer management algorithm to simultaneously provide diverse multimedia traffic services and enhance network performance. Our online approach exhibits dynamic adaptability and responsiveness to the current traffic conditions in multimedia networks. This approach can provide high buffer utilization and thereby improve packet loss performance at the time of congestion.

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

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.953-960
• /
• 2002

Rel-time application programs have constraints which need to be met between media-data. It is client-leading synchronization that is absorbing variable transmission delay time and that is synchronizing by feedback control and palyout control. It is the important factor for playback rate and QoS if the buffer level is normal or not. This paper, The method of maintenance buffer normal state transmits in multimedia server by appling feedback of filtering function. And synchronization method is processing adaptive playout time for smooth presentation without cut-off while media frame is skip. When audio frame which is master media is in upper threshold buffer level we decrease play out time gradually, low threshold buffer level increase it slowly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.783-792
• /
• 2003

We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K＋B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.6
• /
• pp.353-359
• /
• 2016

In this paper, we propose a high performance L1 cache structure for the high clock CPU. The proposed cache memory consists of three parts, i.e., a direct-mapped cache to support fast access time, a two-way set associative buffer to reduce miss ratio, and a way-select table. The most recently accessed data is stored in the direct-mapped cache. If a data has a high probability of a repeated reference, when the data is replaced from the direct-mapped cache, the data is stored into the two-way set associative buffer. For the high performance and fast access time, we propose an one way among two ways set associative buffer is selectively accessed based on the way-select table (WST). According to simulation results, access time can be reduced by about 7% and 40% comparing with a direct cache and Intel i7-6700 with two times more space respectively.

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