Skip to main content
Conference Proceedings

Performance of multi-service system with retrials due to blocking and called-party-busy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5174 LNCS 147-155
DOI: 10.1007/978-3-540-85500-2_13
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we construct a model of a multi-service system with an arbitrary number of bandwidth flow demands, taking into account retrials due to both blocking along the route and to called-party-busy. An approximate algorithm for estimation of key performance measures is proposed, and the problem of dimensioning the system is considered. © 2008 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Stepanov, S. N., Kokina, O. A., & Iversen, V. B. (2008). Performance of multi-service system with retrials due to blocking and called-party-busy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5174 LNCS, pp. 147–155). https://doi.org/10.1007/978-3-540-85500-2_13

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