• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.121-126
• /
• 2008

It is of great practical interest to decide when to stop testing a software system in development phase and transfer it to the user. This decision problem called an optimal release policies. In this paper discussed to specify an optimal release policies. In this paper, propose an optimal release policies of the life distribution applied Erlang distribution of special pattern of Gamma distribution. In this paper, discuss optimal software release policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement. From Sensitivity Analysis, make out estimating software optimal release time.

• Journal of Applied Reliability
• /
• v.6 no.2
• /
• pp.151-161
• /
• 2006

This article is concerned with cost analysis model in periodic maintenance policy. The repair policy is differently applied according as unit importance during an item being used and unit restoration during an item being failed. So in this paper the repair policy with minimal repair is considered as follow : as the occurrence of failure between minimal repair and periodic interval time, unit is replaced by a spare unit until the periodic maintenance time arrived. Then total expected cost per unit time is calculated according to scale parameter of failure distribution in a view of customer's. The total expected costs are included repair and usage cost : operating, fixed, minimal repair, periodic maintenance and spare unit cost. Numerical example is shown in which failure time of item has Erlang distribution.

• ETRI Journal
• /
• v.8 no.3
• /
• pp.29-43
• /
• 1986

어떤 고장이 시스팀의 기능을 완전히 마비시키는 것이 아니라 그 성능이 저하된 상태에서 운용할 수 있는 degradable system에서는 고전적인 신뢰도 모형을 적용하기가 어려우며, 여기서 성능과 신뢰도는 매우 밀접한 관련이 있다. 본고에서는 성능신뢰도(Performance reliability)에 대한 개념 및 모형화 방법에 대해 살펴보고 실제로 TDX-1의스위치 네트워크인 SWCD의 성능을 해석하여 성능신뢰도를 구하였다. SWCD의 성능척도인 통화성공률에 영향을 미치는 요인으로는 스위치 네트워크 내에서의 blocking, T-SW 및 S-SW의 고장, 그리고 T-SW 및 S-SW의 고장으로 인해 DLC 와 TLC의 가용한 서비스 채널이 감소함으로써 발생하는 DLC 및 TLC에서의 blocking등을 들 수 있는데 이 요인들을 고려하여 SWCD의 성능을 해석하였으며, SWCD에 요구되는 표준성능(Normalized performance) 이 0.99라 할 때 single unit라고 가정한 경우 SWCD의 성능 신뢰도는 MTUO(Mean Time to Unreliable Operation)가 3076.7시간이었다. 또한 성능을 해석하는 과정에서 디지틀 스위치 네트워크인 SWC만의 최대 발신 통화처리 용량을 구한 결과, 스위치 네트워크 내에서의 blocking 확률에 대한 최대 허용치를 $10^-3$으로 하였을 때 약 1,700Erlang이었다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.10
• /
• pp.1911-1915
• /
• 2009

The problem of determining the proper capacity of electric vehicle charging station is studied in the presented paper. Based on the expected arrival rate and the expected charging time, we calculate the proper capacity that guarantees electric vehicles get service better than a given lower bound which is termed the loss of charging probability. The problem is studied by using certain queueing models. We first formulate the problem as a queueless model of type M/M/n/n, known as the Erlang loss system. And then the M/M/n/K type queueing model is formulated to consider the parking space constraint. Results of the study may be used for designing the electric vehicle charging station.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.199-201
• /
• 2003

현재 셀룰러(Cellular) 코어(Core) 망에서의 회선산출은 얼랑(Erlang) B 이론으로부터 출발하고 있다 시도호(attempted call)의 특성이 포아송(Poisson)분포임을 가정한 얼랑 공식으로부터 유도된 얼랑 B 테이블을 통해 각구간의 트래픽 및 목표 호손율(Block Rate)에 맞는 적절한 회선 수를 산출한다. 본 논문에서는 유선 전화망에서 주로 쓰이던 얼랑 B 이론이 이동통신 셀룰러 코어 방에서도 적용될 수 있는지의 여부를 판단하기 위해서 1500만 이상의 가입자를 보유하고 있는 셀룰러 코어 망을 실험대상으로 하였다. 트래픽 분포 및 얼랑 B 호손율을 검증하기 위해 실측 실험을 하였으며, 과금 데이터(Billing Data)를 이용하여 실측 실험과 같은 결과를 얻기 위해 Block Generating Program을 개발하였다. 총 108개 루트(Route)에 대한 측정 실험 결과 50%의 트래픽만이 포아송 분포 특성을 만족함을 알아내었고, 포아송 분포를 벗어난 트래픽에서의 얼랑 B 테이블의 보정 방법을 실제 실험 데이터의 통계특성에 따라 도출하는 방식을 제안한다.

• Journal of Korean Society of Transportation
• /
• v.21 no.3
• /
• pp.107-120
• /
• 2003

Over the decades, a lot of studies have dealt with the traffic characteristics and phenomena at a merging area. However, relatively few analytical techniques have been developed to evaluate the traffic flow at the area and, especially, the ramp merging capacity has rarely been. This study focused on the merging behaviors that were characterized by the relationship between the shoulder lane flow and the on-ramp flow, and modeled these behaviors to determine ramp merge capacity by using gap acceptance theory. In the process of building the model, both an ideal mergence and a forced mergence were considered when ramp-merging vehicles entered the gap provided by the flow of the shoulder lane. In addition, the model for the critical gap was proposed because the critical gap was the most influential factor to determine merging capacity in the developed models. The developed models showed that the merging capacity value was on the increase as the critical gap decreased and the shoulder lane volume increased. This study has a meaning of modeling the merging behaviors including the forced merging type to determine ramp merging capacity more precisely. The findings of this study would help analyze traffic phenomena and understand traffic behaviors at a merging area, and might be applicable to decide the primary parameters of on-ramp control by considering the effects of ramp merging flow.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.809-819
• /
• 2000

This paper deals with an optimal capacity allocation problem and performance analysis in Advanced Information Communication Processing System(AICPS). AICPS is a gateway system interconnection PSTN(Public Switched Telephone Network), ISDN(Intergrated Services Digital Network), PSDN(Packet Switched Data Network), internet, Frame Relay and ATM together. This study considers not only ISDN and Internet but also user behavior of On-line service which is analyzed by Markov process. A call blocking probability of TNAS and INAS is computed by Erlang's formula. Then, PNAS and WNAS's call blocking probability are computed by Stochastic knapsack modeling. The result is compared with result of simulation. Finally, we allocate an optimal capacity minimizing total call blocking probability.

• Journal of the Korean Institute of Navigation
• /
• v.7 no.1
• /
• pp.1-32
• /
• 1983

The delay due to congestion has recently attracted widespread attention with the analysis of over-all operation at the port. But, the complexity of the situation is evident in view of the large number of factors which impinge on the considerable end. Queueing theory is applicable to a large scale transportation system which is associated with arrivals of vessels in a large port. The attempt of this paper is to make an extensive analysis of the port transport system and its economic implications from the viewpoint that port is one of the physical distribution facilities and a kind of queueing system which includes ships and cargoes as port customer. By analyzing the real data on the Port of Pusan, it is known that this port can be represented as a set of multi-channel with identical setof Poisson arrival and Erlang service time, and also it is confirmed that the following formula is suitable to calculate the mean delay in this port, namely, $W_4={\frac{\rho}{\lambda(1-\rho)} {\frac{e_N(\rho{\cdot}N)}{D_{N-1}(\rho{\cdot}N)}$ where, ${\lambda}$: mean arrival rate $\mu$: mean servicing rate; N: number of servicing channel; ${\rho}$: utillization rate (${\lambda}/N{\mu}$) $e_N$: the Poisson function Coming to grips with the essentials of the cost of delay due to congestion, a simple ship journey cost model is adopted and the operating profit sensitivity to variation in port time is examined, and for purpose of a future development for port princing service the marginal cost is approximately calculated on the basis of queueing theory.

• Journal of the military operations research society of Korea
• /
• v.2 no.1
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• Industrial Engineering and Management Systems
• /
• v.4 no.2
• /
• pp.158-164
• /
• 2005

Kusukawa and Ohta presented the $CS_{CQ-r}$ chart to monitor the process defect $rate{\lambda}$ in high-yield processes that is derived from the count of defects. The $CS_{CQ-r}$ chart is more sensitive to $monitor{\lambda}$ than the CQ (Cumulative Quantity) chart proposed by Chan et al.. As a more superior chart in high-yield processes, we propose a Synthetic chart that is the integration of the CQ_-r chart and the $CS_{CQ-r}$chart. The quality characteristic of both charts is the number of units y required to observe r $({\geq}2)$ defects. It is assumed that this quantity is an Erlang random variable from the property that the quality characteristic of the CQ chart follows the exponential distribution. In use of the proposed Synthetic chart, the process is initially judged as either in-control or out-of-control by using the $CS_{CQ-r}$chart. If the process was not judged as in-control by the $CS_{CQ-r}$chart, the process is successively judged by using the $CQ_{-r}$chart to confirm the judgment of the $CS_{CQ-r}$chart. Through comparisons of ARL (Average Run Length), the proposed Synthetic chart is more superior to monitor the process defect rate in high-yield processes to the stand-alone $CS_{CQ-r}$ chart.