scholarly journals Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping

2016 ◽  
Vol 26 (4) ◽  
pp. 841-854 ◽  
Author(s):  
Oleg Tikhonenko ◽  
Wojciech M. Kempa
Keyword(s):  
Performance Evaluation ◽  
Size Distribution ◽  
Queueing System ◽  
Random Variables ◽  
Loss Probability ◽  
Queue Size ◽  
Packet Dropping ◽  
Numerical Examples ◽  
Explicit Formulae

Abstract A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.

scholarly journals Analysis of AQM queues with queue size based packet dropping

2011 ◽  
Vol 21 (3) ◽  
pp. 567-577 ◽  
Author(s):  
Andrzej Chydziñski ◽  
Łukasz Chróst
Keyword(s):  
Size Distribution ◽  
Analytical Solutions ◽  
Queueing Systems ◽  
Queue Management ◽  
Queue Size ◽  
Loss Ratio ◽  
Packet Dropping ◽  
Numerical Examples ◽  
Internet Routers ◽  
Blocking Probabilities

Analysis of AQM queues with queue size based packet dropping Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities (dropping functions).

scholarly journals Finite M/M/1 retrial model with changeable service rate

2021 ◽  
Vol 56 (1) ◽  
pp. 96-102
Author(s):  
M.S. Bratiichuk ◽  
A.A. Chechelnitsky ◽  
I.Ya. Usar
Keyword(s):  
Queueing System ◽  
Service Rate ◽  
Numerical Examples ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Explicit Formulae ◽  
Number Of Customers ◽  
Theoretical Results

The article deals with M/M/1 -type retrial queueing system with finite orbit. It is supposedthat service rate depends on the loading of the system. The explicit formulae for ergodicdistribution of the number of customers in the system are obtained. The theoretical results areillustrated by numerical examples.

scholarly journals On anM1,M2/Gr/1queueing system

2000 ◽  
Vol 6 (5) ◽  
pp. 495-503 ◽  
Author(s):  
Lotfi Tadj
Keyword(s):  
Steady State ◽  
Size Distribution ◽  
Queueing System ◽  
Queue Size

The author studies a service delayed queueing system with priority discipline. The joint queue size distribution is derived in the steady state.

Asymptotic analysis of the general stochastic epidemic with variable infectious periods

2001 ◽  
Vol 38 (01) ◽  
pp. 18-35 ◽  
Author(s):  
A. N. Startsev
Keyword(s):  
Asymptotic Analysis ◽  
Asymptotic Behaviour ◽  
Size Distribution ◽  
Random Variables ◽  
Independent Random Variables ◽  
Boundary Crossing ◽  
Total Size ◽  
Stochastic Epidemic ◽  
General Stochastic

A generalisation of the classical general stochastic epidemic within a closed, homogeneously mixing population is considered, in which the infectious periods of infectives follow i.i.d. random variables having an arbitrary but specified distribution. The asymptotic behaviour of the total size distribution for the epidemic as the initial numbers of susceptibles and infectives tend to infinity is investigated by generalising the construction of Sellke and reducing the problem to a boundary crossing problem for sums of independent random variables.

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

The Mechanical Performance Evaluation of a Mechanism with Curved Edge Driving Component

2013 ◽  
Vol 834-836 ◽  
pp. 1290-1294
Author(s):  
Xin Qin Liu
Keyword(s):  
Performance Evaluation ◽  
Fast Moving ◽  
Mechanical Performance ◽  
Gain Coefficient ◽  
The Other ◽  
Force Transmission ◽  
Transmission Performance ◽  
Connecting Rod ◽  
Numerical Examples ◽  
Straight Line

Mechanicalmethods were employed to study the motion and force transmission performance ofa kind of connecting rod slider mechanism with a curved edge driving component.The deduction methods and the computation formulae of the slider displacement,velocity, acceleration and the executive force gain coefficient were given.Considering two cases of the driving components with straight line edge andexponential function edge, the numerical examples was computed respectively,the results show that the former one is suitable for the force transmission andcan be used in the grip design and the other one is suitable for the motiontransmission which can be used in the fast moving mechanism

Sign in / Sign up

Export Citation Format

Share Document