A discrete-time queueing model of an atm 'leaky bucket' policing mechanism.

1994 ◽  
Author(s):  
F.A. Zanasi ◽  
D.D. Kouvatsos
Keyword(s):  
Discrete Time ◽  
Queueing Model ◽  
Leaky Bucket

Transient analysis of M/M/1 queues in discrete time by general server vacations

1994 ◽  
Vol 31 (A) ◽  
pp. 115-129 ◽  
Author(s):  
W. Böhm ◽  
S. G. Mohanty
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Transient Analysis ◽  
Queueing System ◽  
Queueing Model ◽  
Discrete Parameter ◽  
Server Vacations ◽  
Special Case ◽  
Combinatorial Methods ◽  
Transient And Steady State

In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.

scholarly journals Analysis of the State-Dependent Queueing Model and Its Application to Battery Swapping and Charging Stations

2020 ◽  
Vol 12 (6) ◽  
pp. 2343
Author(s):  
Doo Il Choi ◽  
Dae-Eun Lim
Keyword(s):  
Congestion Control ◽  
Queue Length ◽  
Blocking Probability ◽  
Control Policy ◽  
Embedded Markov Chain ◽  
Queueing Model ◽  
Leaky Bucket ◽  
Numerical Examples ◽  
Charging Station ◽  
Mean Waiting Time

This study analyzes the performance of a queue length-dependent overload control policy using a leaky bucket (LB) scheme. This queueing model is applied to the operation of a battery swapping and charging station for electric vehicles (EVs). In addition to the LB scheme, we propose two congestion control policies based on EV queue length thresholds. With these policies, the model determines both EV-arrival and battery-supply intervals, and these depend on the number of EVs waiting in the queue. The queue length distributions, including those at arbitrary epochs, are derived using embedded Markov chain and supplementary variable methods. Performance measures such as blocking probability and mean waiting time are investigated using numerical examples. We study the characteristics of the system using numerical examples and use a cost analysis to investigate situations in which the application of each congestion control policy is advantageous.

Analysis of a discrete-time GI–G–1 queueing model subjected to bursty interruptions

2003 ◽  
Vol 30 (1) ◽  
pp. 139-153 ◽  
Author(s):  
Dieter Fiems ◽  
Bart Steyaert ◽  
Herwig Bruneel
Keyword(s):  
Discrete Time ◽  
Queueing Model

The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution

1978 ◽  
Vol 15 (3) ◽  
pp. 590-601 ◽  
Author(s):  
Do Le Minh
Keyword(s):  
Discrete Time ◽  
Service Time ◽  
Time Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Queueing Model ◽  
Compound Poisson ◽  
Poisson Input ◽  
Server Queue ◽  
General Service

This paper studies a discrete-time, single-server queueing model having a compound Poisson input with time-dependent parameters and a general service time distribution.All major transient characteristics of the system can be calculated very easily. For the queueing model with periodic arrival function, some explicit results are obtained.

scholarly journals Discrete- Time Queueing Model Geox/G/ꚙ with Bulk Arrival Rule

2020 ◽  
Vol 9 (3) ◽  
pp. 2585-2589
Keyword(s):  
Discrete Time ◽  
Geometric Distribution ◽  
Transient State ◽  
State Solution ◽  
General Distribution ◽  
Queueing Model ◽  
Service Times ◽  
Bulk Arrival ◽  
Number Of Customers

A discrete time queueing model is considered to estimate of the number of customers in the system. The arrivals, which are in groups of size X, inter-arrivals times and service times are distributed independent. The inter-arrivals fallows geometric distribution with parameter p and service times follows general distribution with parameter µ, we have derive the various transient state solution along with their moments and numerical illustrations in this paper.

Transient analysis of M/M/1 queues in discrete time by general server vacations

1994 ◽  
Vol 31 (A) ◽  
pp. 115-129 ◽  
Author(s):  
W. Böhm ◽  
S. G. Mohanty
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Transient Analysis ◽  
Queueing System ◽  
Queueing Model ◽  
Discrete Parameter ◽  
Server Vacations ◽  
Special Case ◽  
Combinatorial Methods ◽  
Transient And Steady State

In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.

Sign in / Sign up

Export Citation Format

Share Document