Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-19T03:06:33.586Z Has data issue: false hasContentIssue false

A proof of simple insensitive bounds for a pure overflow system

Published online by Cambridge University Press:  14 July 2016

Nico M. Van Dijk*
Affiliation:
Twente University
*
∗ Present address: Faculty of Economical Sciences and Econometrics, Free University, P.O. Box 7161, 1007 MC Amsterdam, The Netherlands.

Abstract

In [1], [4] and [6] simple and intuitively obvious bounds were suggested for various overflow systems and claimed to be insensitive, that is to be valid also in the non-exponential case. This insensitivity was formalized in [4] and [6] when the service distributions have a monotone failure rate. This technical note provides another proof which for the case of a pure overflow system with one customer class extends the insensitivity to the general case.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1989 

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