• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.980-988
• /
• 1993

In this paper, performance of 8-ISDN traffic for the buffer size which is requested of important parameters in switch/multiplexer of B-ISDN with multimedia traffic is analyzed. Multimedia traffic is modeled as a traffic, which is composed of poisson distribution traffic and burst traffic with exponential/geometric ON time duration(Burst duration) Performance of traffic which is modeled as a multimedia traffic is analysed and buffer size, can provide the high quality service, is presented for the cell loss probability. It is simulated using event scheduling approach method which is provided by simulation package, PC SIMSCRIPT II.5. Simulation program is composed of PREAMBLE, MAIN, INITIAL, ARRIVAL, DEPARTURE and STOP·SIM modules. Specially, in case of mixed traffic simulation, ARRIVAL module is composed of ARRIVAL I and ARRIVAL II, and cells are generated independently by each module.

• Spatial Information Research
• /
• v.6 no.1
• /
• pp.77-90
• /
• 1998

The complex interactions of climate, topography, geology, biota and hwnan activities result in the land cover patterns, which are impacted by natural disturbances such as fire, earthquake and flood. Natural disturbances disrupt ecosystem communities and change the physical environment, thereby generating a new landscape. Community ecologists believe that disturbance is critical in determining how diverse ecological systems function. Fires were once a major agent of disturbance in the North American tall grass prairies, African savannas, and Australian bush. The major focus of this research was to develop stochastic model of spatial process of disturbance or spatial events and simulate the process based on the developed model and it was applied to the fire arrival process in the Great Victoria Desert of Australia, where wildfires generate a mosaic of patches of habitat at various stages of post-fire succession. For this research, Landsat Multi-Spectral Scanner(MSS) data covering the period from 1972 to 1994 were utilized. Fire arrival process is characterized as a spatial point pattern irregularly distributed within a region of space. Here, nonhomogeneous planar Poisson process is proposed as a model for the fire arrival process and rejection sampling thinning the homogeneous Poisson process is used for its simulation.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.773-782
• /
• 2004

In this paper, a random shock model for a system is considered. Each shock arriving according to a Poisson process decreases the state of the system by a random amount. A repairman arriving according to another Poisson process of rate $\lambda$ repairs the system only if the state of the system is below a threshold $\alpha$. After assigning various costs to the system, we calculate the long-run average cost and show that there exist a unique value of arrival rate $\lambda$ and a unique value of threshold $\alpha$ which minimize the long-run average cost per unit time.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.10a
• /
• pp.33-42
• /
• 2004

In this paper, a random shock model for a system is considered. Each shock arriving according to a Poisson process decreases the state of the system by a random amount. A repairman arriving according to another Poisson process of rate $\lambda$ repairs the system only if the state of the system is below a threshold $\alpha$. After assigning various costs to the system, we calculate the long-run average cost and show that there exist a unique value of arrival rate $\lambda$ and a unique value of threshold $\alpha$ which minimize the long-run average cost per unit time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.845-850
• /
• 2002

In this study we consider a flow-line CONWIP System with Compound Poisson Demands. The processing times of each workstation follow a Coxian-2 distribution. The demands that are not satisfied instantaneously are either backordered or lost according to the number of backordered demands that exist at their arrival instants. For this system we develop an approxi­mation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the average number of backordered demands and the proportion of the lost demands. Comparisons with simulation have shown that the approximate method provides fairly good results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.377-385
• /
• 1996

We present an approximate algorithmic approach for the m-server fork-join queueing system with infinite queue capacity. We analyze the system size and queue waiting time. We assume Poisson arrival process and independent exponential service times.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.107-118
• /
• 2007

A single-server queueing model with infinite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of an accepted batch arrive one-by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. Analysis of the joint distribution of the number batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. Effect of control on the main performance measures of the system is demonstrated numerically.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.653-678
• /
• 2011

WiMAX is intended for fourth generation wireless mobile communications where a group of users are provided with a connection and a fixed length queue. In present literature traffic of such network is analyzed based on the generator matrix of the Markov Arrival Process (MAP). In this paper a simple analytical technique of the two dimensional Markov chain is used to obtain the trajectory of the congestion of the network as a function of a traffic parameter. Finally, a two state phase dependent arrival process is considered to evaluate probability states. The entire analysis is kept independent of modulation and coding schemes.

• Journal of the Korean Institute of Navigation
• /
• v.7 no.1
• /
• pp.1-32
• /
• 1983

The delay due to congestion has recently attracted widespread attention with the analysis of over-all operation at the port. But, the complexity of the situation is evident in view of the large number of factors which impinge on the considerable end. Queueing theory is applicable to a large scale transportation system which is associated with arrivals of vessels in a large port. The attempt of this paper is to make an extensive analysis of the port transport system and its economic implications from the viewpoint that port is one of the physical distribution facilities and a kind of queueing system which includes ships and cargoes as port customer. By analyzing the real data on the Port of Pusan, it is known that this port can be represented as a set of multi-channel with identical setof Poisson arrival and Erlang service time, and also it is confirmed that the following formula is suitable to calculate the mean delay in this port, namely, $W_4={\frac{\rho}{\lambda(1-\rho)} {\frac{e_N(\rho{\cdot}N)}{D_{N-1}(\rho{\cdot}N)}$ where, ${\lambda}$: mean arrival rate $\mu$: mean servicing rate; N: number of servicing channel; ${\rho}$: utillization rate (${\lambda}/N{\mu}$) $e_N$: the Poisson function Coming to grips with the essentials of the cost of delay due to congestion, a simple ship journey cost model is adopted and the operating profit sensitivity to variation in port time is examined, and for purpose of a future development for port princing service the marginal cost is approximately calculated on the basis of queueing theory.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.75-81
• /
• 2007

Previous queue inference has been studied with some limits. Larson's inference engine, which is the basis for this paper, also processed with basic assumption that arrival process is poisson process. Our inference method, which relaxes the poisson process assumption, must be a useful tool for looking into unobservable inside of queueing systems, as well as calculating accurate system performance. This paper employs these inference methods and proves the validity. Then we apply this method to system analysis for more complicated models. At first, we suggest methods to system with known number of servers, then expand to unknown number of servers. For validating our inference approach, we run some simulation models and compare true values with our results.