• Title/Summary/Keyword: markov chain

Search Result 888, Processing Time 0.022 seconds

Multimedia Traffic Analysis using Markov Chain Model in CDMA Mobile Communication Systems (CDMA 이동통신 시스템에서 멀티미디어 트래픽에 대한 마르코프 체인 해석)

  • 김백현;김철순;곽경섭
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1219-1230
    • /
    • 2003
  • We analyze an integrated voice/data CDMA system, where the whole channels are divided into voice prioritized channels and voice non-prioritized channels. For real-time voice service, a preemptivc priority is granted in the voice prioritized channels. And, for delay-tolerant data service, the employment of buffer is considered. On the other hand, the transmission permission probability in best-effort packet-data service is controlled by estimating the residual capacity available for users. We build a 2-dimensional markov chain about prioritized-voice and stream-data services and accomplish numerical analysis in combination with packet-data traffic based on residual capacity equation.

  • PDF

Performance of Dynamic Spectrum Access Scheme Using Embedded Markov Chain (임베디드 마르코프 체인을 이용한 동적 스펙트럼 접속 방식의 성능 분석)

  • Lee, Yutae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.9
    • /
    • pp.2036-2040
    • /
    • 2013
  • In this paper, we consider two dynamic spectrum access schemes in cognitive network with two independent and identically distributed channels. Under the first scheme, secondary users switch channel only after transmission failure. On the other hand, under the second one, they switch channel only after successful transmission. We develop a mathematical model to investigate the performance of the second one and analyze the model using 3-dimensional embedded Markov chain. Numerical results and simulations are presented to compare between the two schemes.

Uncertainty reduction of seismic fragility of intake tower using Bayesian Inference and Markov Chain Monte Carlo simulation

  • Alam, Jahangir;Kim, Dookie;Choi, Byounghan
    • Structural Engineering and Mechanics
    • /
    • v.63 no.1
    • /
    • pp.47-53
    • /
    • 2017
  • The fundamental goal of this study is to minimize the uncertainty of the median fragility curve and to assess the structural vulnerability under earthquake excitation. Bayesian Inference with Markov Chain Monte Carlo (MCMC) simulation has been presented for efficient collapse response assessment of the independent intake water tower. The intake tower is significantly used as a diversion type of the hydropower station for maintaining power plant, reservoir and spillway tunnel. Therefore, the seismic fragility assessment of the intake tower is a pivotal component for estimating total system risk of the reservoir. In this investigation, an asymmetrical independent slender reinforced concrete structure is considered. The Bayesian Inference method provides the flexibility to integrate the prior information of collapse response data with the numerical analysis results. The preliminary information of risk data can be obtained from various sources like experiments, existing studies, and simplified linear dynamic analysis or nonlinear static analysis. The conventional lognormal model is used for plotting the fragility curve using the data from time history simulation and nonlinear static pushover analysis respectively. The Bayesian Inference approach is applied for integrating the data from both analyses with the help of MCMC simulation. The method achieves meaningful improvement of uncertainty associated with the fragility curve, and provides significant statistical and computational efficiency.

RCM applied to distribution system maintenance : modeling using modified semi-Markov chain (배전계통 유지보수에 RCM기법의 적용을 위한 modified semi-Markov chain modeling)

  • Park, Geun-Pyo;Moon, Jong-Fil;Yoon, Yong-Tae;Lee, Sang-Seung;Kim, Jae-Chul
    • Proceedings of the KIEE Conference
    • /
    • 2006.11a
    • /
    • pp.126-128
    • /
    • 2006
  • 현재 배전부분도 사업부체제로 진행됨에 따라 구역 및 지역별로 배전계통을 운영하는 경쟁체제에 돌입하게 되었다. 또한 각 사업부별로 예산을 추진하여 배전계통을 운영하게 되며 배분된 예산으로 배전계통의 신뢰도 및 경제적 운영을 일정 수준으로 유지하여 타 사업부와 사업성을 경쟁해야 한다. 특히, 각 배전 사업부별로 경쟁해야 하므로 최소의 비용으로 최대의 유지보수 효과를 얻을 수 있는 방법을 개발해야 하며, 비용을 최소로 하여 최적의 점검 주기를 찾는 문제는 중요하다고 할 수 있다. 본 논문에서는 최적 유지보수 기기 선정과 최적 유지보수 주기를 결정하는데 있어서 적합한 기법인 배전 계통 유지보수 기법(Reliability Centered Maintenance, RCM)을 이용하였다. 이의 구현을 위하여 Markov chain 기법을 배전 계통 기기의 유지보수 모델에 적합하도록 수정하여 유지보수에 필요한 비용과 기기의 고장으로 인하여 발생할 수 있는 정전비용 등을 고려하여 최적의 점검 주기를 결정하고자 한다. 제안된 RCM의 알고리즘은 Dynamic Programming을 이용하여 점검 및 유지보수에 필요한 기기를 결정하는 부분과 유지보수의 실행 여부를 결정하는 decision 부분으로 되어있다. 사례연구를 통하여 본 논문에서 제안된 알고리즘의 적용가능성을 살펴보았다.

  • PDF

A Development of Markov Chain Monte Carlo History Matching Technique for Subsurface Characterization (지하 불균질 예측 향상을 위한 마르코프 체인 몬테 카를로 히스토리 매칭 기법 개발)

  • Jeong, Jina;Park, Eungyu
    • Journal of Soil and Groundwater Environment
    • /
    • v.20 no.3
    • /
    • pp.51-64
    • /
    • 2015
  • In the present study, we develop two history matching techniques based on Markov chain Monte Carlo method where radial basis function and Gaussian distribution generated by unconditional geostatistical simulation are employed as the random walk transition kernels. The Bayesian inverse methods for aquifer characterization as the developed models can be effectively applied to the condition even when the targeted information such as hydraulic conductivity is absent and there are transient hydraulic head records due to imposed stress at observation wells. The model which uses unconditional simulation as random walk transition kernel has advantage in that spatial statistics can be directly associated with the predictions. The model using radial basis function network shares the same advantages as the model with unconditional simulation, yet the radial basis function network based the model does not require external geostatistical techniques. Also, by employing radial basis function as transition kernel, multi-scale nested structures can be rigorously addressed. In the validations of the developed models, the overall predictabilities of both models are sound by showing high correlation coefficient between the reference and the predicted. In terms of the model performance, the model with radial basis function network has higher error reduction rate and computational efficiency than with unconditional geostatistical simulation.

A Novel Spectrum Access Strategy with ${\alpha}$-Retry Policy in Cognitive Radio Networks: A Queueing-Based Analysis

  • Zhao, Yuan;Jin, Shunfu;Yue, Wuyi
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.193-201
    • /
    • 2014
  • In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

Evaluating the Investment in the Malaysian Construction Sector in the Long-run Using the Modified Internal Rate of Return: A Markov Chain Approach

  • SARSOUR, Wajeeh Mustafa;SABRI, Shamsul Rijal Muhammad
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.7 no.8
    • /
    • pp.281-287
    • /
    • 2020
  • In capital budgeting practices, investment project evaluations based on the net present value (NPV) and the internal rate of return (IRR) represent the traditional evaluation techniques. Compared with the traditional methods, the modified internal rate of return (MIRR) gives the opportunity to evaluate an investment in certain projet, while taking the changes in cash flows over time and issuing shares such as dividing shares, bonuses, and dividend for each end of the investment year into account. Therefore, this study aims to evaluate an investment in the Malaysian construction sector utilizing financial data for 39 public listed companies operating in the Malaysian construction sector over the period from Jan 1, 2007, to December 30, 2018, based on the MIRR method. Stochastic was studied in this study to estimate the estimated probability by applying the Markov chain model to the MIRR method where the transition matrix has two possible movements of either Good (G) or Bad (B). it is found that the long-run probability of getting a good investment is higher than the probability of getting a bad investment in the long-run, where were the probabilities of good and bad are 0.5119, 0.4881, respectively. Hence, investment in the Malaysian construction sector is recommended.

A New Mobility Modeling and Comparisons of Various Mobility Models in Zone-based Cellular Networks (영역 기준 이동통신망에서 이동성의 모형화 및 모형들의 비교 분석)

  • Hong, J.S.;Chang, I.K.;Lee, J.S.;Lie, C.H.
    • IE interfaces
    • /
    • v.16 no.spc
    • /
    • pp.21-27
    • /
    • 2003
  • Objective of this paper is to develop the user mobility model(UMM) which is used for the performance analysis of location update and paging algorithm and at the same time, consider the user mobility pattern(UMP) in zone-based cellular networks. User mobility pattern shows correlation in space and time. UMM should consider these correlations of UMP. K-dimensional Markov chain is presented as a UMM considering them where the states of Markov chain are defined as the current location area(LA) and the consecutive LAs visited in the path. Also, a new two dimensional Markov chain composed of current LA and time interval is presented. Simulation results show that the appropriate size of K in the former UMM is two and the latter UMM reflects the characteristic of UMP well and so is a good model for the analytic method to solve the performance of location update and paging algorithm.

Novel Approach for Modeling Wireless Fading Channels Using a Finite State Markov Chain

  • Salam, Ahmed Abdul;Sheriff, Ray;Al-Araji, Saleh;Mezher, Kahtan;Nasir, Qassim
    • ETRI Journal
    • /
    • v.39 no.5
    • /
    • pp.718-728
    • /
    • 2017
  • Empirical modeling of wireless fading channels using common schemes such as autoregression and the finite state Markov chain (FSMC) is investigated. The conceptual background of both channel structures and the establishment of their mutual dependence in a confined manner are presented. The novel contribution lies in the proposal of a new approach for deriving the state transition probabilities borrowed from economic disciplines, which has not been studied so far with respect to the modeling of FSMC wireless fading channels. The proposed approach is based on equal portioning of the received signal-to-noise ratio, realized by using an alternative probability construction that was initially highlighted by Tauchen. The associated statistical procedure shows that a first-order FSMC with a limited number of channel states can satisfactorily approximate fading. The computational overheads of the proposed technique are analyzed and proven to be less demanding compared to the conventional FSMC approach based on the level crossing rate. Simulations confirm the analytical results and promising performance of the new channel model based on the Tauchen approach without extra complexity costs.

A Reliability Redundancy Optimization Problem with Continuous Time Absorbing Markov Chain (연속시간 흡수 마코프체인을 활용한 신뢰도 중복 최적화 문제)

  • Kim, Gak-Gyu;Baek, Seungwon;Yoon, Bong-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.4
    • /
    • pp.290-297
    • /
    • 2013
  • The increasing level of operation in high-tech industry is likely to require ever more complex structure in reliability problem. Furthermore, system failures are more significant on society as a whole than ever before. Reliability redundancy optimization problem (RROP) plays a important role in the designing and analyzing the complex system. RROP involves selection of components with multiple choices and redundancy levels for maximizing system reliability with constraints such as cost, weight, etc. Meanwhile, previous works on RROP dealt with system with perfect failure detection, which gave at most a good solution. However, we studied RROP with imperfect failure detection and switching. Using absorbing Markov Chain, we present not a good solution but the optimal one. In this study, the optimal system configuration is designed with warm and cold-standby redundancy for k-out-of-n system in terms of MTTF that is one of the performance measures of reliability.