• 산업경영시스템학회지
• /
• 제37권1호
• /
• pp.96-103
• /
• 2014

A steady-state controllable M/G/1 queueing model operating under the (TN) policy is considered where the (TN) policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or the time instant when Nth customer arrives at the system after T time units elapsed without customers' arrivals during that time period. After deriving the necessary system characteristics such as the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time in the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, the optimal values of the decision variables included in the operating policies are determined by minimizing the total expected cost function per unit time to operate the system under consideration.

• 산업경영시스템학회지
• /
• 제46권2호
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• 전자공학회논문지A
• /
• 제29A권11호
• /
• pp.25-39
• /
• 1992

Due to the data processing development by the computer, the early warning system recently has made a remarkable evolution in its functions and performance as a component of the communication and control system which is also supported by the computer communication and intelligence system. In this paper it is presented that a integrated data processing system is designed to integrate the information sent from the various radar systems which constitute an early warning system. The suggested system model of this paper is devided into two types of structures, the centralized model and the distributed model, according to the data processing algorithm. We apply the queueing theory to analyse the performance of the designed models and the OPNET system kernel to make the analysing program with C language. From the analysis of the queueing components by applying the analysis programs to the designed systems, we got the tendancies and characteristics of both models, that is, a fast data processing performance of the distributed model and a stable data processing capability of the centralized model.

• 응용통계연구
• /
• 제23권6호
• /
• pp.1179-1190
• /
• 2010

교통 혼잡을 해결하기 위해, 도로 교통망의 흐름을 정확히 파악하고 이를 효율적으로 관리하는 것은 가장 중요하면서도 효율적인 방안이다. 일반적으로 교통 흐름에 대한 연구로 대기행렬 모형이 이용된다. 특히, 속도, 통행량, 교통밀도에 대한 S-F-D(Speed-Flow-Density) 다이어그램은 도로의 현황을 파악하는데 매우 유용한 도구이다. 그러나 우리나라의 경우, 이러한 교통 속성들 간에 구조적인 변화를 볼 수 있었다. 이에 따라 본 연구에서는 대기 행렬 모형내에 구조변화를 포함함으로써 정체 시 도로 상황이 구조적으로 변화하는 현상을 모형에 반영하여, 국내 고속도로의 현황을 보다 잘 파악할 수 있는 새로운 S-F-D 다이어그램을 제안한다. 각 구간에 대한 최적의 대기행렬 모형을 찾기 위해 뉴튼-랩슨 방법으로 최적화 모수를 추정하고, 이를 바탕으로 최적속도와 밀도를 산출하여 요일별 시간별 도로의 이용현황 및 효율성을 파악하고자 한다.

• 한국통신학회논문지
• /
• 제17권1호
• /
• pp.1-10
• /
• 1992

새로운 정보 통신 서어비스의 출현 및 가입자측에서 이에 대한 욕구가 서로 부합되어 가입자 영역에는 기존의 단말기외에 새로운 형태의 데이터 단말의 수요가 증가되고 있는 추세이다. 이에 따라 전송로의 경제성을 고려하여 SMUX에 대한 연구가 진행되고 있다. 따라서 본 논문에서는 SMUX에 Go-back N ARQ 재전송 방식을 적용하여 queueing 모델을 설정한 후 이에 따른 수학적 해석 방법을 제시하였고, 평균 waiting 시간 및 overflow 확률의 일반식을 산출하였다. SMUX의 설계시에 영향을 미치는 파라미터로서는 입력비율, 출력 비율 및 접속되는 단말기들의 batch 크기로 표현되는 트래픽 밀도나 버퍼가 수용할 수 있는 최대 버퍼 크기에 따른 overflow 확률 및 평균 버퍼 크기, 평균 waiting 시간을 비교,분석하였다. 또한 수학적 해석에 따른 각 파라미터들이 SMUX에 미치는 영향은 평균 메세지 크기는 40characters로 고정하였을 경우 전송 선로상의 에러율이 10­$^3$이하에서 운용되어야 하고, 트래픽 밀도가 낮은 (0.5이하)상태에서 운용이 효울적이라 사료된다. 향후 본 논문에서 제시한 자료를 기초로 하여 SMUX를 설계시에 참고 자료가 되리라 사료된다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.253-256
• /
• 2000

In general, Automated Storage/Retrieval Systems (AS/RS ) have racks of equal sized cells to utilize the concept of unit-load. Most of the techniques for the performance estimation of a unit-load AS/RS are a static model or computer simulation. Especially, their models were developed under assumption that the Storage/Retrieval (S/R) machine performs only single command (SC) or dual command (DC). In reality, defending on the operating policy and the status of the system at a particular time, the S/B machine performs a SC or a DC, or becomes .: idle. In order to resolve these weak points, we propose a stochastic model for the performance estimation of unit-load AS/RS by using a single-server queueing model. Expected numbers of waiting storage and retrieval commands are found

• 한국국방경영분석학회지
• /
• 제12권1호
• /
• pp.87-105
• /
• 1986

Among the various types of waiting line systems, the elevator servicing system is quite different from the usual queueing system in view of the service characteristics. For example, the FIFO discipline is not always valid depending upon the situation when the direction of first-come customer's is opposite of the operating elevator direction and at that time a later-arrived one has a luck to be served first. In this paper, a simulation model is constructed and tested by the sample data and the results have turned out to be fairly adequate. This model, therefore, will provide a good guide to anyone who is interested in the decision of optimal location selection of no-passenger elevator in high buildings whatsoever. This model is also available, with slight modification, to the problem of city bus dispatching or any other waiting line problems where the servicing equipments are moving.

• 한국정보통신학회논문지
• /
• 제27권1호
• /
• pp.135-138
• /
• 2023

In this paper, we study real-time error in the context of monitoring a binary information source through a delay system. To derive the average real-time error, we model the delay system as a discrete time Geo/D/1/1 queueing model. Using a discrete time three-dimensional Markov chain with finite state space, we analyze the queueing model. We also perform some numerical analysis on various system parameters: state transition probabilities of binary information source; transmission times; and transmission frequencies. When the state changes of the information source are positively correlated and negatively correlated, we investigate the relationship between transmission time and transmission frequency.

• 물과 미래
• /
• 제20권4호
• /
• pp.267-278
• /
• 1987

본 연구는 유역의 지형인자를 대기행렬이론(Queueing theory)에 적용하여 하천유역의 강우-유출 고나계를 해석하고, 미 계측 유역이나 자료가 결핍된 유역에 적용할 수 있는 GIUH(Geomorphologic Instantaneous Unit Hydrograph) 모델의 매개변수를 결정하는 데 그 목적을 두었다. GIUH모델의 개념은 유역 시스템내의 강우의 지속기간동안 유역의 출구에서 가능한 많은 경로를 추적 할 수 있을 것이라는 강우-대기행렬이론의 원리에 기초를 두었으며, 적용기법은 분할법(Sub-area method)과 평균치법(Mean-value method)을 적용하였다. GIUH모델의 적용성을 증명하기 위해서, 낙동강 ndlcjsdb역(유역면적 472.53$\textrm{km}^2$)에 적용하였으며, 분할법과 평균치법은 유역의 분할을 위해서 채택하였다. 계산된 직접 유출수문곡선과 관측 직접 유출 수문곡선을 비교한 결과는 첨두 유출량, 도달시간, 효율계수가 매우 근접한 결과를 나타내고 있었다. 따라서, GIUH모델은 미 계측 유역이나 자료가 결핍된 유역의 유출량 산정에 광범위하게 적용할 수 있음을 알 수 있었다.

• 한국산업정보학회논문지
• /
• 제9권3호
• /
• pp.32-37
• /
• 2004

This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.