• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.1-6
• /
• 2006

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.4
• /
• pp.10-19
• /
• 1998

With the advent of high-speed networks, the increasingly stringent performance requeirements are being placed on the underlying switching systems. Under these circumstances, simulation methods for evaluating the performace of such a switch requires vast computational cost and accordingly the importance of anlytical methods increases. In general, the performance analysis of a switch architecture is also a very difficult task in that the conventional queueing system such as switching systems, which consists of a large numbe of queues which interact with each other in a fiarly complicated manner. To overcome these difficulties, most of the past research results assumed that multiple queues become decoupled as the switch size grows unboundely large, which enables the conventional queueing theory to be applied. In this apepr, w analyze a non-blocking space-division ATM swtich with input queueing, and prove analytically the pheonomenon that virtual queues formed by the head-of-line cells become decoupled as the switch size grows unboundedly large. We also establish various properties of the limiting queue size processes so obtained and compute the maximum throughput associated with ATM switches with input queueing.

• Korean Management Science Review
• /
• v.28 no.1
• /
• pp.117-127
• /
• 2011

In the Multi-Echelon maintenance environment, METRIC(Multi-Echelon Technique for Repairable Item Control) has been used in several different inventory level selection models, such as MOD-METRIC, Vari-METRIC, and Dyna- ETRIC. While this model's logic is easy to be implemented, a critical assumption of infinite maintenance capacity would deteriorate actual values, especially Expected Back Order(EBO)s for each item. To improve the accuracy of EBO, we develop two models using simulation and queueing theory that calculates EBO considering finite capacity. The result of our numerical example shows that the expected backorder from our model is much closer to the true value than the one from Vari-METRIC. The queueing model is preferable to the simulation model regarding the computational time.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.473-476
• /
• 2007

본 논문에서는 LBT(Listen Before Talk) 방식을 사용하는 ZigBee와 FH(Frequency Hopping) 방식을 사용하는 DCP, RFID, Bluetooth 등의 소출력 무선기기가 공유주파수대역에 공존할 경우 요구되는 적정 채널수를 산출하고 전체 공유주파수대역폭 산출법을 제시하였다. 한정된 주파수 대역에서 LBT 및 FH 방식을 사용하는 총 User 수가 포용되는 공유주파수대역폭 산출은 중요한 작업이다. 소출력 무선기기 시스템의 간섭 회피 기술로 사용되는 FH 방식과 LBT 방식에 대기행렬이론(Queueing Theory)을 적용하였으며, 주위의 전파환경을 감지하여 유휴 주파수대역을 찾아 데이터전송을 시도하는 LBT 방식은 random하게 주파수채널을 이동하며 통신을 시도하는 FH 방식과는 구별된다. 채널수 별 User의 통신시도 시간간격을 통계적으로 처리하여 Throughput을 분석한 결과, Throughput 70% 조건에서 FH 방식과 LBT 방식을 사용하는 250mW 소출력 무선기기들이 공존하는 공유주파수대역의 적정 채널수는 30개를 가지며, 전체 공유주파수대역폭은 채널수에 채널당 대역폭의 곱으로 산출이 가능하다.

• IE interfaces
• /
• v.9 no.3
• /
• pp.120-142
• /
• 1996

Asynchronous Transfer Mode (ATM) is considered to be the most promising transfer technique for BISDN due to its efficiency and flexibility. Queueing theory has been playing a very important role in performance evaluation of ATM for the past few years. This paper is composed of two parts. The first part is concerned with the several basic concepts of ATM. The second part surveys queueing approaches in ATM performance evaluation. It deals with stochastic models which have been proposed for the three basic categories of traffic sources (voice, data, video), various queueing models for statistical multiplexer and switch, and priority strategies for buffer control schemes.

• Journal of Communications and Networks
• /
• v.7 no.1
• /
• pp.87-92
• /
• 2005

This paper presents basic queueing analysis contributing to teletraffc theory, with commonly accessible mathematical tools. This paper studies queueing systems with bulk arrivals. It is assumed that the number of arrivals and the expected number of arrivals in each bulk are bounded by some constraints B and (equation omitted), respectively. Subject to these constraints, convexity argument is used to show that the bulk-size probability distribution that results in the worst mean queue performance is an extremal distribution with support {1, B} and mean equal to A. Furthermore, from the viewpoint of security against denial-of-service attacks, this distribution remains the worst even if an adversary were allowed to choose the bulk-size distribution at each arrival instant as a function of past queue lengths; that is, the adversary can produce as bad queueing performance with an open-loop strategy as with any closed-loop strategy. These results are proven for an arbitrary arrival process with bulk arrivals and a general service model.

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

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.203-206
• /
• 2003

This paper studies constrained optimization of an M/G/1 queue with a server that can be switched on and off. One criterion is an average number of customers in the system and another criterion is an average operating cost per unit time, where operating costs consist of switching and running costs. With the help of queueing theory, we solve the problems of optimization of one of these criteria under a constraint for another one.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.239-246
• /
• 2009

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.

• Korean Management Science Review
• /
• v.4
• /
• pp.60-75
• /
• 1987

This paper introduces the outlines of the state-of-the-art in studying FMSs using analytical queueing network models. These include Jackson networks, reversible networks and approximate models of non-product-form networks. the focus is on identifying the major features of models as they relate to the operational characteristics of FMSs. Prescriptive models concerning the optimal design and/or operational control of FMS networks are also discussed. We notice that the presentation of materials in this paper basically follows Yao and Buzacott, On Queueing Network Models of Flexible Manufacturing Systems(FMSs), invited and published on Queueing Systems, Theory and Application 1(1986). For other analytical models of FMSs, refer to Buzacott and Yao, Flexible Manufacturing Systems : A Review of Analytical Models, Management Science 32, No.7(1986).