• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.866-872
• /
• 2005

본 연구는 비축출형 우선순위 2-계층 대기행렬을 다룬다. 각 계층별 고객들은 마코비안 도착과정(Markovian arrival process, MAP)에 의하여 시스템에 도착하고, 각 계층마다 고유의 임계점을 갖는다. 시스템 내에 고객들이 존재하지 않으면 서어버는 유휴해지고 어느 계층이든지 상관없이 계층에 부여된 임계점에 먼저 도달하면 서어버는 서비스를 시작한다. 우선순위가 높은 고객들을 먼저 서비스하는 비축출형 우선순위 서비스규칙을 따른다. 본 연구에서는 각 계층별 고객들의 대기시간분포에 대한 라플라스(Laplace-Stieltjes) 변환과 평균 대기시간을 유도한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.18-26
• /
• 2006

여러 형태의 고객이 외부로부터 포아송과정에 따라 각 대기행렬에 도착하고 정해진 서비스규칙에 따라 해당 서비스를 받은 후 마코비안 확률분포에 따라 시스템을 떠나거나 다른 형태의 고객으로 시스템을 다시 돌아 올 수도 있는 M/G/1 대기행렬시스템을 고려한다. 본 연구에서는 기존의 연구 모형을 확장하여 계층적 서비스 규칙을 갖는 우선순위 대기행렬모형을 제시하고 이에 대한 시스템 성능척도를 보다 체계적으로 구할 수 있는 방법을 소개한다. 이를 위하여 먼저 대기행렬시스템의 거동을 나타내는 시스템 상태를 정의하고, 바쁜기간과 서비스기간 분석을 통하여 시스템 상태의 선형 함수로 평균체제시간을 구할 수 있음을 보인다.

• ICROS
• /
• v.1 no.3
• /
• pp.92-100
• /
• 1995

본 연구에서는 페트리 네트를 사용하여 모델링된 이산 사건 시스템의 제어시 발생하는 충돌 현상을 해결하기 위하여 퍼지 개념을 사용하였다. 이를 통하여 페트리 네트로 시스템을 제어할 경우 발생하는, 큰 문제점인 외부 시스템과의 데이터 입출력 설정의 어려움을 해결하는 방법을 보였다. 또한 제시된 규칙 행렬의 단순성으로부터 쉽게 충돌 현상하의 우선 순위를 변화시킬 수 있다. 시스템을 제어하는 전문가의 지식이 모호하여 단순히 상수값으로 우선순위를 표현할 수 없는 경우에는 퍼지개념을 이용하여 해결하였다. 이러한 방법들은 소규모의 모터 자동 조립 시스템을 제어하는데 부품의 수량, 작업의 대기 상태를 퍼지화하여 규칙행렬을 만들어 제어신호를 발생시켰다. FMS, CIM을 제어할 때 발생하는 Scheduling 문제도 본 논문의 방법을 사용하면 해결할 수 있다고 본다.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.589-595
• /
• 2017

We present an estimation model for optimal channel capacity required to data traffic transmission. The optimal channel capacity should be calculated in order to satisfy the permitted transmission delay of each wireless data services. Considering the discrete-time operation of digital communication systems and batch arrival of packet-switched traffic for various wireless services, $Geo^x$/G/1 non-preemptive priority queueing model is analyzed. Based on the heuristic interpretation of the mean waiting time, the mean waiting times of various data packets which have the service priority. Using the mean waiting times of service classes, we propose the procedure of determining the optimal channel capacity to satisfy the quality of service requirement of the mean delay of wireless services. We look forward to applying our results to improvement in wireless data services and economic operation of the network facilities.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1104-1110
• /
• 2006

In this paper we present a simple approach to the joint queue length distribution in the nonpreemptive priority M/G/1 queue. Without using the supplementary variable technique, we derive the joint probability generating function of the stationary queue length at arbitrary time.

• Journal of KIBIM
• /
• v.11 no.3
• /
• pp.1-11
• /
• 2021

BIM is one of the means of reducing the economic loss caused by design errors. These features of BIM have led to increased use of BIM. With the increasing use of BIM, several studies have been conducted to analyze the performance of BIM. As the importance of BIM staff is emphasized in the performance analysis of BIM, the human resource allocation of BIM staff can become an important research issue. However, there are few studies to measure the workforce effectiveness of BIM staff. Ham et al (2020) measured BIM workforce efficiency using FCFS queue model rules. Since design errors can have different effects on the project depending on the type, there are design errors that must be dealt with first. Therefore, in this study, a priority queue was used to solve design errors with high priority first. The performance of BIM-based design verification was analyzed by quantitatively analyzing the performance of BIM staff when the priority rule was applied to the design error processing sequence.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.4
• /
• pp.162-170
• /
• 2012

We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.4
• /
• pp.442-449
• /
• 2012

Cognitive Radio(CR) is the technology that allocates the frequency by using dynamic spectrum access. We proposed a model to calculate the optimal level of the cognitive radiotelegraph, where secondary users opportunistically share the spectrum with primary users through the spectrum sensing. When secondary user with cognitive radio detects the arrival of a primary user in its current channel, the secondary user moves to the idle channel or be placed in the virtual queue. We assume that the primary users have finite buffers and the population of secondary users is finite. Using a two-dimensional Makov model with preemptive priority queueing, we could derive the blocking and waiting probability as well as the optimal level of cognitive radiotelegraph under a various range of parameter circumstances.

• IE interfaces
• /
• v.25 no.3
• /
• pp.283-289
• /
• 2012

M/G/1 queue with server vacations period depending on the previous vacation and customer's arrival is considered. Most existing studies on M/G/1 queue with server vacations assume that server vacations are independent of customers' arrival. However, some vacations are terminated by some class of customers' arrival in certain queueing systems. In this paper, therefore, we investigate M/G/1 queue with server vacations where each vacation period has different distribution and vacation length is influenced by customers' arrival. Laplace-Stieltjes transform of the waiting time distribution and the distribution of number of customers waiting for each class of customers are respectively derived. As performance measures, mean waiting time and average number of customers waiting for each class of customers are also derived.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.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.