• East Asian mathematical journal
• /
• 제27권1호
• /
• pp.23-33
• /
• 2011

Due to underutilization of spectrum under current inefficient and static spectrum management policy, various kinds of opportunistic spectrum access (OSA) strategies have appeared. Myopic policy is a simple and robust OSA strategy with reduced complexity that maximizes immediate throughput. In this paper, we propose mathematical models to evaluate the throughput and the MAC delay of a myopic policy under saturation tra c conditions. Using the MAC delay distribution, we evaluate the packet delay of secondary users under nonsaturation conditions. Numerical results are given to show the performance of the myopic policy in cognitive radio networks.

• East Asian mathematical journal
• /
• 제30권1호
• /
• pp.23-29
• /
• 2014

To solve inefficient spectrum usage problem under current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy, which maximizes immediate throughput, is a simple and robust strategy with reduced complexity. In this paper, we present a simple mathematical model to evaluate the saturation throughput and medium access delay of a myopic policy in the presence of multiple channels.

• 대한수학회지
• /
• 제35권3호
• /
• pp.503-525
• /
• 1998

In the theory of retrial queues it is usually assumed that the flow of primary customers is Poisson. This means that the number of independent sources, or potential customers, is infinite and each of them generates primary arrivals very seldom. We consider now retrial queueing systems with a homogeneous population, that is, we assume that a finite number K of identical sources generates the so called quasi-random input. We present a survey of the main results and mathematical tools for finite source retrial queues, concentrating on M/G/1//K and M/M/c//K systems with repeated attempts.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2005년도 춘계학술대회
• /
• pp.25-29
• /
• 2005

We analyze an M/G/1 queueing system under $P_{\lambda,\tau}^M$ service policy. By using the level crossing theory and solving the corresponding integral equations, we obtain the stationary distribution of the workload in the system explicitly.

• 산업경영시스템학회지
• /
• 제23권61호
• /
• pp.13-22
• /
• 2000

To apply the queueing network theory in evaluating performances of flexible manufacturing systems, it is generally assumed that the processing times are distributed exponentially. However, in FMS, processing times are usually deterministic. In this study the performance measures of FMS are approximated under the assumption that processing times are usually deterministic. Multi-classes of parts and single server and multi-server stations are considered in the model. This study also that, in the numerical example, this approach yields better solutions than those obtained by the pure Linearizer algorithm, when the processing times are deterministic.

• Journal of the Korean Statistical Society
• /
• 제26권3호
• /
• pp.355-363
• /
• 1997

In queueing theory, polling systems have been widely studied as a way of serving several stations in cyclic order. In this paper we consider Markov-modulated Poisson process which is useful for approximating a superposition of heterogeneous arrivals. We derive the mean waiting time of each station in a polling system where the arrival process is modeled by a Markov-modulated Poisson process.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.476-480
• /
• 2002

The theory of constraints (TOC) has become a valuable system in modern operations management. Using the ideas and methods of the TOC, companies can achieve a large reduction of work-in-process and finished-goods inventories, significant improvement in scheduling performance, and substantial earnings increase. The purpose of this paper is to calculate the optimal size of the time buffer which is used to accommodate disruptions in production processes and provide maximum productivity of capacity constrained resources. After the problem formulation in terms of single server queueing model, we observed the system behavior by sensitivity analyses.

• 대한산업공학회지
• /
• 제28권3호
• /
• pp.256-263
• /
• 2002

This paper addresses a planning problem in a pickup-delivery transportation' system under dynamic vehicle dispatching. We present a procedure to determine a fleet size in which stochastic characteristics of vehicle travels are considered. Statistical approach and queueing theory are applied to estimate vehicle travel time and vehicle waiting time, based on which an appropriate fleet size is determined. Simulation experiments are performed to verify the proposed procedure.

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

We consider a multiechelon repairable-item inventory system where several bases are supported by a central depot and the external repair facilities. Unlike METRIC- based models, there are only a finite number of repair channels at each base, central depot and the external repair facilities. It is desired to find repair capacities and spares level which together guarantee a specified service level at minimum cost. Closed queueing network theory is used to model the stochastic process. The purpose of this paper is to derive the steady-state distributions of this system.

• 한국항해항만학회지
• /
• 제31권3호
• /
• pp.205-212
• /
• 2007

인천항에서는 인천대교 건설을 계기로 남외항 건설을 추진함과 더불어 인천 내항 등의 기능 재배치가 추진되고 있다. 본 논문은 기능 재배치 계획에 따라 2011년과 2015년의 해상교통량을 추정하고, 내항의 갑문 운용에 따른 선박의 대기시간을 항만운용 시뮬레이션에 의하여 분석하여 내항에 기항하는 선박들의 체선 체화비용을 산정 분석하고자 하였으며, 최종적으로 2011년부터 2015년까지 내항에 기항하던 컨테이너선들의 남항/남외항으로의 이전에 따른 경제적 효과를 평가하고자 한다. 주요한 연구결과는 다음과 같다. (1) 갑문 이용율이 약 $7\sim8%P$ 낮아졌다. (2) 갑문 대기시간 및 체선 체화비용이 약 25%P 절감되는 효과가 나타났다. (3) 자문 이용료와 선석 이전에 따른 항로 단축 편익 등을 제외하고 갑문 운용에 따라 발생되는 체선 체화비용은 연간 약 8억원의 절감효과가 있었다.