• Proceedings of the KOR-KST Conference
• /
• 1998.10b
• /
• pp.297-297
• /
• 1998

고속도로의 교통혼잡을 관리하기 위해서는 근본적으로 혼잡지점 상류부의 진입교통량을 제어해야 한다. 이를 위한 효과적인 램프미터링 운영전략이나 고속도로 교통정보제공방안을 수립하기 위해서는 혼잡영향권(대기행렬길이)에 관한 신뢰성 있는 데이터가 반드시 필요하다. 고속도로의 대기행렬길이를 산정하기 위해 일반적으로 충격파이론과 Queueing이론을 제시하고 있다. 그러나, 기존의 충격파 이론을 포물선형의 교통량-밀도관계식을 근거로 하고 있어 충격파간에 발생하는 부수적인 충격파를 해석하는 과정이 수학적으로 불가능하여 실질적인 목적으로 사용할 수 없음은 이미 잘 알고 있는 사실이다. 최근에 이러한 한계를 극복할 수 있는 새로운 방법으로 교통량 밀도간의 관계식을 삼각형으로 가정하고 교통량 대신에 누적교통량을 사용하는 Simplified Theory of Kinematic Waves In Highway Traffic이 개발(Newell, 1993)되었지만, 이 방법을 적용하기 위해서는 기본적으로 대상 고속도로 구간의 교통량-밀도관계식을 규명해야 하는 어려움이 있다.(사실 실시간으로 밀도데이터를 수집하기란 불가능하다.) Queueing이론에서 제시하는 대기행렬은 모두 대기차량이 병목지점에 수직으로 정렬하여 도로를 점유하지 않는 Point Queue(혹은 Vertical stack Queue)로서 실제로 도로상에 정렬된 대기행렬(Real Physical Queue)과는 전혀 다르다. 이미 입증된 바 있어, Queueing이론을 이용함은 타당성이 없다. 이러한 사실에 근거하여 본 연구는 고속도로 대기행렬길이를 산정할 수 있는 모형개발을 위한 기초연구로서 혼잡상태의 연속류 특성을 분석하는데 목적이 있다. 이를 위해, 본 연구에서는 서울시 도시고속도로에서 수집한 실제 데이터를 이용하여 진입램프지점의 혼잡상태에서 대기행렬의 증가 또는 감소하는 과정을 분석하였다. 주요 분석결과는 다음과 같다. 1. 혼잡초기의 대기행렬은 다른 혼잡시기에 비해 상대적으로 급속한 속도로 증가함. 2. 혼잡초기의 대기행렬의 밀도는 다른 혼잡시기에 비해 비교적 낮음. 3. 위의 두 결과는 서로 관계가 있으며, 혼잡시 운전자의 행태(차두간격)과 혼잡기간중에도 변화함을 의미함. 4. 교통변수 중에서 대기행렬길이를 산정하는데 적합한 교통변수를 교통량과 밀도로 판단됨. 5. Queueing이론에서 제시하는 대리행렬길이 산정방법인 대기차량대수$\times$평균차두간격은 대기행렬내 밀도가 일정하지 않아 부적합함을 재확인함. 6. 혼잡초기를 제외한 혼잡기간 중 대기행렬길이는 밀도데이터 없이도 혼잡 상류부의 도착교통량과 병목지점 본선통과교통량만을 이용하여 추정이 가능함. 7. 이상에 연구한 결과를 토대로, 고속도로 대기행렬길이를 산정할 수 있는 기초적인 도형을 제시함.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.1-8
• /
• 1999

In order to provide appropriate Quality of Service(QoS) guarantee to each traffic flow in intergrated service networks, an efficient traffic scheduling algorithm as well as resource reservation must be adopted in host and transit routers. In this paper, a new efficient fair queueing algorithm which adopts a linearly increasing virtual time is presented. The proposed algorithm is fair and the maximum and mean delay guaranteed of each flow are less than those of the SCFQ(self clocked fair queueing) algorithm which is one of the most promising traffic scheduling algorithm, while providing low implementation complexity as the SCFQ scheme. And, it has the better isolation provided than SCFQ, which means that each flow is much less influenced by the violating traffic flows provided its allocated bandwidth gurantee. The fairness of the proposed algorithm is proved and simulation results of maximum and mean delay presented.

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

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.45-52
• /
• 2002

This paper proposes the fuzzy closed RCMP queueing network model using fuzzy set theory for the performance evaluation of centralized distributed processing system with ambiguous system factors in the network environments. This model can derive the measures for system performances such as the job spending time, the system throughput, average job number and server utilizations using fuzzy mean value analysis which can process the fuzzy factors. Computer simulation has been performed centralized distributed system with fuzzy service requirement time for verifying the effectiveness of derived equations of performance evaluation according to the numbers of clients, and the results were analyzed. The proposed model provides more and flexible realistic than performance evaluation of conventional method when we evaluated system performance with ambiguous factors.

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

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.69-76
• /
• 2012

This paper proposes an efficient power consumption scheme using sleep mode in home gateway. The scheme by this paper classifies incoming real time packet and non-real time packet in home gateway and delay non-real time packet. Therefore, the home gateway can have longer sleep time because non-real time packet can get additional delay time by proposing mechanism using timer. We use non-preemptive two priority queueing model for performance analysis. As a results, we verify that power consumption of proposed scheme is reduced more than existing scheme by delay of non-real time traffic.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.710-715
• /
• 2004

The design problem of manufacturing system is addressed, adopting the closed queueing network model with multiple loops and re-entrant flows. The entire design problem is divided into two hierarchical sub-problems of (1) determining the station configuration and (2) optimizing the lot constitution; then they are tackled by neighbor search algorithm (NSA) and greedy mean value analysis (GMVA), respectively. Unlike the conventional MVA concerning multi-class closed queueing networks, the GMVA doesn't stick to a fixed lot proportion; rather it tries to find the optimal balance. The NSA, on the other hand, improves the object function value by altering the station configuration successively with its superior neighbor. The moderate time complexity, presented in big-${o}$ notation, enables us to apply the method even to the large-size practical cases, and the CPU time of an enlarged problem can be approximated by the same equation. The validity of our analytic approach is backed up by simulation studies with a widespread simulation package.

• Korean Management Science Review
• /
• v.27 no.1
• /
• pp.17-31
• /
• 2010

Patients entering an emergency care center in a hospital usually visit medical processes in different orders depending on the urgency level and the medical treatments required. We formulate the patient flows among diverse processes in an emergency care center using the Jackson network, which is one of the queueing networks, in order to evaluate the system performances such as the expected queue length and the expected waiting time. We present a case study based on actual data collected from an emergency care center in a hospital, in order to prove the validity of applying the Jackson network model in practice. After assessing the current system performances, we provide operational strategies to reduce waiting at the bottleneck processes and evaluate the impact of those strategies on the entire system.

• 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개를 가지며, 전체 공유주파수대역폭은 채널수에 채널당 대역폭의 곱으로 산출이 가능하다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.63-79
• /
• 2006

In this study we consider a CONWIP system in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied immediately are either backordered or lost according to the number of demands that exist at their arrival Instants. For this system we develop an approximation method to calculate performance measures such as steady state probabilities of the number of parts at each station, proportion of lost demands and the mean number of backordered 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 are compared with those obtained by simulation. Comparisons with simulation show that the approximation method provides fairly good results.