Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korea Society for Simulation
Journal Basic Information
Journal DOI :
The Korea Society for Simulation
Editor in Chief :
Volume & Issues
Volume 12, Issue 4 - Dec 2003
Volume 12, Issue 3 - Sep 2003
Volume 12, Issue 2 - Jun 2003
Volume 12, Issue 1 - Mar 2003
Selecting the target year
Application of Stochastic Optimization Method to (s, S) Inventory System
Chimyung Kwon ;
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 1~11
In this paper, we focus an optimal policy focus optimal class of (s, S) inventory control systems. To this end, we use the perturbation analysis and apply a stochastic optimization algorithm to minimize the average cost over a period. We obtain the gradients of objective function with respect to ordering amount S and reorder point s via a combined perturbation method. This method uses the infinitesimal perturbation analysis and the smoothed perturbation analysis alternatively according to occurrences of ordering event changes. Our simulation results indicate that the optimal estimates of s and S obtained from a stochastic optimization algorithm are quite accurate. We consider that this may be due to the estimated gradients of little noise from the regenerative system simulation, and their effect on search procedure when we apply the stochastic optimization algorithm. The directions for future study stemming from this research pertain to extension to the more general inventory system with regard to demand distribution, backlogging policy, lead time, and review period. Another directions involves the efficiency of stochastic optimization algorithm related to searching procedure for an improving point of (s, S).
Design of the Scheduler using the Division Algorithm Based on the Time Petri net
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 13~24
In this study, we propose a scheduling analysis method of the Flexible management system using the transitive matrix. The Scheduling problem is a combination-optimization problem basically, and a complexity is increased exponentially for a size of the problem. To reduce an increase of a complexity, we define that the basic unit of concurrency (short BUC) is a set of control flows based on behavioral properties in the net. And we propose an algorithm to divide original system into some BUC. To sum up, we divide a petri net model of the Flexible management system Into the basic unit of concurrency through the division algorithm using the transitive matrix. Then we apply it to the division-scheduling algorithm to find an efficient scheduling. Finally, we verify its efficiency with an example.
Efficient Management of Proxy Server Cache for Video
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 25~34
Because of explosive growth in demand for web-based multimedia applications, proper proxy caching for large multimedia object (especially video) has become needed. For a video object which is much larger in size and has different access characteristics than the traditional web object such as image and text, caching the whole video file as a single web object is not efficient for the proxy cache. In this paper, we propose a proxy caching strategy with the constant-sized segment for video file and an improved proxy cache replacement policy. Through the event-driven simulation under various conditions, we show that our proposal is more efficient than the variable-sized segment strategy which has been proven to have higher hit ratio than other traditional proxy cache strategies.
Dynamic Cache Partitioning Strategy for Efficient Buffer Cache Management
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 35~44
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.
Performance Improvement of ASIP Assembly Simulator Using Compiled Simulation Technique
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 45~53
This paper presents a retargetable compiled assembly simulation technique for fast ASIP(application specific instruction processor) simulation. Development of ASIP which satisfies design requirements in various fields of applications such as telecommunication, wireless network, etc. needs formal design methodology and high-performance relevant software environments such as compiler and simulator In this paper, we employ the architecture description language(ADL) named
to automatically synthesize an instruction-level compiled assembly simulator. A compiled simulation has benefit of time efficiency to interpretive one because it performs instruction fetching and decoding at compile time. Especially, in case of assembly simulation, instruction decoding is usually a time-consuming job(string operation), so the compiled simulation of assembly simulation is more efficient than that of binary simulation. Performance improvement of the compiled assembly simulation based on
is exemplified with an ARM9 architecture and a CalmRISC32 architecture. As a result, the compiled simulation is about 150 times faster than interpretive one.
A Performance Estimation Simulation of Grouping Method for Performance Elevation under Mobile Database Environment
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 55~62
The explosive Increase of wireless networks and the advancement of mobile devices lead to the expansion of mobile environment. In accordance with the development of mobile environment, the need to use mobile database is increased sharply, and also it accompanies the related problems. The current mobile database system is based on the centralized method from which a synchronized server manages multiple mobile database management system to synchronize. From this mobile system architecture, several kinds of problems can be detected such as the management of synchronization issues between mobile databases and the transaction management issues. Furthermore, the current mobile database management system does not consider any solution on the fault tolerance. To solve those problems, this paper proposes the mobile agent-based mobile database management system. The proposed system provide high confidence and efficiency by enhancing the network efficiency and fault tolerance through the mobile grouping.
Attacker and Host Modeling for Cyber-Attack Simulation
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 63~73
The major objective of this paper is to propose the method of attacker and host modeling for cyber-attack simulation. In the security modeling and simulation for information assurance, it is essential the modeling of attacker that is able to generate various cyber-attack scenarios as well as the modeling of host, which is able to represent behavior on attack concretely The security modeling and simulation, which was announced by Cohen, Nong Ye and etc., is too simple to concretely analyze attack behavior on the host. And, the attacker modeling, which was announced by CERT, Laura and etc., is impossible to represent complex attack excepting fixed forms. To deal with this problem, we have accomplished attacker modeling by adopted the rule-based SES which integrates the existing SES with rule-based expert system for synthesis and performed host modeling by using the DEVS formalism. Our approach is to show the difference from others in that (ⅰ) it is able to represent complex and repetitive attack, (ⅱ) it automatically generates the cyber-attack scenario suitable on the target system, (ⅲ) it is able to analyze host's behavior of cyber attack concretely. Simulation tests performed on the sample network verify the soundness of proposed method.
Simulation of Solitary Beam Interaction in Kerr Media
Journal of the Korea Society for Simulation, volume 12, issue 2, 2003, Pages 75~89
This paper describe numerical experiments with solitary beams in a self focusing Kerr medium with fast response. Through formal analogies, it compare this results on the phase sensitivity of beam collision with known predictions about one dimensional soliton interaction. For incoherent oblique beam interaction, there occurs a non-periodic coupled-mode type transfer of energy, resulting in complete transmission each beam through the other one.