• Journal of KIBIM
• /
• v.8 no.3
• /
• pp.31-42
• /
• 2018

This study focuses on the BIM request for information(RFI) processing performance and quantitatively analyzes the performance of the BIM coordinator and the loss due to the waiting of the project participants. For these purposes, a method to quantitatively evaluate the performance of the BIM coordinator was proposed using a queueing model. For the verification, two projects in which BIM was applied in the construction phase were selected, and the BIM RFI data were collected through the analysis of the BIM monthly report and BIM coordinator work log of each project. In addition, the BIM input personnel, labor cost, and productivity data were collected through interviews with the experts of the case projects. The analysis of the BIM RFI processing performance of the BIM coordinator using the queueing model exhibited on a probabilistic basis that the waiting status of the project participants could vary depending on the preliminary BIM application to the design verification as well as the input number and level of the BIM coordinator personnel. In addition, the loss cost due to the waiting of the project participants was analyzed using the number of BIM RFIs waiting to be processed in the queueing system. Finally, the economic feasibility analysis for the optimal BIM coordinator input was performed considering the loss cost. The results of this study can be used to make decisions about the optimal BIM coordinator input and can provide grounds for the BIM return on investment (ROI) analysis considering the waiting cost of the project participants.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2037-2042
• /
• 2017

The manufacturing facility is generally operated by a pre-set program under the existing factory automation system. On the other hand, the manufacturing facility must decide how to operate autonomously in Industry 4.0. Determining the operation mode of the production facility itself means, for example, that it detects the abnormality such as the deterioration of the facility at the shop-floor, prediction of the occurrence of the problem, detection of the defect of the product, In this paper, we propose a manufacturing process modeling using a queue for detection of manufacturing process abnormalities at the shop-floor, and detect abnormalities in the modeling using SVM, one of the machine learning techniques. The queue was used for M / D / 1 and the conveyor belt manufacturing system was modeled based on ${\mu}$, ${\lambda}$, and ${\rho}$. SVM was used to detect anomalous signs through changes in ${\rho}$.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.1
• /
• pp.63-76
• /
• 2024

In this study, we analyzed queue length and sojourn time of discrete-time BMAP/G/1 queues under the workload control. Group customers (packets) with correlations arrive at the system following a discrete-time Markovian arrival process. The server starts busy period when the total service time of the arrived customers exceeds a predetermined workload threshold D and serves customers until the system is empty. From the analysis of workload and waiting time, distributions of queue length at the departure epoch and arbitrary time epoch and system sojourn time are derived. We also derived the mean value as a performance measure. Through numerical examples, we confirmed that we can obtain results represented by complex forms of equations, and we verified the validity of the theoretical values by comparing them with simulation results. From the results, we can obtain key performance measures of complex systems that operate similarly in various industrial fields and to analyze various optimization problems.

• Journal of Korean Society of Transportation
• /
• v.33 no.5
• /
• pp.478-487
• /
• 2015

This study proposed a Variable Speed Limits(VSL) algorithm to use traffic information based on Cumulative Demand-Capacity Analysis and evaluated its performance. According to the analysis result, the total of delay consisted of 3 separate parts. There was no change in total travel time although the total of delay decreased. These effects was analysed theoretically and then, evaluated through VISSIM, a microscopic simulator. VISSIM simulation results show almost same as those of theoretical analysis. Furthermore in SSAM analysis with VISSIM simulation log, the number of high risk collisions decreased 36.0 %. However, the total delay decrease effect is not real meaning of decrease effect because the drivers' desired speed is same whether the VSL model is operated or not. Nevertheless this VSL model maintains free flow speed for longer and increases the cycle of traffic speed fluctuation. In other words, this is decrease of delay occurrence and scale. The decrease of speed gap between upstream and downstream stabilizes the traffic flow and leads decrease number of high risk collision. In conclusion, we can expect increase of safety through total delay minimization according to this VSL model.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.226-235
• /
• 1998

본 논문에서는 추종 모형을 이용한 미시 교통류 시뮬레이션 모형을 개발하고, 이 모형을 통한 시뮬레이션을 통하여 단속류에서 검지기의 설치 위치에 따른 검지 특성을 알아보고, 교통정보 수집용의 검지기의최적 위치에 대해 평가하였다. 검지기로부터 발생하는 교통량, 점유율, 속도 자료중 링크의 통행시간을 가장 잘 반영하는 것은 점유율에 의한 검지기의최적위치는 정지선으로부터 150∼250m이다. 점유율 다음으로 통행시간을 잘 반영하는 자료는 지점속도로서 점유율보다는 상관관계가 낮지만, 양호한 설명력을 가지는 것으로 보인다. 교통량 자료는 상관관계가 낮으며, 교통량에 의한 위치 선정은 각 모의 실험 결과에서 일관적이지 않아 적절한 설명변수가 아니라고 판단하였다. 모든 경우에서, 정지선이나 링크 최상류에 위치한 검지기로부터의 자료는 통행시간과 독립적이므로 이러한 검지기는 교통정보 수집용을 사용할 수 없으며, 일반적인 검지기의최적 위치는 정상상태의 교통류 뿐만 아니라 대기행렬내에 존재하여 매우 혼잡한 상태를 경험할 수 있는 위치라고 할수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.131-134
• /
• 2023

The age of information (AoI) was proposed to quantify the freshness of information about the status of a remote source system, which is defined as the amount of time that has elapsed since a packet was created at its source. This paper analyzes the age of information of a discrete time Geo/D/1/1 status update system. For this purpose, the system is modeled as a discrete-time two-state Markov chain. The stationary probability distributions for peak AoI and AoI are obtained. The average peak AoI, the average AoI, and the freshness ratio of information are also derived. Some numerical results of the analysis are presented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.3
• /
• pp.483-486
• /
• 2022

Real time data exchange and information transmission are becoming more and more important these days. The concept of age of information (AoI) was proposed to quantify the freshness of information about the status of a remote source system. The AoI is defined as the amount of time that a packet experiences since it was generated at the source up to now. This paper analyses the age of information for a discrete time Geo/Geo/1/1 status updating system. The stationary probability distribution for peak AoI is obtained. Freshness ratio of information is also derived. Some numerical results obtained by the analysis are presented.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.19-30
• /
• 2004

Due to the inefficient operation of the existing logistic facilities, the complicated distribution structure, and closed utilization of logistic information are causing high logistic costs. The general improvement in the distribution structure and the expansion of the logistic facilities are needed for solving these problems. However, existing unit-scale forecast is not considering the loading and unloading characteristics of the trucks and the improvement of operation efficiency from the mechanization and automation of the loading and unloading works. The queuing theory based on the status quo of the cargo trucks to the cargo terminals is considered in this study. The optimal scale estimation method(OSCM) which the loading and unloading characteristics of the cargo trucks were taken into consideration was suggested. Also, the relationship between the optimal scale of the cargo terminal and the mechanization, automation, and informationization of the present loading and unloading system was investigated. As a result, it showed that the regularity of the truck arrival and service times had less influence on the scale of the cargo terminal, but the improvement of the loading and unloading speeds and the service rate of the trucks did more influence on it.

• Review of KIISC
• /
• v.3 no.1
• /
• pp.26-30
• /
• 1993

본 논문에서는Akl-Meijer가 설계한 랜덤 치환 발생기를 일반화한 알고리즘을 제안한다. Akl과 Meijer는 사이즈가 m인 치환(Permutation)과 0과 m!-1사이의 정수를 일대일 대응시키는 Knuth의 알고리즘을 이용하여, 선형 합동법 Y=X+C mod m! (C는 상수)에서 발생되는 난수와 일대일 대응되는 치환을 발생하는 치환 발생 알고리즘을 설계하였으며, 이를 응용하여, 이진 난수 발생기를 제시하였다. 본 논문에서는 선형 합동법 Y=AX+C mod m!(A, C는 상수)에서 발생되는 난수와 일대일 대응되는 치환 계산과정을 상삼각 행렬(Upper triangular matrix) 의 곱으로 변환하여 고속으로 계산하는 알고리즘을 제시한후, 이 알고리즘의 출력 치환을 n 개 결합하여 치환을 발생하는 랜덤치환 발생기를 설계한다. 또한 이의 암호적인 응용으로, 치환 발생기를 이용한 이진 난수 발생기를 제시한다.