Approximate Analysis of a Discrete-Time Queueing Model of the Shared Buffer ATM Switch

1993 ◽  
pp. 211-229
Author(s):  
S. Hong ◽  
H. G. Perros ◽  
H. Yamashita
Keyword(s):  
Discrete Time ◽  
Queueing Model ◽  
Approximate Analysis ◽  
Atm Switch ◽  
Shared Buffer

scholarly journals A discrete-time queueing model of the shared buffer ATM switch with bursty arrivals

1993 ◽  
Vol 2 (1) ◽  
pp. 1-20 ◽  
Author(s):  
S. Hong ◽  
H. G. Perros ◽  
H. Yamashita
Keyword(s):  
Discrete Time ◽  
Queueing Model ◽  
Atm Switch ◽  
Shared Buffer

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