نتایج جستجو برای: discrete markovian service process
تعداد نتایج: 1732282 فیلتر نتایج به سال:
| In this paper we provide the analysis of a rate-based access control scheme in high speed environments based on a buuered leaky bucket algorithm. The analysis is carried out in discrete time which is representative of an ATM environment. For the cell arrivals to the leaky bucket we consider a general discrete Markovian arrival process which models bursty and modulated sources. The key of our ...
UNDER INCOMPLETE OBSERVATION PART n Hajime Kawai University of Osaka Prefecture (Received July 6, 1982; Revised June 29, 1983) We consider an optimal ordering and replacement policy of a discrete time Markovian deterioration system when the observation of the system is incomplete. The problem is to examine the structure of an optimal policy which minimizes the total expected discounted cost in ...
We establish heavy traffic limit theorems for queue-length processes in critically loaded single class queueing networks with state dependent arrival and service rates. A distinguishing feature of our model is non-Markovian state dependence. The limit stochastic process is a continuous-path reflected process on the nonnegative orthant. We give an application to generalised Jackson networks with...
Queueing models with disasters can be used to evaluate the impact of a breakdown or system reset in service facility. In this paper, we consider discrete-time single-server queueing general independent arrivals and times study effect occurrence on behavior. Disasters occur independently from time slot according Bernoulli process result simultaneous removal all customers system. General probabil...
The aim of this paper is to propose a model-based feedback control strategy for indoor temperature regulation in buildings equipped with underfloor air distribution (UFAD). Supposing distributed sensing and actuation capabilities, a 0−D model of the ventilation process is first derived, based on the thermodynamics properties of the flow. A state-space description of the process is then inferred...
:هلاقم هصلاخ This paper introduces an analytical method for approximating the performance of a -soft real-time system consisting of a number of parallel infinite-capacity single -server queues. The service discipline for the individual queues is earliest-deadline first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all ...
We introduce a new model for rill erosion. We start with a network similar to that in the Discrete Web** and instantiate a dynamics which makes the process highly non-Markovian. The behavior of nodes in the streams is similar to the behavior of Polya urns with time-dependent input. In this paper we use a combination of rigorous arguments and simulation results.
A discrete rate theory for general multi-ion channels is presented, in which the continuous dynamics of ion diffusion is reduced to transitions between Markovian discrete states. In an open channel, the ion permeation process involves three types of events: an ion entering the channel, an ion escaping from the channel, or an ion hopping between different energy minima in the channel. The contin...
In this paper we consider M/G/1 queueing system. We assume that there is a single server and the customers arrive according to Poisson process with mean and service time distribution is general. Let the state of the system be defined by a pair of variables the number X(t) in the system at epoch t and the elapsed serviced time Y(t) of the customer who is under going service. Then we have studied...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید