• 제목/요약/키워드: Stationary distribution

검색결과 339건 처리시간 0.024초

Stationary Distribution for the Mobilities in Catastrophe Rescue Scenario

  • Wang, Yong;Peng, Wei;Dou, Qiang;Gong, Zhenghu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권2호
    • /
    • pp.308-326
    • /
    • 2013
  • Mobility Model has drawn more and more attentions since its critical role in Mobile Wireless Networks performance evaluation. This paper analyzes the mobility patterns in the catastrophe rescue scenario, and proposes the Random Waypoint with Base Point mobility model to model these characteristics. We mathematically analyze the speed and spatial stationary distributions of the nodes and derive explicit expressions for the one dimensional case. In order to keep the stationary distribution through the entire simulation procedure, we provide strategies to initialize the speed, location and destination of the nodes at the beginning of the simulation. The simulation results verify the derivations and the proposed methods in this paper. This work gives a deep understanding of the properties of the Random Waypoint with Base Point mobility model and such understanding is necessary to avoid misinterpretation of the simulation results. The conclusions are of practical value for performance analysis of mobile wireless networks, especially for the catastrophe rescue scenario.

Stationary 분포를 이용한 군수지원 우선순위 결정 및 추천 알고리즘 설계 (Designing an Algorithm for the Priority Deciding and Recommending of the Logistic Support with Stationary Distribution)

  • 노기섭;정시현;김종권;오하영
    • 정보과학회 논문지
    • /
    • 제41권12호
    • /
    • pp.1075-1080
    • /
    • 2014
  • 전쟁에서의 승리를 담보하는 핵심적 역할 중 하나는 최적의 군수지원을 통해 전투력을 극대화하고 지속능력을 가능한 장기적으로 유지하는 것이다. 주요 무기체계의 효과적인 사용을 위한 다양한 군수지원 방법론이 지속적으로 제안되고 있으나, 모든 군수지원 요소를 종합적으로 고려한 군수지원 접근법에 대한 연구는 전무한 실정이다. 본 논문에서는 기존 군수지원의 주요 방법론 이었던 고장률 분석을 통한 접근법에서 벗어나, 비용, 수송, 고장률, 정비, 시스템 복잡도 등 군수지원의 다양한 요소를 종합적으로 식별하여, 각각의 영향력을 결합할 수 있는 방법론과 stationary 분포를 이용한 최적의 군수지원 우선순위를 결정하여 추천하는 알고리즘을 최초로 제안한다.

An M/G/1 queue under the $P_{\lambda,\tau}^M$ service policy

  • Kim, Jong-Woo;Lee, Ji-Yeon
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 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.

  • PDF

BMAP/M/N/O Queueing System in Random Environments

  • 김제숭
    • 한국품질경영학회:학술대회논문집
    • /
    • 한국품질경영학회 2007년도 춘계학술대회
    • /
    • pp.461-465
    • /
    • 2007
  • The BMAP/M/N/O queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is calculated. Loss probability and other performance measures are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.

  • PDF

A Renewal Theorem for Random Walks with Time Stationary Random Distribution Function

  • Hong, Dug-Hun
    • Journal of the Korean Statistical Society
    • /
    • 제25권1호
    • /
    • pp.153-159
    • /
    • 1996
  • Sums of independent random variables $S_n = X_1 + X_ + cdots + X_n$ are considered, where the X$_{n}$ are chosen according to a stationary process of distributions. Given the time t .geq. O, let N (t) be the number of indices n for which O < $S_n$ $\geq$ t. In this set up we prove that N (t)/t converges almost surely and in $L^1$ as t longrightarrow $\infty$, which generalizes classical renewal theorem.m.

  • PDF

An M/G/1 Queue under the $P_\lambda\;^M$ with a Setup Time

  • Lee Jiyeon;Kim Jongwoo
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2004년도 학술발표논문집
    • /
    • pp.301-306
    • /
    • 2004
  • We consider the $P_\lambda\;^M$ service policy for an M/G/1 queue in which the service rate is increased from 1 to M at the exponential setup time after the level of workload exceeds $\lambda$. The stationary distribution of the workload is explicitly obtained through the level crossing argument.

  • PDF

D-MAP 도착과정을 갖는 이산시간 대기행렬모형에서의 분포적 Little의 법칙과 D-MAP/D/c 모형에의 응용

  • 김남기
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.1101-1103
    • /
    • 2006
  • For a broad class of discrete-time FIFO queueing systems with D-MAP (discrete-time Markovian arrival process) arrivals, we present a distributional Little's law that relates the distribution of the stationary number of customers in system (queue) with that of the stationary number of slots a customer spends in system (queue). Taking the multi-server D-MAP/D/c queue for example, we illustrate how to utilize this relation to get the desired distribution of the number of customers.

  • PDF

A New Approach to an Inventory with Constant Demand

  • Lee, Eui-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제19권4호
    • /
    • pp.1345-1352
    • /
    • 2008
  • An inventory with constant demand is studied. We adopt a renewal argument to obtain the transient and stationary distribution of the level of the inventory. We show that the stationary distribution can be also derived by making use of either the level crossing technique or the renewal reward theorem. After assigning several managing costs to the inventory, we calculate the long-run average cost per unit time. A numerical example is illustrated to show how we optimize the inventory.

  • PDF

통신망 트래픽 제어를 위한 BMAP/M/N/0 대기행렬모형 분석 (Analysis of BMAP/M/N/0 Queueing System for Telecommunication Network Traffic Control)

  • 이석준;김제숭
    • 산업경영시스템학회지
    • /
    • 제30권4호
    • /
    • pp.39-45
    • /
    • 2007
  • The BMAP/M/N/0 queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is derived. Loss probability and other performance measures of the system also are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.

WEAK CONVERGENCE FOR INTERATED RANDOM MAPS

  • Lee, Oe-Sook
    • 대한수학회보
    • /
    • 제35권3호
    • /
    • pp.485-490
    • /
    • 1998
  • We consider a class of discrete parameter processes on a locally compact Polish space $S$ arising from successive compositions of strictly stationary Markov random maps on $S$ into itself. Sufficient conditions for the existence of the stationary solution and the weak convergence of the distributions of $\{\Gamma_n \Gamma_{n-1} \cdots \Gamma_0x \}$ are given.

  • PDF