• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.2
• /
• pp.213-224
• /
• 2012

The integrated core network architecture and various mobile subscriber behavior can result in a significant increase of signaling load inside the evolved packet core network proposed by 3GPP in Release 8. Consequently, an authentication signaling analysis can provide insights into reducing the authentication signaling loads and latency, satisfying the quality-of-experience. In this paper, we evaluate the signaling loads in the EPS architecture via analytical modeling based on the renewal process theory. The renewal process theory works well, irrespective of a specific random process (i.e. Poisson). This paper considers various subscribers patterns in terms of call arrival rate, mobility, subscriber's preference and operational policy. Numerical results are illustrated to show the interactions between the parameters and the performance metrics. The sensitivity of vertical handover performance and the effects of heavy-tail process are also discussed.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.9
• /
• pp.1788-1795
• /
• 1992

Numerical simulations have been performed to investigate various spectral estimators used in LDV signal processing. In order to simulate a particle arrival time statistics known as the doubly stochastic poisson process, an autoregressive vector model was adopted to construct a primary velocity field. The conditional Poisson process with a random rate parameter was generated through the rescaling time process using the mean value function. The direct transform based on random sampling sequences and the standard periodogram using periodically resampled data by the sample and hold interpolation were applied to obtain power spectral density functions. For low turbulent intensity flows, the direct transform with a constant Poisson intensity is in good agreement with the theoretical spectrum. The periodogram using the sample and hold sequences is better than the direct transform in the view of the stability and the weighting of the velocity bias for high data density flows. The high Reynolds stress and high fluctuation of the transverse velocity component affects the velocity bias which increases the distortion of spectral components in the direct transform.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.27-35
• /
• 2015

We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.63-79
• /
• 2006

In this study we consider a CONWIP system in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied immediately are either backordered or lost according to the number of demands that exist at their arrival Instants. For this system we develop an approximation method to calculate performance measures such as steady state probabilities of the number of parts at each station, proportion of lost demands and the mean number of backordered demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product-form approximation method. A recursive technique is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method are compared with those obtained by simulation. Comparisons with simulation show that the approximation method provides fairly good results.

• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.62-69
• /
• 2005

This paper presents a queuing analysis model of a PC-based software router supporting IPv6-IPv4 translation for residential gateway. The proposed models are M/G/1/K or MMPP-2/G/1/K by arrival process of the software PC router. M/G/1/K is a model of normal traffic and MMPP-2/G/1/K is a model of burst traffic. In M/G/1/K, the arriving process is assumed to be a Poisson process, which is independent and identically distributed. In MMPP-2/G/1/K, the arriving process is assumed to be two-state Markov Modulated Poisson Process (MMPP) which is changed from one state to another state with intensity. The service time distribution is general distribution and the service discipline of the server is processor sharing. Also, the total number of packets that can be processed at one time is limited to K. We obtain performance metrics of PC-based software router for residential gateway such as system sojourn time blocking probability and throughput based on the proposed model. Compared to other models, our model is simpler and it is easier to estimate model parameters. Validation results show that the model estimates the performance of the target system.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• Geophysics and Geophysical Exploration
• /
• v.14 no.1
• /
• pp.42-49
• /
• 2011

To locate anomalous features including seepage pathways through the Daeryong earth-fill dam, P and Rayleigh waves were recorded along a 250-m profile on the crest of the dam. Seismic energy was generated using a 5-kg sledgehammer and detected by 24 4.5-Hz vertical-axis geophones installed at 3-m intervals. P-wave and apparent S-wave velocities of the reservoir dam and underlying bedrock were then inverted from first-arrival traveltimes and dispersion curves of Rayleigh waves, respectively. Apparent dynamic Poisson's ratios as high as 0.46 were obtained at the base of the dam near its north-east end, where an outlet conduit occurs, and in the clay core body near the south-west end of the profile where the dam was repeatedly grouted to abate seepage before our survey. These anomalies of higher Poisson's ratios in the upper part of clay core were also associated with effusion of grout on the downstream slope of the dam during post-survey grouting to abate leakage. Combining P-wave traveltime tomography and inversion of Rayleigh wave velocities was very effective in detecting potential pathways for seepage and previous grouted zones in this earthen dam.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.26-33
• /
• 2005

Exact prediction of resource demands for future calls enhances the efficiency of the limited resource utilization in resource reservation methods for potential calls in wireless IP networks. In this paper, we propose a LMS-Wiener resource(bandwidth) prediction for future handoff calls, and then an the proposed method is compared with an existing Wiener-based method in terms of prediction error through our simulations. In our simulations, we assume that handoff call arrivals follow a non-Poisson process and each handoff call has an non-exponentially distributed channel holdingtime in the cell, considering that handoff call arrival pattern is not Poisson distribution but non-Poisson for long periods of time in wireless picocellular IP networks. Simulation results show that the prediction error in the proposed method converges to the lower value while in an existing method increase as time is passed. Therefore we may conclude that the proposed method improves the efficiency of resource utilization by more exactly predicting resource demands for future handoff calls than an existing method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.3
• /
• pp.172-182
• /
• 2013

In this study we consider a flow line CONWIP system in which two types of product are produced. The processing times of each product type at each station follow an independent exponential distribution and the demands for the finished products of each type arrive according to a Poisson process. The demands that are not satisfied instantaneously are either backordered or lost according to the number of unsatisfied demands that exist at their arrival instants. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts of each product type at each station, mean waiting times of backordered demands and the proportion of backordered demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a two class closed queueing network with a synchronization station and analyze the closed queueing network using a product-form approximation method for multiple classes developed by Baynat and Dallery. In the approximation method, each subsystem is analyzed using a matrix geometric method. Comparisons with simulation show that the approximation method provides fairly good results for all performance measures.