Overlap Times in Tandem Queues: Identically Distributed Station Case

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Gao, Ruici, Pender, Jamol
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914710299869184
author Gao, Ruici
Pender, Jamol
author_facet Gao, Ruici
Pender, Jamol
contents In this paper, we investigate overlap times in a two-dimensional infinite server tandem queue. Specifically, we analyze the amount of time that a pair of customers spend overlapping in any station of the two dimensional tandem network. We assume that both stations have independent and identically distributed exponential service times with the same rate parameter $μ$. Our main contribution is the derivation of the joint tail distribution, the two marginal tail probabilities, the moments of the overlap times and the tail distribution of the sum of the overlap times in both stations. Our results shed light on how customers overlap downstream in serial queueing systems.
format Preprint
id arxiv_https___arxiv_org_abs_2311_01261
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Overlap Times in Tandem Queues: Identically Distributed Station Case
Gao, Ruici
Pender, Jamol
Probability
In this paper, we investigate overlap times in a two-dimensional infinite server tandem queue. Specifically, we analyze the amount of time that a pair of customers spend overlapping in any station of the two dimensional tandem network. We assume that both stations have independent and identically distributed exponential service times with the same rate parameter $μ$. Our main contribution is the derivation of the joint tail distribution, the two marginal tail probabilities, the moments of the overlap times and the tail distribution of the sum of the overlap times in both stations. Our results shed light on how customers overlap downstream in serial queueing systems.
title Overlap Times in Tandem Queues: Identically Distributed Station Case
topic Probability
url https://arxiv.org/abs/2311.01261