• Title/Summary/Keyword: Non-Markovian process

Search Result 6, Processing Time 0.021 seconds

Analysis of Stop-and-Wait ARQ Protocol under Markovian interruption (Markovian 간섭 신호하에서의 Stop-­and-­Wait ARQ Protocol의 성능 분석)

  • 김성일;신병철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1674-1683
    • /
    • 2003
  • The performance of a packet data multiplexer with stop­and­wait ARQ protocols under Markovian interruption is considered in this work It is assumed that the input process, into the system is Poisson process, and that the output channel is divided into a series of time slots and a data packet can be transmitted in a slot time. In this system the round­trip propagation delay is defined to be the frame time. It is modeled that the output channel can be blocked by some Markevian interruption, whose state change between the blocking and non­-blocking states is given by Markov process. The overall system has been analyzed by constructing a relationship, taking the Markovian interruption into account, about the buffer behavior between the successive frames of slots. The validity of this analytical results has been verified by computer simulation.

A NON-MARKOVIAN EVOLUTION MODEL OF HIV POPULATION WITH BUNCHING BEHAVIOUR

  • Sridharan, V.;Jayshree, P.R.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.785-796
    • /
    • 1998
  • In this paper we propose a model of HIv population through method of phases with non-Markovian evolution of immi-gration. The analysis leads to an explicit differnetial equations for the generating functions of the total population size. The detection process of antibodies (against the antigen of virus) is analysed and an explicit expression for the correlation functions are provided. A measure of bunching is also introduced for some particular choice of parameters.

Fractional radioactive decay law and Bateman equations

  • Cruz-Lopez, C.A.;Espinosa-Paredes, G.
    • Nuclear Engineering and Technology
    • /
    • v.54 no.1
    • /
    • pp.275-282
    • /
    • 2022
  • The aim of this work is to develop the fractional Bateman equations, which can model memory effects in successive isotopes transformations. Such memory effects have been previously reported in the alpha decay, which exhibits a non-Markovian behavior. Since there are radioactive decay series with consecutive alpha decays, it is convenient to include the mentioned memory effects, developing the fractional Bateman Equations, which can reproduce the standard ones when the fractional order is equal to one. The proposed fractional model preserves the mathematical shape and the symmetry of the standard equations, being the only difference the presence of the Mittag-Leffler function, instead of the exponential one. This last is a very important result, because allows the implementation of the proposed fractional model in burnup and activation codes in a straightforward way. Numerical experiments show that the proposed equations predict high decay rates for small time values, in comparison with the standard equations, which have high decay rates for large times. This work represents a novelty approach to the theory of successive transformations, and opens the possibility to study properties of the Bateman equation from a fractional approach.

Dynamics of Pore Growth in Membranes and Membrane Stability

  • W. Sung;Park, P. J.
    • Proceedings of the Korean Biophysical Society Conference
    • /
    • 1998.06a
    • /
    • pp.15-15
    • /
    • 1998
  • Pores can form and grow in biomembranes because of factors such as thermal fluctuation, transmembrane electrical potential, and cellular environment. We propose a new statistical physics model of the pore growth treated as a non-Markovian stochastic process, with a free energy barrier and memory friction from the membrane matrix treated as a quasi-two-dimensional viscoelastic and dielectric fluid continuum.(omitted)

  • PDF

A Non-preemptive Priority 2-Class MAP/G/1 Queue with Individual Thresholds (다중 임계점을 고려한 비축출형 우선순위 2-계층 MAP/G/1 대기행렬모형)

  • Seo, Won-Ju;Lee, Ho-U
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.866-872
    • /
    • 2005
  • 본 연구는 비축출형 우선순위 2-계층 대기행렬을 다룬다. 각 계층별 고객들은 마코비안 도착과정(Markovian arrival process, MAP)에 의하여 시스템에 도착하고, 각 계층마다 고유의 임계점을 갖는다. 시스템 내에 고객들이 존재하지 않으면 서어버는 유휴해지고 어느 계층이든지 상관없이 계층에 부여된 임계점에 먼저 도달하면 서어버는 서비스를 시작한다. 우선순위가 높은 고객들을 먼저 서비스하는 비축출형 우선순위 서비스규칙을 따른다. 본 연구에서는 각 계층별 고객들의 대기시간분포에 대한 라플라스(Laplace-Stieltjes) 변환과 평균 대기시간을 유도한다.

  • PDF

Opportunistic Spectrum Access Based on a Constrained Multi-Armed Bandit Formulation

  • Ai, Jing;Abouzeid, Alhussein A.
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.134-147
    • /
    • 2009
  • Tracking and exploiting instantaneous spectrum opportunities are fundamental challenges in opportunistic spectrum access (OSA) in presence of the bursty traffic of primary users and the limited spectrum sensing capability of secondary users. In order to take advantage of the history of spectrum sensing and access decisions, a sequential decision framework is widely used to design optimal policies. However, many existing schemes, based on a partially observed Markov decision process (POMDP) framework, reveal that optimal policies are non-stationary in nature which renders them difficult to calculate and implement. Therefore, this work pursues stationary OSA policies, which are thereby efficient yet low-complexity, while still incorporating many practical factors, such as spectrum sensing errors and a priori unknown statistical spectrum knowledge. First, with an approximation on channel evolution, OSA is formulated in a multi-armed bandit (MAB) framework. As a result, the optimal policy is specified by the wellknown Gittins index rule, where the channel with the largest Gittins index is always selected. Then, closed-form formulas are derived for the Gittins indices with tunable approximation, and the design of a reinforcement learning algorithm is presented for calculating the Gittins indices, depending on whether the Markovian channel parameters are available a priori or not. Finally, the superiority of the scheme is presented via extensive experiments compared to other existing schemes in terms of the quality of policies and optimality.