Skip to main content
Conference Proceedings

Queueing systems with common buffer: A theoretical treatment

Communications in Computer and Information Science (2011) 160 CCIS 61-69
DOI: 10.1007/978-3-642-21771-5_8
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate queueing systems of different types with demands having some random space requirements connected via common limited buffer space. For such systems combination we determine steady-state loss probability and distribution of number of demands present in each system from the combination. © 2011 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Tikhonenko, O. (2011). Queueing systems with common buffer: A theoretical treatment. In Communications in Computer and Information Science (Vol. 160 CCIS, pp. 61–69). https://doi.org/10.1007/978-3-642-21771-5_8

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