• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.669-676
• /
• 2009

HTTP or audio/video streaming services are good candidates for future centralized navigation system and in order to provide stability for such services, service providers use a cluster of web servers. In this paper, we provide the criteria for web server cluster design of vehicular users with consideration of differentiated access per different user classes. Several feasible scenarios are examined and their performance analysis using queueing theory is presented to provide the foundation for web server cluster design using traffic load balancer. Through the thorough analysis, efficient criteria for traffic load balancer design is derived. In order to satisfy users' service requirements, priority services controlled by traffic load balancer are considered and analyzed. We also provide the evaluation of the accuracy of the analytical model through simulation.

• Journal of Preventive Medicine and Public Health
• /
• v.16 no.1
• /
• pp.135-152
• /
• 1983

Emergency medical service is an important part of the health care delivery system, and the optimal allocation of resources and their efficient utilization are essentially demanded. Since these conditions are the prerequisite to prompt treatment which, in turn, will be crucial for life saving and in reducing the undesirable sequelae of the event. This study, taking the hyperbaric chamber for carbon monoxide poisoning as an example, is to develop a stochastic approach for solving the problems of optimal allocation of such emergency medical facility in Korea. The hyperbaric chamber, in Korea, is used almost exclusively for the treatment of acute carbon monoxide poisoning, most of which occur at home, since the coal briquette is used as domestic fuel by 69.6 per cent of the Korean population. The annual incidence rate of the comatous and fatal carbon monoxide poisoning is estimated at 45.5 per 10,000 of coal briquette-using population. It offers a serious public health problem and occupies a large portion of the emergency outpatients, especially in the winter season. The requirement of hyperbaric chambers can be calculated by setting the level of the annual queueing rate, which is here defined as the proportion of the annual number of the queued patients among the annual number of the total patients. The rate is determined by the size of the coal briquette-using population which generate a certain number of carbon monoxide poisoning patients in terms of the annual incidence rate, and the number of hyperbaric chambers per hospital to which the patients are sent, assuming that there is no referral of the patients among hospitals. The queueing occurs due to the conflicting events of the 'arrival' of the patients and the 'service' of the hyperbaric chambers. Here, we can assume that the length of the service time of hyperbaric chambers is fixed at sixty minutes, and the service discipline is based on 'first come, first served'. The arrival pattern of the carbon monoxide poisoning is relatively unique, because it usually occurs while the people are in bed. Diurnal variation of the carbon monoxide poisoning can hardly be formulated mathematically, so empirical cumulative distribution of the probability of the hourly arrival of the patients was used for Monte Carlo simulation to calculate the probability of queueing by the number of the patients per day, for the cases of one, two or three hyperbaric chambers assumed to be available per hospital. Incidence of the carbon monoxide poisoning also has strong seasonal variation, because of the four distinctive seasons in Korea. So the number of the patients per day could not be assumed to be distributed according to the Poisson distribution. Testing the fitness of various distributions of rare event, it turned out to be that the daily distribution of the carbon monoxide poisoning fits well to the Polya-Eggenberger distribution. With this model, we could forecast the number of the poisonings per day by the size of the coal-briquette using population. By combining the probability of queueing by the number of patients per day, and the probability of the number of patients per day in a year, we can estimate the number of the queued patients and the number of the patients in a year by the number of hyperbaric chamber per hospital and by the size of coal briquette-using population. Setting 5 per cent as the annual queueing rate, the required number of hyperbaric chambers was calculated for each province and for the whole country, in the cases of 25, 50, 75 and 100 per cent of the treatment rate which stand for the rate of the patients treated by hyperbaric chamber among the patients who are to be treated. Findings of the study were as follows. 1. Probability of the number of patients per day follows Polya-Eggenberger distribution. $$P(X=\gamma)=\frac{\Pi\limits_{k=1}^\gamma[m+(K-1)\times10.86]}{\gamma!}\times11.86^{-{(\frac{m}{10.86}+\gamma)}}$$ when$${\gamma}=1,2,...,n$$$$P(X=0)=11.86^{-(m/10.86)}$$ when $${\gamma}=0$$ Hourly arrival pattern of the patients turned out to be bimodal, the large peak was observed in $7 : 00{\sim}8 : 00$ a.m., and the small peak in $11 : 00{\sim}12 : 00$ p.m. 2. In the cases of only one or two hyperbaric chambers installed per hospital, the annual queueing rate will be at the level of more than 5 per cent. Only in case of three chambers, however, the rate will reach 5 per cent when the average number of the patients per day is 0.481. 3. According to the results above, a hospital equipped with three hyperbaric chambers will be able to serve 166,485, 83,242, 55,495 and 41,620 of population, when the treatmet rate are 25, 50, 75 and 100 per cent. 4. The required number of hyperbaric chambers are estimated at 483, 963, 1,441 and 1,923 when the treatment rate are taken as 25, 50, 75 and 100 per cent. Therefore, the shortage are respectively turned out to be 312, 791. 1,270 and 1,752. The author believes that the methodology developed in this study will also be applicable to the problems of resource allocation for the other kinds of the emergency medical facilities.

• Journal of Digital Contents Society
• /
• v.5 no.1
• /
• pp.7-11
• /
• 2004

There are many problems that must solve to construct next generation high-speed communication network. Among these, item that must consider basically is characteristics analysis of traffic that nows to network Traffic characteristics of many Internet services that is offered present have shown that network traffic exhibits at a wide range of scals-self-similarity. Self-similarity is expressed by long term dependency, this is contradictory concept with Poisson model that have relativity short term dependency. Therefore, first of all, for design and dimensioning of next generation communication network, traffic model that are reflected burstiness and self-similarity is required. Here self-similarity can be characterized by Hurst parameter. In this paper, the calculation equation is derived considering queueing delay and self-similarity of data traffic art compared with simulation results.

• Proceedings of the KOR-KST Conference
• /
• 1996.12a
• /
• pp.81-108
• /
• 1996

첨단교통정보시스템(ATIS)의 핵심 요소라 할 수 있는 동적경로안내 시스템(Dynamic Route Guidance System : DRGS)은 운전자가 목적지에 도착하기까지 실시간 교통정보를 토대로 최적경로를 안내해 줌으로써 날로 심화되어 가고 있는 교통혼잡을 최소화할 수 있으리라 기대를 모으고 있다. 특히 교통사고나 긴급도로공사 등으로 인해 발생하는 돌발적 교통혼잡하에서는 DRGS의 역할이 더욱 커질 것으로 예상되고 있다. 본 논문은 돌발적 교통혼잡하에서 보다 효과적인 DRGS의 경로 안내 알고리즘을 개발하는 데 그 목적이 있다. 이를 위해서 우선 하부구조기반(Infrastructure Based) DRGS와 개인차량기반(In-vehicle Based)DRGS의 장단점을 운전자, 교통행정당국, 그리고 교통체계관점에서 비교하였고, 시스템 아키텍쳐와 경로안내 알고리즘간의 상호관계를 규명하였다. 또한 효율적인 경로안내를 위해 사용자 평형(User Equilibrium)경로안내전략과 시스템최적화(System Optimal) 경로안내전략을 이상형 교통망(Idealistic Network)을 통해 비교분석하였다. 여기에는 현재 ITS-America에서 System Architecture 평가를 위해 사용한 INTEGRATION이라는 ITS Simulation Model과 그 통행저항함수를 사용하였다. 이를 토대로 돌발적 교통혼잡상황 아래서 사용자평형 경로안내를 제공할 경우 야기될 수 있는 Braess` Paradox 문제와, 총통행시간을 최소화하기 위한 시스템최적 경로안내를 제공할 경우 일어날 수 있는 사용자 호응도(User Compliance)문제를 동시에 고려한 적응형 동적경로안내 알고리즘을 개발하였다. 여기에는 돌발적 교통혼잡하에서 통행시간을 동적으로 예측하기 위해 이산형 확정적 대기행렬모형(Discrete Deterministic Queueing Model)이 사용되었다. 한편 알고리즘의 효율성을 평가하기 위해 이상형 교통망과, 실제 미국 Virginia 주의 Fairfax County에 소재한 주간 고속도로 66번(I-66)과 인접 교통망의 교통자료를 사용하여 각종 돌발교통 혼잡 상황을 전제로 한 Traffic Simulation과 정보제공시나\리오를 INTEGRATION Model을 이용해 실행하였다. 그 결과 적응형 알고리즘이 개개인의 최단시간 경로를 제공하는 사용자 평형 경로안내전략에 비해 교통혼잡도와 정체시간의 체류정도에 따라 3%에서 10%까지 전체통행시간을 절약할 수 있다는 결론을 얻었다.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.217-226
• /
• 2001

In this paper, for continuous media access operations performed by Clustered Continuous Media Storage Server (CCMSS) system, we present the analytical model based on the open queueing network, which considers simultaneously two critical delay factors, the disk I/O and the internal network, in the CCMSS system. And we derive by using the analytical model the stochastic model for the total service delay time in the system. Next, we propose the integrated stochastic admission control model for the CCMSS system, which estimate the maximum number of admittable service requests at the allowable service failure rate by using the derived stochastic model and apply the derived number of requests in the admission control operation. For the performance evaluation of the proposed model, we evaluated the deadline miss rates by means of the previous stochastic model considering only the disk I/O and the propose stochastic model considering the disk I/O and the internal network, and compared the values with the results obtained from the simulation under the real cluster-based distributed media server environment. The evaluation showed that the proposed admission control policy reflects more precisely the delay factors in the CCMSS system.

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.65-74
• /
• 2019

For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.219-228
• /
• 2004

Confidence interval estimators for proportions using normal approximation have been commonly used for coverage analysis of simulation output even though alternative approximate estimators of confidence intervals for proportions were proposed. This is -because the normal approximation was easier to use in practice than the other approximate estimators. Computing technology has no problem with dealing these alternative estimators. Recently, one of the approximation methods for coverage analysis which is based on arcsin transformation has been used for estimating proportion and for controlling the required precision in [12]. In this paper, we compare three approximate interval estimators, based on a normal distribution approximation, an arcsin transformation and an F-distribution approximation, of a single proportion. Three estimators were applied to sequential coverage analysis of steady-state means, in simulations of the M/M/1/$\infty$ and W/D/l/$\infty$ queueing systems on a single processor and multiple processors.

• Journal of the Korea Society for Simulation
• /
• v.20 no.1
• /
• pp.1-8
• /
• 2011

Cloud computing emerges as a new paradigm for deploying, managing and offering IT resources as a service anytime, anywhere on any devices. Cloud computing data center stores many IT resources through resource integration. So cloud computing system has to be designed by technology and policy to make effective use of IT resources. In other words, cloud vendor has to provide high quality services to all user and mitigate the dissipation of IT resources. However, vendors need to predict the performance of cloud services and the use of IT resources before releasing cloud service. For solving the problem, this research presents cloud service modeling on network environment and evaluation index for availability optimization of cloud service. We also study how to optimize an amount of requested cloud service and performance of datacenter using CloudSim toolkit.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.519-524
• /
• 2002

In this paper we study the qualify of sequential coverage analysis under a scenario of distributed stochastic simulation known as MRIP(Multiple Replications In Parallel) in terms of the confidence intervals of coverage and the speedup. The estimator based in the F-distribution was applied to the sequential coverage analysis of steady-state means. in simulations of the $M/M/1/{\infty},\;M/D/I/{\infty}\;and\;M/H_{2}/1/{\infty}$ queueing systems on a single processor and multiple processors. By using multiple processors under the MRIP scenario, the time for collecting many replications needed in sequential coverage analysis is reduced. One can also easily collect more replications by executing it in distributed computers or clusters linked by a local area network.

• Management Science and Financial Engineering
• /
• v.17 no.1
• /
• pp.45-63
• /
• 2011

The aim of this paper is to consider the process of supplying trained workers with knowledge and skills for upcoming business opportunities and the process of training apprentices to be prepared to meet future demands in an IT service firm. As the demand for new workers fluctuates, a firm should employ a buffer workforce such as apprentices or interns. However, as a result of rapid business development, the capacity of the buffer may be exceeded, thus requiring the company to recruit skilled workers from outside the firm. Therefore, it is important for a firm to map out a strategy for manpower planning so as to fulfill the demands of new business and minimize the operation costs related to training apprentices and recruiting experienced workers. First, this paper analyzes the supply and demand of workers for the IT service in a knowledge-intensive field. It then presents optimal human resource planning strategies via the familiar method of stochastic process. Also, we illustrate that our model is applied to the human resource planning of an information security service firm in South Korea.