Equilibrium results for the M/G/k group-arrival loss system

Top ◽  
2010 ◽  
Vol 21 (1) ◽  
pp. 163-181
Author(s):  
Spiros Dimou ◽  
Demetrios Fakinos
Keyword(s):  
1989 ◽  
Vol 21 (3) ◽  
pp. 721-724 ◽  
Author(s):  
D. Fakinos ◽  
K. Sirakoulis

In this work we investigate under what circumstances the equilibrium distribution of the numbers of groups of various sizes in a certain M/G/k group-arrival group-departure loss system can be obtained in a closed product form.


1982 ◽  
Vol 19 (4) ◽  
pp. 826-834 ◽  
Author(s):  
D. Fakinos

This paper considers the equilibrium behaviour of the M/G/k group-arrival group-departure loss system. Such a system has k servers whose customers arrive in groups, the arrival epochs of groups being points of a Poisson process. The duration of a service can be characteristic of the group size; however, customers who belong to the same group have equal service times. The customers of a group start being served immediately upon their arrival, unless their number is greater than the number of idle servers. In this case the whole group leaves and does not return later (i.e. is lost). Among other things, a generalization of the Erlang B-formula is given and it is shown that the arrival and departure processes are statistically indistinguishable.


1989 ◽  
Vol 21 (03) ◽  
pp. 721-724
Author(s):  
D. Fakinos ◽  
K. Sirakoulis

In this work we investigate under what circumstances the equilibrium distribution of the numbers of groups of various sizes in a certain M/G/k group-arrival group-departure loss system can be obtained in a closed product form.


1982 ◽  
Vol 19 (04) ◽  
pp. 826-834 ◽  
Author(s):  
D. Fakinos

This paper considers the equilibrium behaviour of the M/G/k group-arrival group-departure loss system. Such a system has k servers whose customers arrive in groups, the arrival epochs of groups being points of a Poisson process. The duration of a service can be characteristic of the group size; however, customers who belong to the same group have equal service times. The customers of a group start being served immediately upon their arrival, unless their number is greater than the number of idle servers. In this case the whole group leaves and does not return later (i.e. is lost). Among other things, a generalization of the Erlang B-formula is given and it is shown that the arrival and departure processes are statistically indistinguishable.


1986 ◽  
Vol 23 (1) ◽  
pp. 261-264 ◽  
Author(s):  
Saeed Ghahramani
Keyword(s):  

Conditions for finiteness of moments of the following quantities have been found: the duration of a busy period of an Μ /G/∞ system; the duration of a partial busy period of an M/G/C loss system, and the duration of a partial busy period of an M/G/C queue.


2002 ◽  
Vol 64 (7) ◽  
pp. 817-830 ◽  
Author(s):  
Richard L Dowden ◽  
James B Brundell ◽  
Craig J Rodger
Keyword(s):  

1976 ◽  
Vol 7 (1) ◽  
pp. 129-137 ◽  
Author(s):  
Klaus Fleischmann
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document