A Random Tandem Network with Queues Modeled as Birth-Death Processes

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a tandem network consisting of an arbitrary but finite number Rm of queueing systems, where Rm is a discrete random variable with a suitable probability distribution. Each queueing system of the tandem network is modeled via a birth-death process and consists of an infinite buffer space and of a service center with a single server.

Cite

CITATION STYLE

APA

Giorno, V., & Nobile, A. G. (2018). A Random Tandem Network with Queues Modeled as Birth-Death Processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10672 LNCS, pp. 29–37). Springer Verlag. https://doi.org/10.1007/978-3-319-74727-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free