نتایج جستجو برای: finite buffer

تعداد نتایج: 300002  

2007
Ella Pereira Rubem Pereira Nigel Thomas Jeremy Bradley Stephen Jarvis Irfan Awan David Walsh

This paper analyses a multiple class single server M/M/1/K queue with finite capacity under preemptive service priority discipline. The Poisson process has been used to model the multiple classes of arrival streams. The service times have exponential distribution. Analytical expressions for the flow balanced equations have been derived using Markov chain. This paper presents an analytical solut...

2001
Nikolaos Laoutaris Ioannis Stavrakakis

Due to random delay variations in current best effort networks, packet video applications rely on end-system buffering and playout adaptation to reduce the effects of disruptions on the required smooth stream presentation. To study the effect of buffering and playout adaptation, we present an analytical model based on the M/G/1 queueing system with finite buffer capacity and traffic intensity e...

1994
Ratnesh Kumar Vijay K. Garg Steven I. Marcus

Many discrete event systems (DESs) such as manufacturing systems, database management systems, communication networks, traffic systems, etc., can be modeled as input-output discrete event systems (I/O DESs). In this paper we formulate and study the problem of stable realization of such systems in the logical setting. Given an input and an output language describing the sequences of events that ...

Journal: :Queueing Syst. 2001
Bruno Sericola

We consider a finite buffer fluid queue receiving its input from the output of a Markovian queue with finite or infinite waiting room. The input flow into the fluid queue is thus characterized by a Markov modulated input rate process and we derive, for a wide class of such input processes, a procedure for the computation of the stationary buffer content of the fluid queue and the stationary ove...

2011
Shan Gao

This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival,...

2012
HUSNU SANER NARMAN

Most of the real life multi server queuing systems have heterogeneous servers which means each service rates are different than each other. Analysis of such queuing system plays important role to improve performance. In this report, I have summarized analysis of heterogeneous multi server queuing system which has a finite and an infinite buffer. Average waiting time and average queue length are...

2007
Georgy Kazakov Boris Matisov Andrey Litvinov Igor Mazets

We have investigated theoretically the formation of a coherent population trapping resonance in a finite-size vapour cell without a buffer gas. We have demonstrated the novel mechanisms of the resonance narrowing: an analogue of the Dicke effect and light-induced narrowing. In the light-induced narrowing regime the parameters of the coherent population trapping resonance weakly depend on the ce...

2005
Fátima Ferreira

The finding that Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to compute steady-state performance measures of Pareto/M/·/· queues. In this work we give an overview of some of these methods and compare them with an approach we have recently proposed, which combines embedding, uniformization and stochastic ordering techniques ...

2003
Marcel F. Neuts Jun Guo Moshe Zukerman Hai Le Vu

This paper provides an efficient solution for the derivation of the delay distribution for a TDMA system with a finite buffer. Assuming successive intervals of length equal to the duration of a slot, the density is expressed as (finite) linear combinations of gamma densities and beta densities with positive coefficients. The results are verified by simulations. Comparison with a previously prop...

2006
Rafal Dlugosz Krzysztof Iniewski Tomasz Talaska

The paper presents the programmable multiphase clock generator for switched-capacitor finite impulse response (SC FIR) circular memory filters. The proposed programmable clock circuit enables easy division of such kind of filters into different orders smaller sections, which when connected in series, lead to increase in filter efficiency: reduction of chip area, power dissipation, and rising up...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید