On an exponential server with general cyclic arrivals

Ashok K. Agrawala; Satish K. Tripathi

doi:10.1007/BF00263197

On an exponential server with general cyclic arrivals

Ashok K. Agrawala
, Satish K. Tripathi

OTP Administrative Operations

University of Maryland, College Park

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

A Eⁿ| M | 1 queue is defined as a single server queue with exponential service time and general cyclic arrival distributions of cycle length n. The waiting time distribution for such a queue is proved to be a sum of n exponential terms; this is a generalization of G | M | 1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for Eⁿ| M | 1 queues is introduced. An example is presented to show an application of Eⁿ| M | 1 queues in deterministic routing.

Original language	English
Pages (from-to)	319-334
Number of pages	16
Journal	Acta Informatica
Volume	18
Issue number	3
DOIs	https://doi.org/10.1007/BF00263197
State	Published - Dec 1982

Access to Document

10.1007/BF00263197

Cite this

@article{b7fdb1a0d02b4921b25981fa66a44f9f,

title = "On an exponential server with general cyclic arrivals",

abstract = "A En| M | 1 queue is defined as a single server queue with exponential service time and general cyclic arrival distributions of cycle length n. The waiting time distribution for such a queue is proved to be a sum of n exponential terms; this is a generalization of G | M | 1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for En| M | 1 queues is introduced. An example is presented to show an application of En| M | 1 queues in deterministic routing.",

author = "Agrawala, \{Ashok K.\} and Tripathi, \{Satish K.\}",

year = "1982",

month = dec,

doi = "10.1007/BF00263197",

language = "English",

volume = "18",

pages = "319--334",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - On an exponential server with general cyclic arrivals

AU - Agrawala, Ashok K.

AU - Tripathi, Satish K.

PY - 1982/12

Y1 - 1982/12

N2 - A En| M | 1 queue is defined as a single server queue with exponential service time and general cyclic arrival distributions of cycle length n. The waiting time distribution for such a queue is proved to be a sum of n exponential terms; this is a generalization of G | M | 1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for En| M | 1 queues is introduced. An example is presented to show an application of En| M | 1 queues in deterministic routing.

AB - A En| M | 1 queue is defined as a single server queue with exponential service time and general cyclic arrival distributions of cycle length n. The waiting time distribution for such a queue is proved to be a sum of n exponential terms; this is a generalization of G | M | 1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for En| M | 1 queues is introduced. An example is presented to show an application of En| M | 1 queues in deterministic routing.

UR - https://www.scopus.com/pages/publications/0020252562

U2 - 10.1007/BF00263197

DO - 10.1007/BF00263197

M3 - Article

AN - SCOPUS:0020252562

SN - 0001-5903

VL - 18

SP - 319

EP - 334

JO - Acta Informatica

JF - Acta Informatica

IS - 3

ER -

On an exponential server with general cyclic arrivals

Abstract

Access to Document

Other files and links

Fingerprint

Cite this