Add to ORKGWe characterise the tail behaviour of the busy period distribution in the GI/G/1 queue under the assumption that the tail of the service time distribution is of intermediate regular variation. This extends a result of De Meyer and Teugels [16] who treated the M/G/1 queue with a regularly varying service time distribution. Our method of proof is, opposed to the one in [16], probabilistic and reveals an insightful relationship between the busy period and the cycle maximum
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
This paper considers the supremum m of the service times of the customers served in a busy period of...
AbstractThis paper considers a stable GI/GI/1 queue with subexponential service time distribution. U...
This paper considers a stable GI/GI/1 queue with subexponential service time distribution. Under nat...
AbstractThis paper considers a stable GI/GI/1 queue with subexponential service time distribution. U...
We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the glo...
We characterise the tail behaviour of the busy period distribution in the GI/G/1 queue under the ass...
We characterise the tail behaviour of the busy period distribution in the GI/G/1 queue under the ass...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
textabstractFor the G/G/1 queue with First-Come First-Served, it is well known that the tail of the ...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
This paper considers the supremum m of the service times of the customers served in a busy period of...
AbstractThis paper considers a stable GI/GI/1 queue with subexponential service time distribution. U...
This paper considers a stable GI/GI/1 queue with subexponential service time distribution. Under nat...
AbstractThis paper considers a stable GI/GI/1 queue with subexponential service time distribution. U...
We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the glo...
We characterise the tail behaviour of the busy period distribution in the GI/G/1 queue under the ass...
We characterise the tail behaviour of the busy period distribution in the GI/G/1 queue under the ass...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
textabstractFor the G/G/1 queue with First-Come First-Served, it is well known that the tail of the ...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
This paper considers the supremum m of the service times of the customers served in a busy period of...