• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.145-156
• /
• 2009

The probability distribution of the repair process should be determined to choose the optimal spare level of a weapon system with a queueing model. Though most weapon systems have a multi-step repair process, previous studies use the exponential distribution for the multi-step repair process. But the PH distribution is more appropriate for this case. We utilize the PH distribution on a queueing model and solve it with MGM(Matrix Geometric Method). We derive the optimal spare level using the PH distribution and show the difference of results between the PH and exponential distribution.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.4
• /
• pp.161-168
• /
• 2009

The most generalized form of the triadic operating policy for an M/G/1 queueing model is developed. It consists of three simple N, T and D operating policies and has a peculiar structure possessing concepts of dyadic policies. Using the concept of the pseudo probability density function of the busy period, its expected busy period for the controllable M/G/1 queueing model is derived. Since the obtained result is the most generalized form the triadic polity, the expected busy periods for all known dyadic policies are recovered as special cases from it.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.10
• /
• pp.1911-1915
• /
• 2009

The problem of determining the proper capacity of electric vehicle charging station is studied in the presented paper. Based on the expected arrival rate and the expected charging time, we calculate the proper capacity that guarantees electric vehicles get service better than a given lower bound which is termed the loss of charging probability. The problem is studied by using certain queueing models. We first formulate the problem as a queueless model of type M/M/n/n, known as the Erlang loss system. And then the M/M/n/K type queueing model is formulated to consider the parking space constraint. Results of the study may be used for designing the electric vehicle charging station.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.153-165
• /
• 1995

Many closed queueing network models have been used as an effective tool to make a preliminary design of FMS. Although a loading/unloading function is an important factor to effect the utilization and throughput of FMS as well as a transfer function and a processing function, the Solberg's model did not clarify the loading/unloading function. In this paper, we propose a closed queueing network model for analyzing a flexible manufacturing system that consists of a load/unload station, a material handling system and a group of workstations for processing jobs, and define the expected utilization and the expected throughput of the FMS. As applications of the proposed model, the cases of a material handling system consisting of a conveyor and the FMS including an inspection station are also formulated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.7
• /
• pp.602-617
• /
• 1990

In this paper, we analyze the performance of D-channel access protocol at the S-reference point for the ISDN user network interface recommended by CCITT. For the case of multipoint access to D-channel, a queueing model of D-channel access protocol is proposed. The delay is analyzed by decomposing it into waiting queue delay and contention delay. The contention delay is decomposed further into vain contention delay and pure contention delay so the analysis of the priority queueing system with symmetrical and asymmetrical arrival rates may be applied. The numerical results obtained are compared with the results of the single station queueing system served by the non-preemptive priority.

• Journal of the Korea Society for Simulation
• /
• v.13 no.1
• /
• pp.41-50
• /
• 2004

The purpose of this paper is to analyse the manager's policy to maximize the profit in a multiple-server queueing facility with a limited queue capacity. We assume that the level of advertizing effects on the arrival rate of customers to the facility. The model without ‘word of mouth effect’ is assumed that the arrival rate is independent on the qualify of service level. We estimate the service quality by the balking rate of customers from system. We extend this to the model with ‘word of mouth effect’. To achieve the maximum profit, the most important factor is the considerably high utilization of facility for both models. Given service rate, we should maintain an effective arrival rate to some extent. To this end, among the available options, an increase of advertizing effort is more desirable than reducing the fee if the service value of customers remains unchanged. We also investigate whether the variability of service time has a significant impact on determining the optimal policy. The cost of service variability is not so expensive as that in a single server model due to the reduced variability of service times in a multiple-server model.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2008.11a
• /
• pp.628-633
• /
• 2008

Tall building construction has been increasing due to the need to maximize land usage. It causes the increase of vertical transportation for workers and materials, which significantly affects the productivity and lifting planning, therefore, has to be made carefully based on the characteristics of the field. However, the existing method to calculate the number of lift is too simple to consider complex and various characteristics in tall building construction. Accordingly, we developed the model for selecting the best system of vertical transportation by using Queueing theory. To find out the situation of the queue of resources such as material and workers, a simulation program will be applied.

• Journal of Communications and Networks
• /
• v.7 no.1
• /
• pp.87-92
• /
• 2005

This paper presents basic queueing analysis contributing to teletraffc theory, with commonly accessible mathematical tools. This paper studies queueing systems with bulk arrivals. It is assumed that the number of arrivals and the expected number of arrivals in each bulk are bounded by some constraints B and (equation omitted), respectively. Subject to these constraints, convexity argument is used to show that the bulk-size probability distribution that results in the worst mean queue performance is an extremal distribution with support {1, B} and mean equal to A. Furthermore, from the viewpoint of security against denial-of-service attacks, this distribution remains the worst even if an adversary were allowed to choose the bulk-size distribution at each arrival instant as a function of past queue lengths; that is, the adversary can produce as bad queueing performance with an open-loop strategy as with any closed-loop strategy. These results are proven for an arbitrary arrival process with bulk arrivals and a general service model.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.547-557
• /
• 2005

In this paper, we investigate the packet delay distribution of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the gated-exhaustive vacation system. We assume that input packets arrive at an optical network unit(ONU) according to general interarrival distribution. We use a discrete time queueing model in order to find the packet delay distribution of the gated-exhaustive system with the primary transmission queue and the secondary input queue. We give some numerical examples to investigate the mean packet delays of the proposed queueing model to analyze the DBA scheme in an EPON.

• Industrial Engineering and Management Systems
• /
• v.15 no.2
• /
• pp.131-142
• /
• 2016

We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.