• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.406-415
• /
• 2009

In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.1-9
• /
• 1998

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

• 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.

• 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.

• Journal of Navigation and Port Research
• /
• v.28 no.6
• /
• pp.549-555
• /
• 2004

The purpose of this study is to estimate the required number of yard tractor on port container terminal. The number of yard tractor is the bottleneck factor on the efficiency of container terminal. Due to the change in travel speed and travel distance, the efficiency is difficult to estimate. The efficiency of yard tractor is estimated by the proposed simulation model that developed considering the queueing network between container crane and transfer crane. The number of yard tractor per container crane is estimated by the alternative analysis. And to determine the number of yard tractor per container crane, the performance measure such as the distance between berth and yard, the speed of yard tractor are simulated.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.51-61
• /
• 2000

In recent years, significant advances in computers and communication technologies have made multimedia services feasible. As a result, various queueing models and cost models on architecture and data placement for multimedia server have been proposed. However, most of these models do not evaluate dependability of systems. In the design phase of a system, simulation is an important experimental means for performance and dependability analysis. Fault injection simulation has been used in evaluation of dependability metric. In this paper, we develop fault injection simulation model to analyze dependability of parallel video servers. In addition, we evaluate reliability and MTTF(Mean Time To Failure) of systems by using the simulator.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.70-79
• /
• 1999

Importance Sampling (IS) has been applied to accelerate the occurrence of rare events. However, it has a drawback of effective biasing scheme to make the estimator from IS unbiased. Adaptive Importance Sampling (AIS) employs an estimated sampling distribution of IS to the systems of interest during the course of simulation. We propose Nonparametric Adaptive Importance Sampling (NAIS) technique which is nonparametrically modified version of AIS and test it to estimate a probability of rare event in M/M/1 queueing model. Comparing with classical Monte Carlo simulation, the computational efficiency and variance reductions gained via NAIS are substantial. A possible extension of NAIS regarding with random number generation is also discussed.

• Journal of the Korea Society for Simulation
• /
• v.8 no.3
• /
• pp.77-89
• /
• 1999

Simulating rare events, such as probability of cell loss in ATM networks, machine failure in highly reliable systems, requires huge simulation efforts due to the low chance of occurrence. Importance Sampling (IS) has been applied to accelerate the occurrence of rare events. However, it has a drawback of effective biasing scheme to make the estimator of IS unbiased. Adaptive Importance Sampling (AIS) employs an estimated sampling distribution of IS to the system of interest during the course of simulation. We propose Nonparametric Adaptive Importance Sampling (NAIS) technique which is nonparametrical version of AIS. We test NAIS to estimate a probability of rare event in M/M/1 queueing model. Comparing with classical Monte Carlo simulation, the computational efficiency and variance reductions gained via NAIS are substantial. A possible extension of NAIS regarding with random number generation is also discussed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.162-172
• /
• 1999

For VBR video traffic, Motion-Picture Experts Group(MPEG) coding algorithm was adopted as the standard coding algorithm by International Telecommunication Union(ITU). In this paper, we propose a traffic model of an MPEG coded video traffic in frame level and cell level, and develop an approximate model for evaluating performance of a ATM multiplexer with homogeneous MPEG video sources by considering burst-level variation of aggregated traffics. For homogeneous MPEG video traffics which are frame-synchronized, the performance of the ATM multiplexer is influenced by source correlation at the multiplexing time. When sources are highly correlated, we decompose the aggregated cell streams by the frame-type and model multiplexing process during a frame time as n*D/D/1/K queueing model and suggest an approximate method for obtaining CLP of the ATM multiplexer. In the case that sources are highly correlated, the solution has the meaning of the upper bounds of performance of the ATM multiplexer. For the verification of our model, we compare the solution of our model with simulation resets. As the number of sources increases. The CLP obtained from our model approaches to simulation results, and gives upper bounds of simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.