• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.96-103
• /
• 2014

A steady-state controllable M/G/1 queueing model operating under the (TN) policy is considered where the (TN) policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or the time instant when Nth customer arrives at the system after T time units elapsed without customers' arrivals during that time period. After deriving the necessary system characteristics such as the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time in the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, the optimal values of the decision variables included in the operating policies are determined by minimizing the total expected cost function per unit time to operate the system under consideration.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.2
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.11
• /
• pp.25-39
• /
• 1992

Due to the data processing development by the computer, the early warning system recently has made a remarkable evolution in its functions and performance as a component of the communication and control system which is also supported by the computer communication and intelligence system. In this paper it is presented that a integrated data processing system is designed to integrate the information sent from the various radar systems which constitute an early warning system. The suggested system model of this paper is devided into two types of structures, the centralized model and the distributed model, according to the data processing algorithm. We apply the queueing theory to analyse the performance of the designed models and the OPNET system kernel to make the analysing program with C language. From the analysis of the queueing components by applying the analysis programs to the designed systems, we got the tendancies and characteristics of both models, that is, a fast data processing performance of the distributed model and a stable data processing capability of the centralized model.

• The Korean Journal of Applied Statistics
• /
• v.23 no.6
• /
• pp.1179-1190
• /
• 2010

Management of the existing traffic network and understanding current traffic conditions is the most important and effective way to solve traffic congestion. This research investigates the status of Korea expressway through the Speed-Flow-Density diagram and finds the best suitable queueing model for each area. Dynamic structure in the queueing model enables us to reflect the structural change of the road in case of traffic congestion. To find the best model and estimate the parameters, we use the Newton-Raphson method. Finally, we examine the road efficiency in view of the optimal speed and density using the conditional distribution of speed and density of a S-F-D diagram.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.1
• /
• pp.1-10
• /
• 1992

In the already presented paper, the performance analysis of SMUX was need a lot of time bacause of recussive method, So this paper proposed the new mathematical method for the SMUX's performance. And it is constructed and analyzed the queueing model for SMUX based on the Go-back N retransmission ARQ model. It is assumed that it has the infinite buffer and a single server. It is analzied the parameters that have influence on the byffer and a single server. It is analzied the parameters that have influence on the buffer behaviour of statistical multiplexer overflow probabilities. maximum buffer size. mean wating time and mean buffer size, and these relationship are represented the graphs and datas which provided a guide to the buffer design problem. As these results. it is efficient when the SMUX is apphed that the traffic density is below 0.5 and transmission error probabilities is below 10­$^3$. So this paper can be applied to the basic and theoretical background prior to the implementation of SMUX.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.253-256
• /
• 2000

In general, Automated Storage/Retrieval Systems (AS/RS ) have racks of equal sized cells to utilize the concept of unit-load. Most of the techniques for the performance estimation of a unit-load AS/RS are a static model or computer simulation. Especially, their models were developed under assumption that the Storage/Retrieval (S/R) machine performs only single command (SC) or dual command (DC). In reality, defending on the operating policy and the status of the system at a particular time, the S/B machine performs a SC or a DC, or becomes .: idle. In order to resolve these weak points, we propose a stochastic model for the performance estimation of unit-load AS/RS by using a single-server queueing model. Expected numbers of waiting storage and retrieval commands are found

• Journal of the military operations research society of Korea
• /
• v.12 no.1
• /
• pp.87-105
• /
• 1986

Among the various types of waiting line systems, the elevator servicing system is quite different from the usual queueing system in view of the service characteristics. For example, the FIFO discipline is not always valid depending upon the situation when the direction of first-come customer's is opposite of the operating elevator direction and at that time a later-arrived one has a luck to be served first. In this paper, a simulation model is constructed and tested by the sample data and the results have turned out to be fairly adequate. This model, therefore, will provide a good guide to anyone who is interested in the decision of optimal location selection of no-passenger elevator in high buildings whatsoever. This model is also available, with slight modification, to the problem of city bus dispatching or any other waiting line problems where the servicing equipments are moving.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.135-138
• /
• 2023

In this paper, we study real-time error in the context of monitoring a binary information source through a delay system. To derive the average real-time error, we model the delay system as a discrete time Geo/D/1/1 queueing model. Using a discrete time three-dimensional Markov chain with finite state space, we analyze the queueing model. We also perform some numerical analysis on various system parameters: state transition probabilities of binary information source; transmission times; and transmission frequencies. When the state changes of the information source are positively correlated and negatively correlated, we investigate the relationship between transmission time and transmission frequency.

• 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 Korea Society of Industrial Information Systems
• /
• v.9 no.3
• /
• pp.32-37
• /
• 2004

This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.