نتایج جستجو برای: discrete time queue
تعداد نتایج: 2007033 فیلتر نتایج به سال:
In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP/G/1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...
Low run-time overhead, self-adapting storage policies for priority queues called Smart Priority Queue (SPQ) techniques are developed and evaluated. The proposed SPQ policies employ a lowcomplexity linear queue for near-head activities and a rapid-indexing variable bin-width calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost-scor...
We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for obtaining the waiting-time distribution of a multiserver queue is reduced to that of a single server queue. We present a complete solution to the waiting-time distribution of D-MAP/D/k queue together with some computa...
Based on establishing the mathematical model of system provided parameters, using discrete-time Markov chain and a function set by non-negative integer random variable as Probabilistic methods, discrete time variable, two-queue different gated polling has been fully analyzed, low- higher-order properties cycle period are deduced, average queue pair length waiting delay for message packets calcu...
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The server process is a single server deterministic queue. A closed form exact solution is given for the expected queue length and delay. A simple system of equ...
We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...
This paper compares two discrete-time single-server queueing models with queues. In both models, the server is available to a queue probability 1/2 at each service opportunity. Since obtaining easy-to-evaluate expressions for joint moments not feasible, we rely on heavy-traffic limit approach. The correlation coefficient of queue-contents computed via solution two-dimensional functional equatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید