TIME-DEPENDENT ANALYSIS OF QUEUEING SYSTEMS.

Satish K. Tripathi; Andrzej Duda

doi:10.1080/03155986.1986.11732006

TIME-DEPENDENT ANALYSIS OF QUEUEING SYSTEMS.

Satish K. Tripathi
, Andrzej Duda

OTP Administrative Operations

University at Buffalo

University of Maryland, College Park

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

16 Scopus citations

Abstract

This paper presents a survey of results available for time-dependent analysis of queueing systems. The main focus is on the results that are applicable to evaluating computer/communication systems. First, we present results and computational methods for single-server queues. Next, results on queueing networks are surveyed. Some new material on general queueing networks is added in order to complete the discussion. To show the complexity of time-dependent models two examples, one each for single server and queueing network, are also presented. A brief survey of other possible applications is given.

Original language	English
Pages (from-to)	199-220
Number of pages	22
Journal	INFOR
Volume	24
Issue number	3
DOIs	https://doi.org/10.1080/03155986.1986.11732006
State	Published - 1986

Access to Document

10.1080/03155986.1986.11732006

Cite this

@article{52b63efe54a1416799e5b7cbe97f9266,

title = "TIME-DEPENDENT ANALYSIS OF QUEUEING SYSTEMS.",

abstract = "This paper presents a survey of results available for time-dependent analysis of queueing systems. The main focus is on the results that are applicable to evaluating computer/communication systems. First, we present results and computational methods for single-server queues. Next, results on queueing networks are surveyed. Some new material on general queueing networks is added in order to complete the discussion. To show the complexity of time-dependent models two examples, one each for single server and queueing network, are also presented. A brief survey of other possible applications is given.",

author = "Tripathi, \{Satish K.\} and Andrzej Duda",

year = "1986",

doi = "10.1080/03155986.1986.11732006",

language = "English",

volume = "24",

pages = "199--220",

journal = "INFOR",

issn = "0315-5986",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - TIME-DEPENDENT ANALYSIS OF QUEUEING SYSTEMS.

AU - Tripathi, Satish K.

AU - Duda, Andrzej

PY - 1986

Y1 - 1986

N2 - This paper presents a survey of results available for time-dependent analysis of queueing systems. The main focus is on the results that are applicable to evaluating computer/communication systems. First, we present results and computational methods for single-server queues. Next, results on queueing networks are surveyed. Some new material on general queueing networks is added in order to complete the discussion. To show the complexity of time-dependent models two examples, one each for single server and queueing network, are also presented. A brief survey of other possible applications is given.

AB - This paper presents a survey of results available for time-dependent analysis of queueing systems. The main focus is on the results that are applicable to evaluating computer/communication systems. First, we present results and computational methods for single-server queues. Next, results on queueing networks are surveyed. Some new material on general queueing networks is added in order to complete the discussion. To show the complexity of time-dependent models two examples, one each for single server and queueing network, are also presented. A brief survey of other possible applications is given.

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

U2 - 10.1080/03155986.1986.11732006

DO - 10.1080/03155986.1986.11732006

M3 - Article

SN - 0315-5986

VL - 24

SP - 199

EP - 220

JO - INFOR

JF - INFOR

IS - 3

ER -

TIME-DEPENDENT ANALYSIS OF QUEUEING SYSTEMS.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this