• Title/Summary/Keyword: Queueing Systems

Search Result 246, Processing Time 0.023 seconds

A Note on Common Mistakes about Stopped Random Sums Arising in Queueing Models (대기행렬 모형에서 틀리기 쉬운 정지랜덤합에 관한 소고)

  • Chae, Kyung-C.;Park, Hyun-M.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.3
    • /
    • pp.381-386
    • /
    • 1998
  • We frequently encounter stopped random sums when modelling queueing systems. We also notice occasional mishandling of stopped random sums in the literature. The purpose of this note is to prevent further mistakes by identifying and correcting typical mistakes about stopped random sums. As an example model, we use the two-phase M/G/1 queue with multiple vacations.

  • PDF

A study on the Design and the Performance Analysis of Radar Data Integrating Systems for a Early Warning System (조기경보 체제를 위한 통합 레이다 정보처리 시스템의 설계 및 성능분석에 관한 연구)

  • 이상웅;라극환;조동래
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.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.

  • PDF

Delay Analysis on Secure Data Communications (안전한 데이터 통신에서의 지연분석)

  • 신상욱;이경현
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1996.11a
    • /
    • pp.326-335
    • /
    • 1996
  • In this paper, we quantify the tradeoff between security and performance in secure data communication systems based on the queueing theory, and propose the optimization methods, such as the preprocessing, a message segmentation, compression, integration of compression and encryption and integration of user authentication and access control, which are able to reduce the delay induced by the security mechanisms and protocols. Moreover, we analyze the average delay for the secure data communication systems through the computer simulations, which are modeled by M/M/1, M/E$_2$/1 and M/H$_2$/1 queueing systems, respectively. We consider the DES, RSA digital signature and the combination of IDEA and RSA as security mechanisms for applying security services.

  • PDF

A novel approach for the design of multi-class reentrant manufacturing systems

  • Yoo, Dong-Joon;Jung, Jae-Hak;Lee, In-Beum;Lee, Euy-Soo;Yi, Gyeong-beom
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 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.

  • PDF

Calculation of the Number of Channels and Bandwidth for Common Frequency Band Based on Queueing Theory (대기행렬이론에 의한 공유주파수대역의 적정 채널수 및 대역폭 산출)

  • Lee, Gwang-Hui;Gang, Sang-Gi;Hwang, Taek-Jin;Hong, Heon-Jin;Cha, Jae-Sang;Lee, Il-Gyu;Yang, Chung-Mo;Kim, Seong-Gwon
    • 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개를 가지며, 전체 공유주파수대역폭은 채널수에 채널당 대역폭의 곱으로 산출이 가능하다.

  • PDF

Queueing System Operating in Random Environment as a Model of a Cell Operation

  • Kim, Chesoong;Dudin, Alexander;Dudina, Olga;Kim, Jiseung
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.2
    • /
    • pp.131-142
    • /
    • 2016
  • We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.

Performance Analysis of M/$E_k$/c/N Time-out Queueing System (타임아웃이 있는 M/$E_k$/c/N 대기시스템의 성능분석)

  • Ryu, Ji-Hyun;Jun, Chi-Hyuck
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.89-94
    • /
    • 2001
  • There are many queueing systems where customers wait for service up to a certain amount of time and leave the system if they are not served during that time. This paper considers a finite capacity multi-server queueing system with Poisson input and Erlang service time, where a customer becomes a lost customer when his service has not begun within an exponential patient time after his arrival. Performance measures such as average queue length, the average number of customers in service, and the proportion of lost customers can be obtained exactly through the proposed numerical solution procedure.

  • PDF

Analysis of the PC Communication System using Queueing Network (Queueing Network을 이용한 PC 통신 시스템 분석)

  • 오근태;김준홍
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.17 no.32
    • /
    • pp.53-62
    • /
    • 1994
  • This paper deals with the analysis of the PC communication service system performance which will be installed as a gateway between PSTN and PSDN. Firstly, we classify the data traffic pattern into interactive, conversational, and file transfer type from the actual statistics. Secondly, we model the system structure as a closed queueing network model with multiservers and multiple customer classes and derive the analytic method to be able to measure the system performance using Mean Value Analysis. Finally, the simulation results indicate that the analytic method obtained is a good approximation method to measure the system performance of the PC communication service system as a gateway between PSTN and PSDN.

  • PDF

The Optimal Spare Level of a Weapon System having Phase-type Repair Time (Phase-type 수리시간을 갖는 무기체계의 적정예비품수 결정)

  • Yoon, Hyouk;Lee, Sang-Jin
    • Korean Management Science Review
    • /
    • v.26 no.3
    • /
    • pp.145-156
    • /
    • 2009
  • The probability distribution of the repair process should be determined to choose the optimal spare level of a weapon system with a queueing model. Though most weapon systems have a multi-step repair process, previous studies use the exponential distribution for the multi-step repair process. But the PH distribution is more appropriate for this case. We utilize the PH distribution on a queueing model and solve it with MGM(Matrix Geometric Method). We derive the optimal spare level using the PH distribution and show the difference of results between the PH and exponential distribution.