• IE interfaces
• /
• v.12 no.2
• /
• pp.312-318
• /
• 1999

This paper considers the cell loss probability(CLP) in a multiplexer with the superposition of heterogeneous ON/OFF sources. The input traffic is composed of k classes. Traffic of class i is the superposition of M_(i) ON/OFF sources. Recently, the method based on the Markov modulated deterministic process(MMDP) is presented. Basically, it is the discretized model of stochastic fluid flow process(SFFP) and gives the CLP very fast, but under-estimates the CLP especially when the value of estimated CLP is very low. This paper develops the discretized model of Markov modulated Poisson process(MMPP). It is a special type of switched batch Bernoulli process(SBBP). Combining the transition probability matrix of MMDP and SBBP according to the state which is characterized by the arrival rate, this paper presents hybrid algorithm. The hybrid algorithm gives better estimate of CLP than that of MMDP and faster than SBBP.

• Communications for Statistical Applications and Methods
• /
• v.11 no.3
• /
• pp.631-641
• /
• 2004

In this paper, a model for an inventory whose stock decreases with time is considered. When a deliveryman arrives, if the level of the inventory exceeds a threshold $\alpha$, no stock is delivered, otherwise a delivery is made. It is assumed that the size of a delivery is a random variable Y which is exponentially distributed. After assigning various costs to the model, we calculate the long-run average cost and show that there exist unique value of arrival rate of deliveryman $\alpha$, unique value of threshold $\alpha$ and unique value of average delivery m which minimize the long-run average cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1206-1218
• /
• 1992

Token ring systems which control to switch the data stream of networks by passing the token have been widely used to medium access controls in many ring or bus topology LANs. The system could be modeled for analysis as single-server-multi-queue system of the cyclic service method. These concepts could be expanded to multi-token ring systems interconnected with single ring consisting of bridges implemented simply to be stored and transmitted. In the proposal for the performance analysis of the interconnected token ring system, in has been assumed M/G/1 queueing model that frame arrivals are the Poisson process at each station queue and frame sizes are independently and identically distributed. And the average time delays were analyzed mathematically for arbitrary frame transferred from source station to destination area. The time delay of the frame transmission could be explained as the sum of the average time which the token passed from arbitrary position to source station, such as the waiting time in the source station transferring the previous arrival frames, and the propagation time from source station to interdestinated point. These delays were given as the sum of the duration from inner and outer bridge queues, the time delays from inner and outer bridge queues, and the time from outer bridge queue to destination station. These results were investigated by varing parameters effected to total time delays. In the results, those factors to be effected to dominant the total time delays were increased were in the cases of the high arrival rates and the high ration of destination of the other outerring. The system were shown the time delays increased exponentially in spite of the priority service policy. In order to decreasing the number of outerrings and increasing the number of nodes in backbone relatively, so the systems could be decreased the total delay in the interconnected token ring system.

• Geophysics and Geophysical Exploration
• /
• v.16 no.3
• /
• pp.109-118
• /
• 2013

On and near the 23-m high earthen Cheongcheon dam in Boryeong City, Korea, short seismic refraction and surface-wave profiles were conducted using a 5-kg sledgehammer. From vertical and horizontal components of the seismic waves, near-surface P-wave velocities (${\nu}_p$) and S-wave velocities (${\nu}_s$) were derived by inverting first-arrival refraction times and dispersion curves of Rayleigh waves. Average ${\nu}_p$ and ${\nu}_s$ for the Jurassic sedimentary basement were determined to be 1650 and 950 m/s at a depth of 30 m directly beneath the dam and 1650 m/s and 940 m/s at a depth of 10 m at the toe of the dam, respectively. The dynamic Poisson's ratio for these strata were therefore in the range of 0.24 to 0.25, which is consistent with ratios for consolidated sedimentary strata. Near a 45-m borehole 152 m downstream from the dam crest, an SH tomogram indicates a refraction boundary with an average ${\nu}_s$ of 870 m/s at depths of 10 ~ 12 m. At this site, the overburden comprises the upper layer with relatively constant ${\nu}_p$ and ${\nu}_s$ around 500 and 200 m/s, respectively, and the lower layer in which both ${\nu}_p$ and ${\nu}_s$ increase with depth almost linearly. The dynamic Poisson's ratios for the overburden were in the range of 0.30 to 0.43.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.11
• /
• pp.47-55
• /
• 2004

In this paper, an enhanced time-based registration method is proposed. The method reduces the registration cost when a mobile terminal stays in a cell for a long time. We also analyze the performance of the proposed method numerically. In the analysis, we assume Poisson call arrival distribution and exponential cell resident time. From the analysis we calculate the optimal time-interval. Additionally, limit cost analysis is made to investigate the behaviors in the limit conditions. To compare the performance of the proposed method with the original time-based registration method, we analyze the performance of the original time-based registration method. In the comparisons, we see that the proposed enhanced time-based registration method has better performance and is applicable to the PCS systems.

• Transactions of the Korean Society of Pressure Vessels and Piping
• /
• v.9 no.1
• /
• pp.62-69
• /
• 2013

A probabilistic assessment code, PRO-LOCA ver. 3.7 which was developed in an international co-operative research program, PARTRIDGE was evaluated by conducting sensitivity analysis. The effect of some variables such as simulation methods (adaptive sampling, iteration numbers, weld residual stress model), crack features(Poisson's arrival rate, maximum numbers of cracks, initial flaw size, fabrication flaws), operating and loading conditions(temperature, primary bending stress, earthquake strength and frequency), and inspection model(inspection intervals, detectable leak rate) on the failure probabilities of a surge line nozzle was investigated. The results of sensitivity analysis shows the remaining problems of the PRO-LOCA code such as the instability of adaptive sampling and unexpected trend of failure probabilities at an early stage.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.8
• /
• pp.31-38
• /
• 1995

In this paper, we consider the leaky bucket parameter dimensioning problem in the presence of the cell delay variation(CDV) which arises at the customer premises network dud to the multiplexing with other traffic streams. We consider an ATM multiplexer in which a single CBR stream and several heterogeneous VBR traffic streams are multiplexed. Choosing an MMPP model for the bursty traffic streams, we derive an (MMPP+DD)/D/1/K queueing model for the evaluation of the CDV experienced by the CBR stream. We first evaluate the equilibrium queue length distribution embedded at tagged-cell arrival-time instants, based on whcih we calcuate the inter-cell time distribution and the distribution kof the number of tagged-cell departures in an arbitrary interval. Then we apply the analysis to the dimensionging problem of the leaky bucket parameters, examining how the employed traffic model affects the determination of the bucket size. Through numerical examples, we confirm that the Poisson traffic model can underestimate the bucket size, thus causing a considerable blocking probability for compliant use cells while the MMPP model can optimally design the bucket size which keeps the blocking probability under the target value.

• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.241-247
• /
• 2008

In this study we consider an M/D/1 queue with a finite buffer. Due to the finiteness of the buffer capacity arriving customers can not join the system and turn away without service when the buffer is full. Even though a computational method for blocking probabilities in an M/D/1/K queue is already known, it is very complex to use. The aim of this study is to propose a new way to compute blocking probability by using (max,+)-algebra. Our approach provide a totally different and easier way to compute blocking probabilities and it is, moreover, immediately applicable to more generous queueing systems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.24
• /
• pp.149-154
• /
• 1991

The one of the important problems in the design of queueing systems is the decision of the order of service stations. The object of this problem is the decision of the order that minimizes the expected sojourn time per customer in the given arrival process and service time distributions. In this paper, the tandem queueing system in series is studied with the emphasis on the optimal order of the tandem queueing system which has three stations with single servers. In one system, customers arrive at the first station with Poisson process. This system is composed of service stations with a constant, a general distribution and a Exponential distribution is studied. To select the optimal order after the orders of each pair of two stations is decided, it is compared the two orders of system. With this results, total expected delay of the systems which has three stations is compared. The result is the best that service station with constant time is on the first place, then the service station with general distribution and the service station with Exponential distribution is followed. And the other system is consist of service stations with a constant and two probabilistic distributions. In this case, two probabilistic distributions has a non-overlapping feature. It is the optimal order that the service station with constant time is on the first place then the service station with longer service time and the service station with shorter service time is followed.