• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.755-767
• /
• 1997

Analyzing autocorrelated data set is still an open problem. Developing on easy and efficient method for severe positive correlated data set, which is common in simulation output, is vital for the simulation society. Bootstrap is on easy and powerful tool for constructing non-parametric inferential procedures in modern statistical data analysis. Conventional bootstrap algorithm requires iid assumption in the original data set. Proper choice of resampling units for generating replicates has much to do with the structure of the original data set, iid data or autocorrelated. In this paper, a new bootstrap resampling scheme is proposed to analyze the autocorrelated data set : the Threshold Bootstrap. A thorough literature search of bootstrap method focusing on the case of autocorrelated data set is also provided. Theoretical foundations of Threshold Bootstrap is studied and compared with other leading bootstrap sampling techniques for autocorrelated data sets. The performance of TB is reported using M/M/1 queueing model, else the comparison of other resampling techniques of ARMA data set is also reported.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.261-264
• /
• 1998

Controlled transfer (CT) capability, a new ATM transfer capability (ATC) for high-speed data applications which using credit-based flow control, has recently been proposed and studied in ITU-T. In this paper, we review the existing dyanmic buffer allocation schemes and propose an improved scheme. Also, we compare the performances of the existing buffer allocation methods such as static allocation, flow controlled virtual channels (FCVC), and zero queueing flow control (ZQFC) with the proposed method through simulation. Simulation results show that the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.

• Korean Management Science Review
• /
• v.9 no.1
• /
• pp.3-15
• /
• 1992

In this paper, we study a manufacturing system of serial stages with general service times, in which the production of each stage and the coordination of stages are controlled by Kanban discipline. This Kanban discipline is modeled as a Discrete Event Dynamic System and a system of recursive equations is applied to study the dynamics of the system. The recursive relationship enables us to compare this Kanban discipline with the other blocking disciplines such as transfer blocking, service blocking, block-and-hold b, and block-and-hold K, and the Kanban is shown to be superior to the other disciplines in terms of makespan and throughput. As a special case, two stages Kanban system is modeled as $C_2/C_2/1/N$ queueing system, and a recursive algorithm is developed to calculate the system performance. In optimizing the system performance, the stochastic optimization approach of Robbins-Monro is employed via perturbation analysis, the way to estimate the stochastic partial derivative based on only one sample trajectory of the system, and the required commuting condition is verified. Then the stochastic convexity result is established to provide second-order optimality condition for this parametric optimization problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.8
• /
• pp.701-709
• /
• 1991

In this paper, an analysis approach for the performance of serial search burst format direct sequence spread spectrum[DS-SS] code aequision system using matched filter is persented. And an acquisition system using digital matched filter is chosen for the analysis by this approach. In this acqusition system, since chip decision should be performaned before matched filter

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.1-13
• /
• 2002

We study a multi-component production/inventory system in which individual components are made to meet various demand types. We assume that the demands arrive according to a Poisson process, but there is a fixed probability that a demand requests a particular kit of different components. Each component is produced by a flow line with several stations. The production of each component is operated by the CONWIP control mechanism. To analyse this system, we propose an approximation method based on aggregation method. In application of the aggregation method, a product-form approximation technique as well as a matrix-geometric method is used. Comparisons with simulation show that the approximation method provides fairly good results.

• IE interfaces
• /
• v.14 no.3
• /
• pp.263-271
• /
• 2001

MPLS LER is located at the boundary of MPLS domain as an ingress or an egress router and plays a role in connecting with the existing Internet. Among the components of the MPLS LER, forwarding engine(FE) is a key device which assigns a label to an IP packet by analyzing the destination address of its header in order to enter the MPLS domain, or restructures the cells from MPLS domain into IP packet by reversely processing. In this paper, we investigate the design of FE by analyzing the traffic performance of its components and estimate the IP packet processing capacity of a FE using queueing model and simulation. It is found that the maximum IP packet processing capacity of the Forwarding Engine is about 150,000 packets/sec.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1518-1527
• /
• 1989

We proposed a technique to design a multimicrocomputer system for real-time parallel processing with an interconnection network which has good network latency time. In order to simplify the performance evaluation and the design procedure under the hard real-time constraints we defined network latency time which takes into account the queueing delays of the networks. We designed a dynamic interconnection network following the proposed technique, and the simulation results show that we can easily estimate the multimicrocomputer system's approximate performance using the defined network latency time before the actual design, so this definition can help the efficient design of the real-time parallel processing systems.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.107-125
• /
• 1993

Modern telecommunication switching systems are SPC(Stored Program Control) machines handling voice, data and other kinds of traffic, in an environment which tends to be fully digital switching and transmission. The throughput of such systems is determined by the real time capacity of its centralized or distributed control processors and by the traffic capacity of the switching network. Designers must verify the traffic and call processing capacity of the switching system and check its performance under traffic load before it is put into service. Verification of traffic and call processing capacity of switching systems is one of the problems treated by teletraffic studies ; teletraffic studies are based on stochastic process, queueing theory, simulations and other quantitative methods of decision making. This study suggests the general methodology to evaluate the throughput and performance of the ISDN switching system. TDX-10 ISDN switching system are employed to give illustrative examples of the methodologies discussed in this study.

• Journal of Korean Institute of Industrial Engineers
• /
• v.13 no.2
• /
• pp.17-34
• /
• 1987

Modern telecommunication switching systems are SPC (Stored Program Control) machines handling voice, data and other kinds of traffic, in an environment which tends to be fully digital switching and transmission. The throughput of such systems is determined by the real time capacity of its centralized or distributed control processors and by the traffic capacity of the switching network. Designers must verify the traffic and call processing capacity of the switching system and check its performance under traffic load before it is put into service. Verification of traffic and call processing capacity of switching systems is one of the problems treated by teletraffic studies; teletraffic studies are based on stochastic process, queueing theory, simulations and other quantitative methods of decision making. This paper reviews the general methodologies to evaluate the throughput and performance of the digital switching system. TDX-10, which is a fully digital switching system under development in ETRI, is employed to give illustrative examples of the methodologies discussed in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2605-2619
• /
• 1996

In this paper, we evaluated performance of mobile exchange control part. Queueing network model is used for modeling of mobile exchange control part. We developed a call control processing and location registration scenartio which has a message exchange function between processors in mobile exchange control part. A network symbol are used the simulation models that are composed of the initialization module, message generation module, message routing module, message processing module, message generation module, HIPC network processing module, output analysis module. as a result of computer simulation, we obtain the processor utilization, the mean queue length, the mean waiting time of control part based on call processing and location registration capacity. The call processing and location registration capacity is referred by thenumber of call attempts in the mobile exchange and must be satisfied with the quality of service(delay time).