• 한국도서관정보학회지
• /
• 제13권
• /
• pp.131-166
• /
• 1986

This study is designed to review the methods of duplicate copies decision making in the academic library. In this thesis, I surveyed queueing & markov model, statistical model, and simulation model. The contents of the study can be summarized as follows: 1) Queueing and markov model is used for one of duplicate copies decision-making methods. This model was suggested by Leimkuler, Morse, and Chen, etc. Leimkuler proposed growth model, storage model, and availability model through using system analysis method. Queueing theory is a n.0, pplied to Leimkuler's availability model. Morse ad Chen a n.0, pplied queueing and markov model to their theory. They used queueing theory for measuring satisfaction level and Markov model for predicting user demand. 2) Another model of duplicate copies decision-making methods is statistical model. This model is suggested by Grant and Sohn, Jung Pyo. Grant suggested a model with a formula to satisfy the user demand more than 95%, Sohn, Jung Pyo suggested a model with two formulars: one for duplicate copies decision-making by using standard deviation and the other for duplicate copies predicting by using coefficient of variation. 3) Simulation model is used for one of duplicate copies decision-making methods. This model is suggested by Buckland and Arms. Buckland considered both loan period and duplicate copies simultaneously in his simulation model. Arms suggested computer-simulation model as one of duplicate copies decision-making methods. These methods can help improve the efficiency of collection development and solve some problems (space, staff, budget, etc, ) of Korean academic libraries today.

• 한국시뮬레이션학회논문지
• /
• 제20권2호
• /
• pp.1-10
• /
• 2011

본 연구에서는 대기행렬네트워크 성과측정 방법 중의 한 가지로서 널리 이용되는 분해법의 구성요소로 제안된 변동성 함수 의 이론적 근거를 살펴보고 성과척도 측정의 정확도 제고를 위하여 회귀분석을 통한 변동성 함수의 모수추정 개선방안을 제안하고자 한다. 이를 위하여 변동성이 높은 도착과정과 서비스 과정이 포함된 직렬 대기행렬 네트워크에서의 이탈과정의 자동상관계수 함수를 추정하여 분해법에 사용할 수 있는 방안을 알아본다.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.153-162
• /
• 1997

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

• Communications for Statistical Applications and Methods
• /
• 제9권3호
• /
• pp.649-663
• /
• 2002

We consider an unlimited fluid queueing model which has Fractional Brownian motion(FBM) as an input and a single server of constant service rate. By using the result of Duffield and O'Connell(6), we investigate the asymptotic tail-distribution of the stationary work-load. When there are multiple homogeneous FBM inputs, the workload distribution is similar to that of the queue with one FBM input; whereas for the heterogeneous sources the asymptotic work-load distributions is dominated by the source with the largest Hurst parameter.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.285-295
• /
• 2001

We consider a queueing system under overload control to support bursty traffic. The queueing system under overload control is modelled by MMBP/D1/K queue with two thresholds on buffer. Arrival of customer is assumed to be a Markov-modulated Bernoulli process (MMBP) by considering burstiness of traffic. Analysis is done in discrete-time case. Using the generating function method, we obtain the stationary queue length distribution. Finally, the loss probability and the waiting time distribution of a customer are given.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2007년도 춘계학술대회
• /
• pp.461-465
• /
• 2007

The BMAP/M/N/O queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is calculated. Loss probability and other performance measures are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.131-142
• /
• 2005

This paper proposes queueing models for a Web server system which is composed of an infinite-buffer main server and finite-buffer auxiliary server(s). The system is modeled by the level-dependent quasi-birth- death (QBD) process. Utilizing the special structure of the QBD, we convert the infinite level-dependent QBD into a finite level-independent QBD and compute the state probabilities. We then explore the operational characteristics of the proposed web-server models and draw some useful conclusions.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.49-56
• /
• 1993

We consider a B/G/1 queueing system with vacations, where the server closes the gate when it begins a vacation. In this system, customers arrive according to a Bernoulli process. The service time and the vacation time follow discrete distributions. We obtain the distribution of the number of customers at a random point in time, and in turn, the distribution of the residence time (queueing time + service time) for a customer. This system finds an application in the performance evaluation of the DQDB protocol which has been adopted as the standard protocol for IEEE 802.6 MAN.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.271-275
• /
• 2005

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• Communications for Statistical Applications and Methods
• /
• 제4권2호
• /
• pp.497-505
• /
• 1997

We attempt to get a probabilistic model of a queueing system in the maximum entropy condition. Applying the maximum entropy principle to the queueing system, we obtain the most uncertain probability model compatible with the available information expressed by moments.