Performance Modelling of Finite Capacity Queues with Complete Buffer Partitioning Scheme for Bursty Traffic

2007 ◽  
Author(s):  
Shakeel Ahmad ◽  
Irfan Awan ◽  
Bashir Ahmad
Keyword(s):  
Bursty Traffic ◽  
Finite Capacity ◽  
Performance Modelling ◽  
Finite Capacity Queues

Scale functions of Lévy processes and busy periods of finite-capacity M/GI/1 queues

2004 ◽  
Vol 41 (4) ◽  
pp. 1145-1156 ◽  
Author(s):  
Parijat Dube ◽  
Fabrice Guillemin ◽  
Ravi R. Mazumdar
Keyword(s):  
Closed Form ◽  
Lévy Processes ◽  
Busy Period ◽  
Exit Time ◽  
Levy Processes ◽  
Finite Capacity ◽  
Scale Functions ◽  
Period Distribution ◽  
Finite Capacity Queues ◽  
Time Theory

In this paper we use the exit time theory for Lévy processes to derive new closed-form results for the busy period distribution of finite-capacity fluid M/G/1 queues. Based on this result, we then obtain the busy period distribution for finite-capacity queues with on–off inputs when the off times are exponentially distributed.

Scale functions of Lévy processes and busy periods of finite-capacity M/GI/1 queues

2004 ◽  
Vol 41 (04) ◽  
pp. 1145-1156 ◽  
Author(s):  
Parijat Dube ◽  
Fabrice Guillemin ◽  
Ravi R. Mazumdar
Keyword(s):  
Closed Form ◽  
Lévy Processes ◽  
Busy Period ◽  
Exit Time ◽  
Levy Processes ◽  
Finite Capacity ◽  
Scale Functions ◽  
Period Distribution ◽  
Finite Capacity Queues ◽  
Time Theory

In this paper we use the exit time theory for Lévy processes to derive new closed-form results for the busy period distribution of finite-capacity fluid M/G/1 queues. Based on this result, we then obtain the busy period distribution for finite-capacity queues with on–off inputs when the off times are exponentially distributed.

scholarly journals On finite capacity queues with time dependent arrival rates

2013 ◽  
Vol 123 (6) ◽  
pp. 2175-2227 ◽  
Author(s):  
Xiaoqian Tan ◽  
Charles Knessl ◽  
Yongzhi (Peter) Yang
Keyword(s):  
Time Dependent ◽  
Finite Capacity ◽  
Finite Capacity Queues

Analysis of finite-capacity polling systems

1991 ◽  
Vol 23 (2) ◽  
pp. 373-387 ◽  
Author(s):  
Hideaki Takagi
Keyword(s):  
Time Distribution ◽  
Arrival Process ◽  
Polling Systems ◽  
Single Server ◽  
Service Time Distribution ◽  
Finite Capacity ◽  
Poisson Arrival ◽  
Finite Capacity Queues ◽  
General Service ◽  
Limited Service

We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.

Sign in / Sign up

Export Citation Format

Share Document