Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T02:09:56.024Z Has data issue: false hasContentIssue false

Sengupta's invariant relationship and its application to waiting time inference

Published online by Cambridge University Press:  14 July 2016

Hiroshi Toyoizumi*
Affiliation:
NTT Telecommunication Networks Laboratories
*
∗ Postal address: NTT Multimedia Networks Laboratories, 3–9–11, Midori-cho, Musashino-shi, Tokyo 180, Japan. E-mail: toyo@hashi.tn1.ntt.jp

Abstract

This paper presents a new proof of Sengupta's invariant relationship between virtual waiting time and attained sojourn time and its application to estimating the virtual waiting time distribution by counting the number of arrivals and departures of a G/G/1 FIFO queue. Since this relationship does not require any parametric assumptions, our method is non-parametric. This method is expected to have applications, such as call processing in communication switching systems, particularly when the arrival or service process is unknown.

MSC classification

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1997 

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