O. J. Boxma and J. W. Cohen recently obtained an explicit expression for the M/G/1 steady-state waiting-time distribution for a class of service-time distributions with power tails. We extend their explicit representation from a one-parameter family of service-time distributions to a two-parameter family. The complementary cumulative distribution function (ccdf’s) of the service times all have the asymptotic form Fc(t) ∼ αt−3/2 as t → ∞, so that the associated waiting-time ccdf’s have asymptotic form Wc(t) ∼ βt−1/2 as t → ∞. Thus the second moment of the service time and the mean of the waiting time are infinite. Our result here also extends our own earlier explicit expression for the M/G/1 steady-state waiting-time distribution when the se...
textabstractFor the $GI/G/1$-queueing model with traffic load $a<1$, service time distribution $B(t)...
The problem considered in this thesis is that of finding the probability distribution of waiting tim...
textabstractFor the G/G/1 queue with First-Come First-Served, it is well known that the tail of the ...
O. J. Boxma and J. W. Cohen recently obtained an explicit expression for the M/G/1 steady-state wait...
In present teletraffic applications of queueing theory service time distributions $B(t)$ with a heav...
In modern teletraffic applications of queueing theory, service time distributions B(t) with a heavy ...
We consider the classical M/G/1 queue with two priority classes and the nonpreemptive and preemptive...
AbstractThis paper considers the supremum m of the service times of the customers served in a busy p...
We consider a $GI/G/1$ queue in which the service time distribution and/or the interarrival time dis...
AbstractPollaczek distributions pervade the class of delay distibutions in G1/G/1 systems with conca...
The classic $GI/G/1$ queueing model of which the tail of the service time and/or the interarrival ti...
single server queue;service in random order;heavy-tailed distribution;waiting time asymptotics;heavy...
AbstractThe M/G/2 queueing model with service time distribution a mixture of m negative exponential ...
We present upper and lower bounds for the tail distribution of the stationary waiting time D in the ...
This paper considers a heterogeneous M/G/2 queue. The service times at server 1 are exponentially di...
textabstractFor the $GI/G/1$-queueing model with traffic load $a<1$, service time distribution $B(t)...
The problem considered in this thesis is that of finding the probability distribution of waiting tim...
textabstractFor the G/G/1 queue with First-Come First-Served, it is well known that the tail of the ...
O. J. Boxma and J. W. Cohen recently obtained an explicit expression for the M/G/1 steady-state wait...
In present teletraffic applications of queueing theory service time distributions $B(t)$ with a heav...
In modern teletraffic applications of queueing theory, service time distributions B(t) with a heavy ...
We consider the classical M/G/1 queue with two priority classes and the nonpreemptive and preemptive...
AbstractThis paper considers the supremum m of the service times of the customers served in a busy p...
We consider a $GI/G/1$ queue in which the service time distribution and/or the interarrival time dis...
AbstractPollaczek distributions pervade the class of delay distibutions in G1/G/1 systems with conca...
The classic $GI/G/1$ queueing model of which the tail of the service time and/or the interarrival ti...
single server queue;service in random order;heavy-tailed distribution;waiting time asymptotics;heavy...
AbstractThe M/G/2 queueing model with service time distribution a mixture of m negative exponential ...
We present upper and lower bounds for the tail distribution of the stationary waiting time D in the ...
This paper considers a heterogeneous M/G/2 queue. The service times at server 1 are exponentially di...
textabstractFor the $GI/G/1$-queueing model with traffic load $a<1$, service time distribution $B(t)...
The problem considered in this thesis is that of finding the probability distribution of waiting tim...
textabstractFor the G/G/1 queue with First-Come First-Served, it is well known that the tail of the ...