• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.81-95
• /
• 2001

This paper models and evaluates the AAL multiplexer to analyze AAL protocol in ATM networks. We consider an AAL multiplexer in which a single periodically determinsitic CBR traffic stream and several variable size bursty background traffic streams are multiplexed and one ATM cell stream goes out. We model the AAL multiplexer as a B/sup X/ + D/D/1/K queue and analyze this queueing system. We represent various performance measures such as loss probability and waiting time in the basis of cell and packet.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.423-428
• /
• 1990

A mixed IP formulation is presented which concurrently routes and sequences the tasks on the MRS, reflecting the flexible characteristics. As a preliminary work for the performance evaluation of the MRS, a two robot system working on independent tasks is studied. Models for three types of the system capable of simple error recovery function are established using queueing model, and performances are evaluated and analysed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.99-107
• /
• 1997

We consider a multiechelon repairable-item inventory system where several bases are supported by a central depot and the external repair facilities. Unlike METRIC- based models, there are only a finite number of repair channels at each base, central depot and the external repair facilities. It is desired to find repair capacities and spares level which together guarantee a specified service level at minimum cost. Closed queueing network theory is used to model the stochastic process. The purpose of this paper is to derive the steady-state distributions of this system.

• Water for future
• /
• v.20 no.4
• /
• pp.267-278
• /
• 1987

This study aims at the decision of geomorphologic instantaneous unit hydrograph(GIUH) model parameter fore the ungaged or the data deficiented Basin, to analyze rainfall runoff relation in river basin by applying queueing theory with geomorphologic factors.The concept of GIUH model is based upon the principle of queueing theory of rain drops which may follow many possible routes during rainfall period within watershed system to ist outlet. Overland flow and stream flow can be simulated, respectively, by linear reservoir and linear channel conceptual models. Basically, the model is a mon-lineal and time variant hydrologic system model. The techniques of applying are adopted subarea method and mean-value method, the watershed is divided according to its stream number and order. To prove it to be applicable, the GIUH model is applied to the Wi-Stream basin of Nak-Dong River(Basin area; 475.53$\textrm{km}^2$), southen part of Korea. The simulated and the observed direct runoff hydrographs are compared with the peak discharge, times to peak and coefficients of efficiency, respectively, and the results show quite satisfactory.Therefore, th GIUH model can be extensively applied for the runoff analysis in the ungaged and the data deficiented basin.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.383-395
• /
• 2001

Recent measurement and simulation studies have revealed that wide area network traffic displays complex statistical characteristics-possibly multifractal scaling-on fine timescales, in addition to the well-known properly of self-similar scaling on coarser timescales. In this paper we investigate the performance and network engineering significance of these fine timescale features using measured TCP anti MPEG2 video traces, queueing simulations and analytical arguments. We demonstrate that the fine timescale features can affect performance substantially at low and intermediate utilizations, while the longer timescale self-similarity is important at intermediate and high utilizations. We relate the fine timescale structure in the measured TCP traces to flow controls, and show that UDP traffic-which is not flow controlled-lacks such fine timescale structure. Likewise we relate the fine timescale structure in video MPEG2 traces to sub-frame encoding. We show that it is possibly to construct a relatively parsimonious multi-fractal cascade model of fine timescale features that matches the queueing performance of both the TCP and video traces. We outline an analytical method ta estimate performance for traffic that is self-similar on coarse timescales and multi-fractal on fine timescales, and show that the engineering problem of setting safe operating points for planning or admission controls can be significantly influenced by fine timescale fluctuations in network traffic. The work reported here can be used to model the relevant characteristics of wide area traffic across a full range of engineering timescales, and can be the basis of more accurate network performance analysis and engineering.

• Journal of the Korea Society for Simulation
• /
• v.21 no.3
• /
• pp.71-78
• /
• 2012

This research discusses the application of the control variables to achieve a more precise estimation for the target response in queueing network simulation. The efficiency of control variable method in estimating the response depends upon how we choose a set of control variables strongly correlated with the response and how we construct a function of selected control variables. For a class of queuing network simulations, the random variables that drive the simulation are basically the service-time and routing probability random variables. Most of applications of control variable method focus on utilization of the service time random variables for constructing a controlled estimator. This research attempts to suggest a controlled estimator which uses these two kinds of random variables and explore the efficiency of these estimators in estimating the reponses for computer network system. Simulation experiments on this model show the promising results for application of routing probability control variables. We consider the applications of the routing probability control variables to various simulation models and combined control variables using information of service time and routing probability together in constructing a control variable as future researches.

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

• ETRI Journal
• /
• v.24 no.4
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.1-9
• /
• 1998

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

• Journal of KIBIM
• /
• v.5 no.2
• /
• pp.1-11
• /
• 2015

Despite a lot of research on BIM, there is no quantitative study to measure accurately the performance of BIM coordination service. Thus, this study suggested method to measure the performace of BIM coordination services, applying queueing models in the field of management science. To analyze queuing system of BIM coordination services, a group of BIM coordinator were selected. Through focus group interviews with experts were used in the analysis to derive mean arrival rate(${\lambda}$), mean service rate(${\mu}$) of BIM coordination services. Single-server queuing model(M/M/1), multiple server queuing model(M/M/s) is utilized for the BIM coordination services performance measurement in construction phase. This study has significant quantitative performance measurement approaches that can be utilized in the decision-making for the improvement of the BIM coordination services and to support the review of the alternatives accordingly. But There is a limit but it is difficult to take into account the increase or decrease of the cost of alternatives according to the review.