• 한국BIM학회 논문집
• /
• 제11권3호
• /
• pp.34-44
• /
• 2021

This study quantitatively analyzes the work performance of the structural safety diagnosis team that diagnoses pipe racks. To this end, a method for evaluating the performance of the structural safety diagnosis team using the queuing model was proposed. For verification, the case of applying the existing method and the method of introducing a 3D laser scanner for one site was used. The period, number of people, and initial investment cost of each project were collected through interviews with case project experts. As a result of analyzing the performance of the structural safety diagnosis team using the queuing model, it was possible to confirm the probability of delay in the work of each project and the amount of delayed work. Through this, the cost (standby cost) when the project was delayed was analyzed. Finally, economic analysis was conducted in consideration of the waiting cost, labor cost, and initial investment cost. The results of this study can be used to decide whether to introduce 3D laser scanners.

• 한국ITS학회 논문지
• /
• 제10권2호
• /
• pp.22-34
• /
• 2011

본 논문은 고속도로 톨게이트에서 통행 요금징수로 인해 교통지체가 발생할 때 이를 최소화하기 위해 자동요금징수시스템을 설치하는 경우 차량들의 통과시간이 어떻게 변화하는지 분석한 연구결과를 제시하고 있다. 본 연구에서는 이 설치효과를 톨게이트를 빠져나가는 차량들의 통과시간 감소 편익이라고 생각했으며, 차량의 통과시간을 분석하기 위해 다중서비스 대기행렬 이론을 적용해서 분석하였다. 본 연구에서 분석한 결과, 톨게이트로 진입하는 차량들의 입차 간격이 Poisson 분포를 따르고, 자동요금징수시스템의 서비스 시간이 지수 분포를 따를 때 다중서비스 대기행렬이론을 적용하여 차량들의 통과시간을 분석하는 것이 바람직하다는 것과, 자동요금징수시스템을 설치하더라도 통행 요금을 징수하는데 걸리는 시간이 다르기 때문에 톨게이트 출구 쪽이 입구 쪽보다 통과시간 감소효과가 더 크게 나타난다는 것, 그리고 자동요금징수시스템을 설치한다고 해서 항상 톨게이트를 통과하는 시간이 감소하는 것은 아니며, 자동요금징수시스템 차로에 너무 많은 차량들이 몰리는 경우 오히려 톨게이트 전체로 볼 때는 차량당 통과시간이 증가한다는 것을 밝혔다. 끝으로 본 연구에서는 다중서비스 대기행렬이론의 정확성을 판단하기 위해 실제로 톨게이트 현장조사에서 통과 차량들의 평균 통과시간을 조사해서 모형 값과 비교했는데, 그 결과 모형 값과 실측 값은 약 1~3초 정도의 미소한 차이만을 보여서 다중서비스 대기행렬이론을 실무에 적용해도 좋다는 결론을 얻었다.

• Asia pacific journal of information systems
• /
• 제26권3호
• /
• pp.427-448
• /
• 2016

The stochastic phenomena of traffic network condition, such as traffic speed and density, are affected not only by exogenous traffic control but also by endogenous changes in service time during congestion. In this paper, we propose a mixed M/G/1 queuing model by introducing a condition-varying parameter of traffic congestion to reflect structural changes in the traffic network. We also develop congestion indices to evaluate network efficiency in terms of traffic flow and economic cost in traffic operating system using structure-changing queuing model, and perform scenario analysis according to various traffic network improvement policies. Empirical analysis using Korean highway traffic operating system shows that our suggested model better captures structural changes in the traffic queue. The scenario analysis also shows that occasional reversible lane operation during peak times can be more efficient and feasible than regular lane extension in Korea.

• 한국통신학회논문지
• /
• 제17권3호
• /
• pp.225-231
• /
• 1992

In this paper, queuing networks with open chains are considerd to analyze the performance of packet switching networks. Networks are classified into backbone and local access networks. Networks for performance analysis are distributed to twelve regions and DNS is the backbone. Analysis was conducted using the real values from the input to existing networks and mathematical estimation values. As the result of analysis, the mean of end-to-and delay for each chain was presented. Except special regions, we found that there was a little difference between real values and mathematical estimation values. However, there could be a performance problem in total networks due to the increase of communication volumes in each region. So we proposed some solutions to this problem.

• ETRI Journal
• /
• 제19권1호
• /
• pp.13-25
• /
• 1997

In this paper, we propose a new queuing model, MMDP/MMDP/1/K, for an asynchronous transfer mode(ATM) multiplexer with multiple quality of service(QoS) variable bit rate (VBR) traffic in broadband-integrated services digital network (B-ISDN). We use the Markov Modulated Deterministic Process(MMDP) to approximate the actual arrival process and another MMDP for service process Using queuing analysis, we derive a formula for the cell loss probability of the ATM multiplexer in terms of the limiting probabilities of a Markov chain. The cell loss probability can be used for connection admission control in ATM multiplexer and the calculation of equivalent bandwidth for arrival traffic, The major advantages of this approach are simplicity in analysis, accuracy of analysis by comparison of simulation, and numerical stability.

• 한국BIM학회 논문집
• /
• 제5권2호
• /
• pp.1-11
• /
• 2015

Despite a lot of research on BIM, there is no quantitative study to measure accurately the performance of BIM coordination service. Thus, this study suggested method to measure the performace of BIM coordination services, applying queueing models in the field of management science. To analyze queuing system of BIM coordination services, a group of BIM coordinator were selected. Through focus group interviews with experts were used in the analysis to derive mean arrival rate(${\lambda}$), mean service rate(${\mu}$) of BIM coordination services. Single-server queuing model(M/M/1), multiple server queuing model(M/M/s) is utilized for the BIM coordination services performance measurement in construction phase. This study has significant quantitative performance measurement approaches that can be utilized in the decision-making for the improvement of the BIM coordination services and to support the review of the alternatives accordingly. But There is a limit but it is difficult to take into account the increase or decrease of the cost of alternatives according to the review.

• 한국정보통신학회논문지
• /
• 제4권3호
• /
• pp.549-555
• /
• 2000

본 논문에서는 n개의 버스트 입력 트래픽을 처리하는 이산 시간 큐잉 모형을 분석하기 위한 근사 계산 알고리즘을 제안한다. 입력되는 각각의 버스트 트래픽은 IBP(Interrupted Bernoulli Process)로 모형화된다. 이 알고리즘은 n 개의 입력 프로세스를 하나의 상태 변수로 표시하여 n 개의 입력 프로세스로 표현된 마코프 체인(Markov Chain)의 확률 전이 상태를 단순화한다. 이렇게 단순화된 하나의 상태 변수를 이용하여 큐잉모형의 상태 전이를 표현하고 이를 완전 수치 계산에 의해 해를 구한다. 이러한 절차를 통해 구한 큐 길이, 대기 시간 분포를 시뮬레이션에 의해 구한 값과 비교하여 알고리즘의 타당성을 검증한다.

• 산업공학
• /
• 제16권spc호
• /
• pp.76-81
• /
• 2003

BPMS (Business Process Management Systems) is aninformation system that systematically supports designing, administrating, and improving the business processes. It can execute the business processes by assigning tasks to human or computer agents according to the predefined definitions of the processes. In this research we developed a task assignment algorithm that can maximize overall process efficiency under the limitation of agents' capacity. Since BPMS manipulates the formal and predictable business processes, we can analyze the processes using queuing theory to achieve overall process efficiency. We first transform the business processes into queuing network model in which the agents are considered as servers. After that, workloads of agents are calculated as server utilization and we can determine the task assignment policy by balancing the workloads. This will make the workloads of all agents be minimized, and the overall process efficiency is achieved in this way. Another application of the results can be capacity planning of agents in advance and business process optimization in reengineering context. We performed the simulation analysis to validate the results and also show the effectiveness of the algorithm by comparing with well known dispatching policies.

• 한국컴퓨터정보학회논문지
• /
• 제10권4호
• /
• pp.221-228
• /
• 2005

데이터 저장장치는 서버의 내부나 근처에 있는 것으로 인식되어 왔으나 네트워크 기술의 발달로 저장장치 시스템은 주 전산기와 원거리에 떨어져 존재할 수 있게 되었다. 인터넷 시대에 데이터 량의 폭발적인 증가는 데이터를 저장하는 시스템과 이를 전송하는 시스템의 균형 있는 발전을 요구하고 있으며 SAN(Storage Area Network)이나 NAS(Network Attached Storage)은 이러한 요구를 반영하고 있다. 저장장치로부터 최적의 성능을 도출하기 위해서 복잡한 저장 네트워크의 용량과 한계를 파악하는 것이 중요하다. 파악된 데이터는 성능 조율의 기초가 되고 저장장치의 구매 시점을 결정하는데 사용될 수도 있다. 본 논문에서는 저장 네트워크 시스템의 큐잉 네트워크를 통한 분석적 모델을 제시한 다음, 이의 시뮬레이션하여 분석적 모델이 정당하다는 것을 입증한다.

• 한국정보처리학회논문지
• /
• 제6권2호
• /
• pp.459-466
• /
• 1999

I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.