• 한국산업정보학회논문지
• /
• 제12권4호
• /
• pp.107-118
• /
• 2007

A single-server queueing model with infinite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of an accepted batch arrive one-by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. Analysis of the joint distribution of the number batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. Effect of control on the main performance measures of the system is demonstrated numerically.

• 한국통신학회논문지
• /
• 제28권1C호
• /
• pp.9-13
• /
• 2003

We consider a two-phase queueing system with Bernoulli feedback. Customers arrive at the system according to a Poison process and receive batch service in the first phase followed by individual services in the second phase. Each customer who completes the individual service returns to the tail of the second phase service queue with probability 1 -$\sigma$. This type of queueing problem cad be easily found in computer and telecommunication systems. By deriving a relationship between the generating functions for system size at various embedded epochs, we obtain the system size distribution. The exhaustive and gated cases for the batch service are considered.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 춘계종합학술대회
• /
• pp.263-267
• /
• 2000

기존의 트래픽 분석은 포아손 분포나 마르코프 모델로 트래픽을 모델링하고, 패킷의 큐 도착을 지수분포로 가정하였으나, 지난 몇 년간의 연간결과 네트워크 트래픽은 비주기성 및 버스트 특성을 가심을 알게 되었다 이러한 트래픽의 특성은 자기유사 특성을 가진 새로운 트래픽 모델로 분석 하므로써, 네트워크의 확장성, QoS, 그리고 최적화된 설계를 가능하게 한다. 본 논문에서는 시뮬레이션 망을 통한 small-scale 에서의 혼재된 트래픽 특성과 실제 WAN의 도착 지연시간, 그리고 전체망의 이용률에 대한 각각의 자기유사특성을 분석 한다.

• 한국정보통신학회논문지
• /
• 제4권2호
• /
• pp.289-295
• /
• 2000

인터넷에서 제공되는 멀티미디어 데이터의 서비스 품질 및 트래픽 파라메타인 사용자 트래픽의 최대 발생률, 데이터 전송시간지연과 변동 허용치, 최대 버스트 길이의 자기유사 특성을 가진 트래픽 모델로 분석 하므로써, 네트워크의 확장성, Quality of Service 그리고 최적화된 설계를 유추하였으며 시뮬레이션 네트워크를 통한 트래픽 지연 특성과 처리율을 분석하였다.

• Journal of applied mathematics & informatics
• /
• 제38권3_4호
• /
• pp.351-373
• /
• 2020

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.435-444
• /
• 1995

We propose a new approach to the calculation of the exact cells loss probability in a shared buffer ATM multiplexer, which is loaded with homogeneous discrete-time ON-OFF sources. Renewal cycles are identified in regard to the state of input sources and the buffer state on each renewal circle is modelled as a K(shared buffer size)-state Markov chain. We also analyze the behavior of queue build-up at the shared buffer whose distribution together with the steady-state probabilities of the Markov chain leads to the exact cell loss probability. Our approach to obtaining the exact cell loss probability seems to be more efficient than most of other existing ones since our underlying Markov chain has less number of states.

• 한국산업정보학회논문지
• /
• 제23권5호
• /
• pp.19-32
• /
• 2018

본 논문은 연속형 내부재고를 갖는 M/M/1 대기행렬모형을 다룬다. 고객은 포아송과정으로 도착하고 선입선출 서비스를 받는다. 각 고객의 서비스시간은 독립적이며 동일한 지수분포를 따른다. 고객은 서비스를 받기 위해 일반분포를 따르는 확률변수 H의 내부재고를 소비하며, 서비스 완료시점에 감소한다고 가정한다. 재고시스템은 전통적인 (s,S)-정책에 따라 운용되며, 재고의 조달 시간은 일반분포를 따른다고 가정한다. 재고가 없는 기간에 도착한 고객은 유실된다. 본 논문은 이처럼 운영되는 재고-대기행렬모형의 고객수 및 재고량에 대한 안정상태 결합확률분포를 유도하고 수치예를 보인다. 또한 장기적인 비용을 최소화하는 재고운용정책을 고찰한다.

• 천문학회보
• /
• 제40권2호
• /
• pp.27.2-27.2
• /
• 2015

Strategic plan of Subaru science and operation will be introduced. Currently, Subaru has wide variety of instruments, conducts only classical observations, with less than 5 nights allocation for each proposal. Near future, Subaru will emphasize on surveys, introduce queue mode observations, reduce the number of instruments, and concentrate on large size programs. Large surveys are called Subaru Strategic Programs (SSPs). HSC-SSP is on-going (300 nights for 5 years), PFS-SSP will start at around 2020 (360 nights for 5 years), and IRD-SSP from 2016 (TBD). HSC science includes 1) cosmology with gravitational lensing, 2) lensing studies of galaxies and clusters, 3) photometric redshifts, 4) the Solar system, 5) the Milky Way and the Local Group, 6) AGN/quasars, 7) transients, 8) galaxies at low/high redshifts, and 9) clusters of galaxies. PFS science includes 1) cosmology, 2) galaxy & AGN, and 3) galactic archaeology. Subaru is planning the third pillar instrument, so called ULTIMATE-Subaru, which is the GLAO optical-NIR wide field camera & multi-IFU spectrograph for finding galaxies at ultra high redshift (z>10). Finally the strategy from Subaru to TMT will be presented. Subaru will conduct four major SSPs (HSC, PFS, IRD, ULTIMATE-Subaru) in coming decade to provide targets to TMT. HSC performs wide field surveys to reveal the distribution of dark matter in the Universe. IRD surveys Earth-like young planets to discover ~20 Earth-like habitable planets. PFS studies the expanding Universe to provide a few million emission line galaxies to TMT.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.133-146
• /
• 2001

In a dynamic load distribution policies, each node gathers the current system sates information before making a decision on load balancing. Load balancing policies based on this strategy can suffer from processor thrashing. In this paper, we propose a new algorithm which attempts to decrease the frequency of the processor thrashing, the algorithm is based on the integration of three components. The first, the algorithm of which determine the size of jobs be transferred. The second, negotiation protocol with obtains a mutual agreement between a sender and a receiver on the transferring job size. And the third, a symmetrically-initiated location policy. The algorithm proposed in this paper used Siman IV as simulation tool to prove the improvement of performance. I analyzed the result of simulation, and compared with related works. The mean response time shows that there are no difference with existing policy, but appear a outstanding improvement in high load. The thrashing coefficient that shows the average response time, CPU overhead and the thrashing ratio at both the receiving and sending node has been used in the analysis. A significant improvement in the average response time and the CPU overhead ratio was detected using our algorithm when an overhead occurred in the system over other algorithm. The thrashing coefficient differed in the sending node and the receiving node of the system. Using our algorithm, the thrashing coefficient at the sending node showed more improvement when there was an overhead in the system, proving to be more useful. Therefore, it can be concluded that the thrashing ratio can be reduce by properly setting the maximum and minimum value of the system’s threshold queue.