• 한국정보처리학회논문지
• /
• 제5권1호
• /
• pp.33-39
• /
• 1998

본 논문에서는 고속병렬컴퓨터와 같이 다중노드로 구성된 시스템에서 사용되는 유한 버퍼를 가지는 노드간 통신시스템의 성능을 대기행렬모형을 사용하여 평가/분석하였다. 전체 시스템을 각 서브 시스템별로 나누어 버퍼크기의 제한으로 발생하는 블로킹을 고려한 안정상태에서의 도착률과 확률 값들을 구한 뒤, 이를 이용하여 전체 시스템의 성능을 분석하는 방법을 사용하였다. 평균 전송시간과 처리율을 구하여 이를 시뮬레이션 결과와 비교 검증하였으며, 제안한 모형을 사용하여 버퍼의 크기가 처리율에 미치는 결과를 분석하였다.

• 한국컴퓨터정보학회논문지
• /
• 제6권4호
• /
• pp.138-145
• /
• 2001

본 논문에서는 분산처리시스템에서 서버에 대한 작업의 서비스요구와 서버의 서비스율이 네트워크환경에 따라 모호성을 갖는 경우, 시스템의 성능을 평가할 수 있는 퍼지 폐쇄형 BCMP 큐잉네트워크모델을 제안하였다. 이 모델은 퍼지요소들을 처리할 수 있는 퍼지평균값분석방법을 사용하여 시스템성능을 평가할 수 있는 측도를 유도하였다. 이들의 유효함을 검증하기 위하여 제안한 모델에 작업의 서비스요구와 클라이언트의 수의 변화에 따른 성능평가를 시뮬레이션 하였고, 그 결과를 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.215-217
• /
• 2005

There are two types of packet loss probabilities used in both the network layer and the physical layer within the wireless transmitter such as a queueing discard probability and transmission loss probability. We analyze these loss performances in order to guarantee Quality of Service (QoS) which is the basic of the future network. The queuing loss probability is caused by a maximum allowable delay time and the transmission loss probability is caused by a wireless channel error. These two types of packet loss probabilities are not easily analyzed due to recursive feedback which, originates as a result at a queueing delay and a number of retransmission attempts. We consider a wireless transmitter to a M/D/1 queueing model. We configurate the model to have a finite-size FIFO buffer in order to analyze the real-time traffic streams. Then we present the approaches used for evaluating the loss probabilities of this M/D/1/K queueing model. To analyze the two types of probabilities which have mutual feedbacks with each other, we drive the solutions recursively. The validity and accuracy of the analysis are confirmed by the computer simulation. From the following solutions, we suggest a minimum of 'a Maximum Allowable Delay Time' for real-time traffic in order to initially guarantee the QoS. Finally, we analyze the required service rate for each type utilizing real-time traffic and we apply our valuable analysis to a N-user's wireless network in order to get the fundamental information (types of supportable real-type traffics, types of supportable QoS, supportable maximum number of users) for network design.

• 한국통신학회논문지
• /
• 제15권2호
• /
• pp.98-111
• /
• 1990

본 논문에서는 CCITT에서 권고한 ISDN D-채널 access protocol의 queueing 모델을 제시하였으며 그 모델을 이용하여 signalling message와 packet message의 delay의 Laplace transform을 구하였다. 그 분석결과는 simulation을 통하여 검증하였으며, 또한 D-채널 access 시스템에서의 packet 및 signalling message 의 delay 특성에 대하여 비교 설명하였다.

• 산업공학
• /
• 제14권1호
• /
• pp.67-78
• /
• 2001

This paper describes the simulation study which estimates the container crane efficiency in container terminal. In most simulation studies, it is assumed that container cranes are available at any time. Though the failures of container cranes don't occur often, they are very serious problems on terminal efficiency. As usual, the failures of container crane cause arrived ships to delay the departure time. In this study, a queueing simulation model for container terminal, which focuses on the failures of container cranes, is designed. The simulation approach appears to be the most appropriate one because it allows to avoid the usual exponential assumption on interarrivals of ships and service times of container cranes. Using the developed model, we tested the efficiency of container cranes considering failures with a real system size and performed the simulation experiment on real container terminal to validate the developed simulation model. The results of simulation experiment were analyzed using output statistics, which include the waiting times of vessels and yard tractors, the utilization for container cranes, and the berth occupancy rates.

• 산업공학
• /
• 제11권3호
• /
• pp.55-63
• /
• 1998

In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be lost. We assume that the lot size at each station is greater than one. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, average number of parts at each station and the proportion of lost 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 were compared with those obtained by simulation. Comparisons with simulation have shown that the accuracy of the approximate method is acceptable.

• 한국경영과학회지
• /
• 제23권3호
• /
• pp.153-168
• /
• 1998

In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished Products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be backordered. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the proportion of backordered demands, the average number of backordered demands and the mean waiting time of a backordered demand. 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 matrix geometric method 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 were compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.23-37
• /
• 1997

In this paper, performance analysis of video traffic shaper for Motion Picture Experts Group (MPEG) video traffic in on ATM network are investigated. Traffic shaping for MPEG video traffic is proposed as a traffic control function in ATM networks. The proposed shaper smoothes video traffics by controling the output rate of the buffer, which is placed in an MPEG source, according to I,B,P frame sequences of MPEG. In performance analysis of an video traffic shaper, a periodic botch arrival model is suggested to describe cell streams in a frame of MPEG video traffic. The queueing model which has periodic independent botch arrival and periodic deterministic service time is used to obtain the cell loss ratio, the mean cell delay, and the measure of smoothing effect. Simulation results are used to validate this queueing model. The cell loss performance of ATM multiplexer is measured by simulation study with real MPEG-1 data. From the viewpoint of traffic load, the cell loss ratio is observed to be considerably high, which is considered to result from the burstiness of MPEG video traffic. As a result, it is shown that the shaping decreases cell loss ratio of multiplexer. The results of this paper can be employed to establish a basic guideline in the implementation of a traffic control scheme and the design of ATM multiplexer for MPEG video traffic.

• Journal of applied mathematics & informatics
• /
• 제39권5_6호
• /
• pp.601-616
• /
• 2021

Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.

• 한국시뮬레이션학회논문지
• /
• 제16권2호
• /
• pp.75-81
• /
• 2007

과거의 대기행렬에 대한 추론은 여러 가지 제약 조건이 포함되어 수행되었다. 본 논문의 기반이 되는 Larson의 추론엔진 또한 포아송 도착과정을 기본 가정으로 추론을 수행하였다. 그러나, 이러한 가정 없이 실측 데이터만을 가지고 추론을 수행할 수 있다. 이는 보다 정확한 시스템의 성능척도 계산은 물론 보이지 않는 시스템 내부를 규명하는데 유용한 도구가 될 것이다. 본 논문은 이러한 추론 방법을 제안하고 타당성을 검토하여 보다 나은 시스템 분석에 적용하고자 한다. 먼저 서버의 수를 알고 있는 경우에 대한 추론 방법을 소개하고, 이를 바탕으로 서버의 수를 모르는 경우의 추론에 대해 확장한다. 우리가 제안한 추론모델을 검증하기 위하여 시뮬레이션을 수행하고 실제 시스템 성능척도 값과 추론에 의한 값을 비교 검토하였다.