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

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.1-10
• /
• 1988

We consider a vacation system in which the server takes two different types of vacations alternately. We obtain the server idle probability and derive the system size distribution and the waiting time distribution by defining supplementary variables. We show that the decomposition property works for these mixed-vacation queues. We also propose a method directly to obtain the waiting time distribution without resorting to the system equations. The T-policy is revisited and is shown that the cost is minimized when the length of vacations are the same.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.1 no.1
• /
• pp.51-64
• /
• 2002

This paper analyzes performance measures of a Bluetooth_based mobile home network system. The home network system consists of terminals with Bluetooth interfaces, access points (AP), a home PC, and a gateway A mobile host in wireless terminals uses Mobile IP for supporting the mobility This paper considers four types of data traffic, which are new connection traffic, handoff traffic, Internet data traffic, and control data traffic and suggests a queueing system model of the home network system, where the AP and the home PC are modeled as M/G/1 with four priority queues and the gateway is modeled as M/G/1 with a single queue The generation rate and service time of individual traffic influence their performance measures. Based ell the suggested model, we propose the elapsed time of data traffic in terms of the number of cells, the number of Home PCs, arrival rates of four types of traffic and the service rates of AP/Home PCs/Gateway To analyze influences on the elapsed time with respect to arrival rate of four types of traffic, some examples are given.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.1 s.4
• /
• pp.85-96
• /
• 2004

The study begin with a basic concept, if the occupancy length of vehicle detector is directly proportional to the delay of vehicle. That is, it analogize vehicle's delay of a occupancy time. The results of a study was far superior in the estimation of a queue length. It is a very good points the operator is not necessary to optimize s1, s2, Thdoc. Thdoc(critical congestion degree) replaced 0.7 with 0.2 - 0.3. But, if vehicles have been experience in delay was not occupy vehicle detector, the study is in existence some problems. In conclusion, it is necessary that stretch queue detector or install paired queue detector. Also I want to be made steady progress a following study relation to this study, because it is required traffic signal control on congestion.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.1
• /
• pp.30-37
• /
• 2016

A multi-server queueing system with an infinite buffer and impatient customers is analyzed. The system operates in the finite state Markovian random environment. The number of available servers, the parameters of the batch Markovian arrival process, the rate of customers' service, and the impatience intensity depend on the current state of the random environment and immediately change their values at the moments of jumps of the random environment. Dynamics of the system is described by the multi-dimensional asymptotically quasi-Toeplitz Markov chain. The ergodicity condition is derived. The main performance measures of the system are calculated. Numerical results are presented.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.3
• /
• pp.66-75
• /
• 2017

Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.111-117
• /
• 2001

Most of the techniques for the performance estimation of unit-load AS/RS are a static model or computer simulation. Especially, their models have been developed under the assumption that the Storage/Retrieval (S/R) machine performs either single command(SC) or dual command(DC) only. In reality, depending on the operating policy and the status of the system at a particular time, the S/R machine performs a SC or a DC, or becomes idle. In order to resolve this weak point, we propose a stochastic model for the performance estimation of unit-load ASIRS by using a M/G/1 queueing model with a single server and two queues. Server utilization, expected numbers of waiting storage and retrieval commands and mean time spent in queue and system are found.

• Journal of Advanced Navigation Technology
• /
• v.18 no.4
• /
• pp.347-352
• /
• 2014

In this paper, we propose a Markovian queueing model(M/M/1)-based call admission control to reduce forced terminating rate of non-real secondary user's call for Multi-services Cognitive Radio Networks. A existing control has a problem that the forced terminating rate increases because of adopting a policy of spectrum priority allocation to real calls. In our scheme the rate can be reduced as the call that has no useful spectrum waits in a queue until getting an available spectrum. Our scheme use a neural-net based prediction of primary user's reappearance. Through the simulation, we analysis the call forced terminating rate, access delay and spectrum utilization efficiency, and then show that our scheme can more reduce the forced terminating rate of the call, compared to that of the existing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.86-92
• /
• 2011

In this paper, we propose a novel hardware MPI(Message Passing Interface) unit which supports message passing in multiprocessor system which use distributed memory architecture. MPI Hardware unit processes data synchronization, transmission and completion, and it supports processor non-blocking operation so it reduces overhead according to synchronization. Additionally, MPI hardware unit combines ready entry, request entry, reserve entry which save and manage the synchronized messages and performs the multiple outstanding issue and out of order completion. According to BFM(Bus Functional Model) simulation result, the performance is increased by 25% on many to many communication. After we designed MPI unit using HDL, with synopsys design compiler we synthesized, and for synthesis library we used MagnaChip $0.18{\mu}m$. And then we making prototype chip. The proposed message transmission interface hardware shows high performance for its increase in size. Thus, as we consider low-cost design and scalability, MPI hardware unit is useful in increasing overall performance of embedded MPSoC(Multi-Processor System-on-Chip).

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.73-84
• /
• 1994

Output analysis is one of the most important fields of simulation to achieve the accurate simulation results. This study shows how to analyze simulation output data in the steady state using Procrustes analysis technique which has not been used in the field of simulation yet. In this paper Procrustes analysis method is used to perform the analysis of simulation output efficiently and effectively by applying the improved version of the method. The experiments are conducted using M/M/1 queueing simulation model. The results obtained by Procrustes analysis method show better estimates for average waiting times and average queue lengths which are closer to true values and narrower confidence intervals than when replication-deletion method is used. Also it requires the smaller number of simulation runs.