Search

For multiple-server finite-buffer systems with batch Poisson arrivals, we explore how the distribution of the number of losses during a busy period changes with the buffer size and the initial number of customers. We show that when the arrival rate equals the maximal service rate (ρ = 1), as the buffer size increases the number of losses in a busy period increases in the convex sense, and when ρ > 1, as the buffer size increases the number of busy period losses increases in the increasing convex sense. Also, the number of busy period losses is stochastically increasing in the initial number of customers. A consequence of our results is that, when ρ = 1, the mean number of busy period losses equals the mean batch size of arrivals regardless of the buffer size. We show that this invariance does not extend to general arrival processes.

Search Results

Refine search

Refine search

Actions for selected content:

1 results

Characterizing losses during busy periods in finite buffer systems

Search Results

Refine search

Refine search

Actions for selected content:

Save Search

1 results

Characterizing losses during busy periods in finite buffer systems