Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T04:23:48.622Z Has data issue: false hasContentIssue false

Busy period in GIX/G/∞

Published online by Cambridge University Press:  14 July 2016

Liming Liu*
Affiliation:
Hong Kong University of Science and Technology
Ding-Hua Shi*
Affiliation:
Shanghai University of Science and Technology
*
∗ Postal address: Department of Industrial Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong.
∗∗ Postal address: Department of Mathematics, Shanghai University of Science and Technology, Shanghai, China.

Abstract

Busy period problems in infinite server queues are studied systematically, starting from the batch service time. General relations are given for the lengths of the busy cycle, busy period and idle period, and for the number of customers served in a busy period. These relations show that the idle period is the most difficult while the busy cycle is the simplest of the four random variables. Renewal arguments are used to derive explicit results for both general and special cases.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable