• Journal of Industrial Technology
• /
• v.25 no.B
• /
• pp.221-229
• /
• 2005

We present a numerical analysis of the optimal group number for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply M/D/1 queueing model to paging message queues of cells. We also get the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints. Minimizing the average paging delay is important because it means minimizing the amount of bandwidth used for locating mobile terminals. Therefore, the numerical results of this paper will be very useful in PCS system when designing its signalling capacity due to its simplicity and effectiveness.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.99-109
• /
• 2004

In this paper, we investigate the impact of window mechanisms on end to end delay in a series of nodes with constant service times. It is shown that arbitrary combinations of window mechanisms, each applying to an arbitrary subset of data, can be embedded on the nodes without affecting the departure instants from the system if the windows are at least as large as the number of nodes spanned. The window mechanisms are shown to have no impact on the average end to end delay of data. As the condition on the windows is a minimal necessary requirement for full parallelism, the results show that the transparent operation from viewpoint of data transmission can be achieved with minimal resources.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.83-91
• /
• 1999

In order to build and manage an ATM network effectively under several types of control methods, it is necessary to estimate the performance of the equipments in various viewpoints, especially of ATM multiplexer. As for the method to model the input stream into the ATM multiplexer, many researches have been done to characterize it by, such as, fluid flow, MMPP(Markov Modulated Poisson Process), or MMDP (Markov Modulated Deterministic Process). We introduce an MRP(Markov Renewal Process) to model the input stream which has proper structure to represent the burst traffic with high correlation. In this paper, we build a model for aggregated heterogeneous ON-OFF sources of ATM traffic by MRP. We make discrete time MR/D/1/B queueing system, whose input process is the superposed MRP and present a performance analysis by finding CLP(Cell Loss Probability). A simulation is done to validate our algorithm.

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

We consider the M/G/1 with Bernoulli feedback, where the served customers wait in the feedback queue for rework with probability p. It is important to decide the moment of dispatching in feedback systems because of the dispatching cost for rework. Up to date, researches have analyzed for the instantaneous-dispatching model or the case that dispatching epoch is determined by the state of feedback queue. In this paper we deal with a dispatching model whose dispatching epoch depends on main queue. We adopt supplementary variable method for our model and a numerical example is given for clarity.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1998.10a
• /
• pp.323-329
• /
• 1998

In Pusan port, the studies, which analysis container cargo volumes by using forecasting methods and research about container logistics system, etc., have been continuously performed. But, in Pusan port, this study on an evaluation of traffic congestion has been scarcely performed until now. Especially, when changing and extending a berth, and constructing a new port, it is very important to examine this field. And it should be considered. Thus, this paper aims to analysis the effect of ship traffic condition in 2011, to evaluate marine traffic congestion, according to changing ship traffic volumes in Pusan port. To analysis it, we used simulation method and examined the results

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.943-952
• /
• 1999

Models of single-server queues with vacation have been widely used to study the performance of many computer communica-tion and production system. In this paper we use the formula for a wide class of vacation policies and multiple types of vacations based on the M/G/1 queue with generalized vacations and exhaustive service. furthermore we derive the waiting times for many complex vacation policies which would otherwise be to analyze. These new results are also applicable to other related queueing models. if they conform with the basic model considered in this paper.

• Communications for Statistical Applications and Methods
• /
• v.16 no.2
• /
• pp.217-228
• /
• 2009

In this paper, we consider a multi-class queueing system in which different classes of customers have different arrival rates, service rates and class-transition probabilities. We use the fast simulation method to estimate the overflow probability and the expected number of customers of each class at the first time the total number of customers hits a high level. We also discuss the overflow probabilities and the expected number of customers at different loads, respectively.

• Korean Management Science Review
• /
• v.19 no.1
• /
• pp.29-38
• /
• 2002

Due to the rapid increase In the Internet traffic volume, ISPs are faced with the definite need of the expansion of server capacity. In order to Provide prompt services for customers and still prevent excessive facility cost, it is critical to determine the optimum level of internet server capacity. The purpose of this Paper is to provide a simple but effective strategy on the expansion of servers capacity according to the increase in internet traffic. We model an internet server as an M/G/m/m queueing system and derive an efficient method to compute the loss probability which, In turn, Is used as a basis to determine proper server capacity. The Process of estimating the traffic parameter values at each server based on log data analysis is also given. All the procedures are numerically demonstrated through the process of analyzing actual log data collected from a game company.

• Journal of the military operations research society of Korea
• /
• v.15 no.1
• /
• pp.14-27
• /
• 1989

This paper deals with the mission effectiveness of an airfleet, Airfleet operating system consists of a finite number of units performing the several mission types. Earlier works for the mission effectiveness of a fleet is limited to only one mission type and computer simulation approaches. The mission effectiveness. model of a fleet is constructed by three attributes - the mission readiness of the units, the mission reliability and capability of units. The environmental conditions and human factors affecting the mission success are considered together. The solution of the model is obtained by analytical technique. Especially, AOS is considered a closed queueing network with a finite number of units and a single job class. And then, the mission readiness of the units is found by the mean value analysis. The model would be a useful tool to readily evaluate mission effectiveness of a airfleet as it is and provide a criterion for determining the optimal operating policy.

• The Korean Journal of Applied Statistics
• /
• v.21 no.6
• /
• pp.997-1006
• /
• 2008

This paper proposes a new model by combining an infinite-server queueing model for multi-task processing software system with a perfect debugging model based on Markov process with two types of faults suggested by Lee et al. (2001). We apply this model for module and integration testing in the testing process. Also, we compute several measure, such as the expected number of tasks whose processes can be completed and the task completion probability are investigated under the proposed model.