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

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)795-799
Number of pages5
JournalJournal of Applied Probability
Volume34
Issue number3
Publication statusPublished - 1997 Sep
Externally publishedYes

Fingerprint

Waiting Time
Switching Systems
Waiting Time Distribution
Sojourn Time
Invariant
Communication Systems
Queue
Counting
Unknown
Relationships
Inference
Waiting time
Service process
Communication

Keywords

  • Attained sojourn time
  • Communication switching system
  • G/G/1 Queue
  • Queue inference
  • Sengupta's invariant relationship
  • Virtual waiting time

ASJC Scopus subject areas

  • Mathematics(all)
  • Statistics and Probability

Cite this

Sengupta's invariant relationship and its application to waiting time inference. / Toyoizumi, Hiroshi.

In: Journal of Applied Probability, Vol. 34, No. 3, 09.1997, p. 795-799.

Research output: Contribution to journalArticle

@article{f3b1fb01b80f4e7a9be53a84cc606423,
title = "Sengupta's invariant relationship and its application to waiting time inference",
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.",
keywords = "Attained sojourn time, Communication switching system, G/G/1 Queue, Queue inference, Sengupta's invariant relationship, Virtual waiting time",
author = "Hiroshi Toyoizumi",
year = "1997",
month = "9",
language = "English",
volume = "34",
pages = "795--799",
journal = "Journal of Applied Probability",
issn = "0021-9002",
publisher = "University of Sheffield",
number = "3",

}

TY - JOUR

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

AU - Toyoizumi, Hiroshi

PY - 1997/9

Y1 - 1997/9

N2 - 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.

AB - 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.

KW - Attained sojourn time

KW - Communication switching system

KW - G/G/1 Queue

KW - Queue inference

KW - Sengupta's invariant relationship

KW - Virtual waiting time

UR - http://www.scopus.com/inward/record.url?scp=0031224333&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031224333&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031224333

VL - 34

SP - 795

EP - 799

JO - Journal of Applied Probability

JF - Journal of Applied Probability

SN - 0021-9002

IS - 3

ER -