• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.8-12
• /
• 2004

In this study we consider a CONWIP system in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied are backordered according to the number of demands that exist at their arrival instants. For this system we develop an approximation method to calculate order based performance measures such as the mean time of fulfilling a customer order and the mean number o: customer orders. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. Numerical tests show that the approximation method provides fairly good estimation of the performance measures of interest.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.380-390
• /
• 1994

In this paper, we propose an equal-cost bifurcated routing algorithm which may be useful in practical computer network design problem. The performance of the routing algorithm is evaluated using the conventional Monte Carlo simulation and a transient queueing approximation. The relative errors between the closure approximation and the Monte Carlo simulation was fairly small. The closure approximation may be used to evaluate the performance of the load splitting algorithms, which results in considerable execution time reduction. The performance of the proposed algorithm is compared to that of the known algorithms based on average packet delay. For networks that have many non-disjoint equal-paths, the proposed algorithm performed better than other algorithms.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.406-415
• /
• 2009

In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.17-24
• /
• 2008

The effect of the variable packet size on the LRD characteristic of the MMPP traffic model is investigated. When we generate packet traffic for the performance evaluation of IP packet network, MMPP model can be used to generate packet interarrival time. And a random length of packet size from a certain distribution can be assigned to each packet. However, there is a possibility that the variable packet size might change the LRD characteristic of the original MMPP model. In this study, we investigate this possibility. For this purpose the 'refined traffic' is defined, where packet arrival time is generated according to the MMPP model and a random packet length from a specific distribution is assigned to each generated packet. Hurst parameter of the refined traffic is estimated and compared with the original Hurst parameter, which is the input parameter of the MMPP model. We also investigate the effect of the packet size distribution on the queueing performance of the MMPP traffic model and the relationship between the Hurst parameter and queueing performance.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.138-145
• /
• 2001

In this paper, we propose fuzzy closed BCMP queueing network model for the performance evaluation of distributed processing system. Which has the ambiguous service requirements of job to servers and service rates of server according to network environments. This model can derive the measures for system Performances using fuzzy mean value analysis which can process the fuzzy factors. Computer simulation has been performed for verifying the effectiveness of derived equations of performance evaluation according to service requirements of job and the numbers of clients.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.1
• /
• pp.14-22
• /
• 2002

We propose the fuzzy BCMP queueing network model for the performance evaluation of distributed processing system with the ambiguous arrival rates of job, service requirements, and service rates of server by the network environments. This model is classified as the open and closed type whether or not the network accepts jobs from the system outside. We derived the measures for system performances such as the job average spending time, average job number in the system and server utilizations using fuzzy mean value analysis which can process the fuzzy factors for both types. Computer simulation was performed for verifying the effectiveness of derived equations of performance evaluation. The fuzzy BCMP queueing network model was evaluated according to the fuzzy arrival rates of job, the number of clients, and the fuzzy service requirements of job for each the open and closed type. The results were agreed with the predicted performance evaluations of the system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.3
• /
• pp.172-182
• /
• 2013

In this study we consider a flow line CONWIP system in which two types of product are produced. The processing times of each product type at each station follow an independent exponential distribution and the demands for the finished products of each type arrive according to a Poisson process. The demands that are not satisfied instantaneously are either backordered or lost according to the number of unsatisfied demands that exist at their arrival instants. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts of each product type at each station, mean waiting times of backordered demands and the proportion of backordered demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a two class closed queueing network with a synchronization station and analyze the closed queueing network using a product-form approximation method for multiple classes developed by Baynat and Dallery. In the approximation method, each subsystem is analyzed using a matrix geometric method. Comparisons with simulation show that the approximation method provides fairly good results for all performance measures.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.154-168
• /
• 2021

COVID-19 has been spreading all around the world, and threatening global health. In this situation, identifying and isolating infected individuals rapidly has been one of the most important measures to contain the epidemic. However, the standard diagnosis procedure with RT-PCR (Reverse Transcriptase Polymerase Chain Reaction) is costly and time-consuming. For this reason, pooled testing for COVID-19 has been proposed from the early stage of the COVID-19 pandemic to reduce the cost and time of identifying the COVID-19 infection. For pooled testing, how many samples are tested in group is the most significant factor to the performance of the test system. When the arrivals of test requirements and the test time are stochastic, batch-service queueing models have been utilized for the analysis of pooled-testing systems. However, most of them do not consider the false-negative test results of pooled testing in their performance analysis. For the COVID-19 RT-PCR test, there is a small but certain possibility of false-negative test results, and the group-test size affects not only the time and cost of pooled testing, but also the false-negative rate of pooled testing, which is a significant concern to public health authorities. In this study, we analyze the performance of COVID-19 pooled-testing systems with false-negative test results. To do this, we first formulate the COVID-19 pooled-testing systems with false negatives as a batch-service queuing model, and then obtain the performance measures such as the expected number of test requirements in the system, the expected number of RP-PCR tests for a test sample, the false-negative group-test rate, and the total cost per unit time, using the queueing analysis. We also present a numerical example to demonstrate the applicability of our analysis, and draw a couple of implications for COVID-19 pooled testing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1148-1159
• /
• 1997

In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1178-1180
• /
• 1987

The resequence delay is an important performance measure in a store-and-forword computer network where messages go out of order while traversing logical channel. An analysis of the total delay including resequence delay is presented for M/M/L queueing system with 2 class heterogeneous servers and improvement of delay performance is investigated by simulation.