• 제목/요약/키워드: Poisson arrival

검색결과 94건 처리시간 0.028초

강우의 특성 변화에 따른 유출 특성의 변화분석: 소유역과 중규모 유역에의 적용 비교 (Analysis of Flood Runoff Characteristics due to Rainfall Pattern Change: Comparison of Applications to Small and Medium Size Basins)

  • 유철상;김경준
    • 한국수자원학회논문집
    • /
    • 제39권5호
    • /
    • pp.417-430
    • /
    • 2006
  • 본 연구에서는 강우의 특성변화가 유출 특성에 미치는 영향을 파악하기 위하여 구형펄스모형으로 모의시킨 강우를 선형저수지 모형과 Nash 모형에 유출모의하여 그 유출량에 대한 확률밀도함수와 강우의 확률 밀도함수를 비교하였다. 이를 통해 강우의 발생빈도, 강우강도, 지속시간이 유출에 어떻게 기여하는지에 대하여 파악하였다. 소규모 유역과 중규모 유역에 대한 영향을 분석하기 위하여 두 개의 대상유역을 선정하였다. 그 결과 강우의 발생빈도, 강우강도, 지속시간의 변화에 대하여 유출량이 다양한 특성을 보이는 것을 확인 할 수 있었으며, 이는 향후 기후변화에 대한 영향을 평가하는데 적용될 수 있을 것이라 판단된다.

A Task Scheduling Strategy in Cloud Computing with Service Differentiation

  • Xue, Yuanzheng;Jin, Shunfu;Wang, Xiushuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권11호
    • /
    • pp.5269-5286
    • /
    • 2018
  • Task scheduling is one of the key issues in improving system performance and optimizing resource management in cloud computing environment. In order to provide appropriate services for heterogeneous users, we propose a novel task scheduling strategy with service differentiation, in which the delay sensitive tasks are assigned to the rapid cloud with high-speed processing, whereas the fault sensitive tasks are assigned to the reliable cloud with service restoration. Considering that a user can receive service from either local SaaS (Software as a Service) servers or public IaaS (Infrastructure as a Service) cloud, we establish a hybrid queueing network based system model. With the assumption of Poisson arriving process, we analyze the system model in steady state. Moreover, we derive the performance measures in terms of average response time of the delay sensitive tasks and utilization of VMs (Virtual Machines) in reliable cloud. We provide experimental results to validate the proposed strategy and the system model. Furthermore, we investigate the Nash equilibrium behavior and the social optimization behavior of the delay sensitive tasks. Finally, we carry out an improved intelligent searching algorithm to obtain the optimal arrival rate of total tasks and present a pricing policy for the delay sensitive tasks.

SAN을 이용한 제한된 버퍼 크기를 갖는 출력큐잉 ATM 스위치 성능평가 (Performance Evaluation of Output Queueing ATM Switch with Finite Buffer Using Stochastic Activity Networks)

  • 장경수;신호진;신동렬
    • 한국정보처리학회논문지
    • /
    • 제7권8호
    • /
    • pp.2484-2496
    • /
    • 2000
  • 네트워크 연결을 위한 고속 스위치는 계속해서 발달하여 왔으며, 스위치가 필요한 성능을 내는가를 여러 조건으로 분석하는 것은 중요한 일이다. 하지만, 복잡한 구조를 가진 시스템을 모델링하여 그 성능을 측정하는 것은 쉬운 일이 아니다. 큐잉이론을 이용한 모델링은 큰 상태 공간을 고려해야 됨은 물론이고 성능평가에 있어서도 복잡한 계산과정을 수행해야 하지만, SAN(Stochastic Activity Networks)에 의한 모델링과 성능평가는 그에 비해 간단하다는 장점이 있다. 본 논문의 목적은 출력포트에 큐를 갖는 고속 ATM 스위치를 확장된 SPN(Stochastic Petri Net)인 SAN을 이용해 모델링하고, 셀 도착 과정은 실제 트래픽과 유사한 특징을 가지고 있는 MMPP(Markov Modulated Poisson Process)로 모델링하여 그 성능을 평가하는데 있다. MMPP 모델을 이용한 버스티 트래픽을 고겨한 성능측정과 아울러 SAN의 장점을 이용한 확장이 용이한 스위치 모델을 보이고자 한다. 제한된 버퍼 크기를 갖는 출력 큐잉 ATM 스위치에 도착하은 셀은 포아송 도착 과정에서는 정확히 표현할 수 없는 버스티 특징을 표현할 수 있어 좀더 실제 트래픽에 가까운 MMPP로 모델링한다. SAN 모델은 UltraSAN 소프트웨어 패키지를 이용해 대기행렬의크기, 지연시간 그리고 셀 손실률에 대한 성능을 측정한다.

  • PDF

물류시스템 분석에 관한 연구 - 부산항을 중심으로 - (A Study on the Analysis of Container Physical Distribution System -Pusan Port Oriented-)

  • Park, C.H.;Lee, C.Y.
    • 한국항만학회지
    • /
    • 제5권2호
    • /
    • pp.19-37
    • /
    • 1991
  • This work aims to : establish a model of the container physical distribution system of Pusan port comprising 4 sub-systems of a navigational system, on-dock cargo handling/transfer/storage system, off-dock CY system and an in-land transport system : examine the system regarding the cargo handling capability of the port and analyse the cost of the physical distribution system. The overall findings are as follows : Firstly in the navigational system, average tonnage of the ships visiting the Busan container terminal was 33,055 GRT in 1990. The distribution of the arrival intervals of the ships' arriving at BCTOC was exponential distribution of $Y=e^{-x/5.52}$ with 95% confidence, whereas that of the ships service time was Erlangian distribution(K=4) with 95% confidence, Ships' arrival and service pattern at the terminal, therefore, was Poisson Input Erlangian Service, and ships' average waiting times was 28.55 hours In this case 8berths were required for the arriving ships to wait less than one hour. Secondly an annual container through put that can be handled by the 9cranes at the terminal was found to be 683,000 TEU in case ships waiting time is one hour and 806,000 TEU in case ships waiting is 2 hours in-port transfer capability was 913,000 TEU when berth occupancy rate(9) was 0.5. This means that there was heavy congestion in the port when considering the fact that a total amount of 1,300,000 TEU was handled in the terminal in 1990. Thirdly when the cost of port congestion was not considered optimum cargo volume to be handled by a ship at a time was 235.7 VAN. When the ships' waiting time was set at 1 hour, optimum annual cargo handling capacity at the terminal was calculated to be 386,070 VAN(609,990 TEU), whereas when the ships' waiting time was set at 2 hours, it was calculated to be 467,738 VAN(739,027 TEU). Fourthly, when the cost of port congestion was considered optimum cargo volume to be handled by a ship at a time was 314.5 VAN. When the ships' waiting time was set at I hour optimum annual cargo handling capacity at the terminal was calculated to be 388.416(613.697 TEU), whereas when the ships' waiting time was set 2 hours, it was calculated to be 462,381 VAN(730,562 TEU).

  • PDF

일산화탄소중독(一酸化炭素中毒)의 진료대책(診療對策) 수립(樹立)을 위한 추계학적(推計學的) 연구(硏究) (A Stochastic Study for the Emergency Treatment of Carbon Monoxide Poisoning in Korea)

  • 김용익;윤덕로;신영수
    • Journal of Preventive Medicine and Public Health
    • /
    • 제16권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.

  • PDF

실시간스캔과 배치스캔을 갖춘 안티바이러스시스템의 운영 분석 (Analysis on Operation of Anti-Virus Systems with Real-Time Scan and Batch Scan)

  • 양원석;김태성
    • 한국통신학회논문지
    • /
    • 제38B권11호
    • /
    • pp.861-869
    • /
    • 2013
  • 본 논문에서는 정보시스템에 바이러스가 ${\lambda}$의 비율을 갖는 포아송 프로세스를 따라 도착한다고 가정한다. 정보시스템에는 바이러스를 검출하고 치료하기 위해 실시간스캔과 배치스캔의 두가지 방식으로 안티바이러스시스템을 운용하고 있다. 실시간스캔 방식에서는 바이러스가 시스템에 도착하자마자 스캔하게 되어 무한 용량의 안티바이러스시스템을 보유한 것과 같은 효과가 있다. 스캔과 치료에 소요되는 시간은 일반분포를 따르는 것으로 가정한다. 배치스캔 방식에서는 시스템 관리자가 일정한 시간 간격마다 정기적으로 시스템을 스캔하여 시스템에 존재하는 바이러스들을 동시에 치료한다. 본 논문에서는 안티바이러스시스템의 동작을 확률적으로 모형화하고 경제적으로 최적운용정책이 달성되는 조건을 유도한다. 비용 요소를 고려하여 실제적인 운용 환경에서의 시사점을 제시할 수 있는 수치예제도 제시한다.

A Study on Calculating Relevant Length of Left Turn Storages Using UAV Spatial Images Considering Arrival Distribution Characteristics at Signalized Intersections in Urban Commercial Areas

  • Yang, Jaeho;Kim, Eungcheol;Na, Young-Woo;Choi, Byoung-Gil
    • 한국측량학회지
    • /
    • 제36권3호
    • /
    • pp.153-164
    • /
    • 2018
  • Calculating the relevant length of left turn storages in urban intersections is very crucial in road designs. A left turn lane consists of deceleration lanes and left turn storages. In this study, we developed methods for calculating relevant lengths of left turn storages that vary at each intersection using UAV (Unmanned Aerial Vehicle) spatial images. Problems of conventional design techniques are applying the same number of left turn vehicles (N) using Poisson distribution without considering land use types, using a vehicle length that may not be measurable when applying the length of waiting vehicles (S), and using same storage length coefficient (${\alpha}$), 1.5, for every intersections. In order to solve these problems, we estimated the number of left turn vehicles (N) using an empirical distribution, suggested to use headways of vehicles for (S) to calculate the length of waiting vehicles (S) with a help of using UAV spatial images, and defined ranges of storage length coefficient (${\alpha}$) from 1.0 to 1.5 for flexible design. For more convenient design, it is suitable to classify two cases when possible to know and impossible to know about ratio of large trucks among vehicles when planning an intersection. We developed formula for each case to calculate left turn storage lengths of a minimum and a maximum. By applying developed methods and values, more efficient signalized intersection operation can be accomplished.

경기도 하남시 인근 호상편마암 지역에서 Suspension P-S 속도검층 자료분석 (Data Analysis of Suspension P-S Velocity Logging in Banded Gneiss Area around Hanam, Gyeonggi Province)

  • 유영철;송무영;임국묵
    • 지질공학
    • /
    • 제17권4호
    • /
    • pp.623-631
    • /
    • 2007
  • 경기도 하남시 풍산동 소재 시험시추공에서 획득된 SPS 속도검층자료를 이용하여 이 지역에 분포하는 호상편마암의 동적물성치를 추정하였다. 연구방법은 전처리과정과 속도분석, 감쇄지수와 관련된 Q factor를 도출하였고 단열정보와 탄성파 속도관계식을 산출하였다. 신선한 암반의 Vp는 5,559m/s, Vs는 3,063m/s로 나타났으며 포아슨비는 0.28로 해석되었다. 이를 이용하여 동적물성치를 구하였고 초음파 텔레뷰어로 산출한 단열정보를 이용하여 단열에 따른 초동지연, 진폭변화비, 속도와의 상관성을 파악하였다. 측정된 검층공은 미세단열이 대부분이며 이러한 경암내 미세단열 지역에서는 단열틈 크기와 단열빈도가 탄성파 속도의 변수로 작용하는 것으로 나타난다.

(s,S)-정책하의 연속형 내부재고를 갖는 M/M/1 대기행렬모형 분석 (Analysis of an M/M/1 Queue with an Attached Continuous-type (s,S)-inventory)

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

대기행렬이론과 Q-러닝 알고리즘을 적용한 지역문화축제 진입차량 주차분산 시뮬레이션 시스템 (A Simulation of Vehicle Parking Distribution System for Local Cultural Festival with Queuing Theory and Q-Learning Algorithm)

  • 조영호;서영건;정대율
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제29권2호
    • /
    • pp.131-147
    • /
    • 2020
  • Purpose The purpose of this study is to develop intelligent vehicle parking distribution system based on LoRa network at the circumstance of traffic congestion during cultural festival in a local city. This paper proposes a parking dispatch and distribution system using a Q-learning algorithm to rapidly disperse traffics that increases suddenly because of in-bound traffics from the outside of a city in the real-time base as well as to increase parking probability in a parking lot which is widely located in a city. Design/methodology/approach The system get information on realtime-base from the sensor network of IoT (LoRa network). It will contribute to solve the sudden increase in traffic and parking bottlenecks during local cultural festival. We applied the simulation system with Queuing model to the Yudeung Festival in Jinju, Korea. We proposed a Q-learning algorithm that could change the learning policy by setting the acceptability value of each parking lot as a threshold from the Jinju highway IC (Interchange) to the 7 parking lots. LoRa Network platform supports to browse parking resource information to each vehicle in realtime. The system updates Q-table periodically using Q-learning algorithm as soon as get information from parking lots. The Queuing Theory with Poisson arrival distribution is used to get probability distribution function. The Dijkstra algorithm is used to find the shortest distance. Findings This paper suggest a simulation test to verify the efficiency of Q-learning algorithm at the circumstance of high traffic jam in a city during local festival. As a result of the simulation, the proposed algorithm performed well even when each parking lot was somewhat saturated. When an intelligent learning system such as an O-learning algorithm is applied, it is possible to more effectively distribute the vehicle to a lot with a high parking probability when the vehicle inflow from the outside rapidly increases at a specific time, such as a local city cultural festival.