first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
Some bounds for many-server systems GI/G/s
Author:
Dietrich Stoyan a
| Affiliation: | a Brennstoffinstitut Freiberg, Halsbr cker StraβBe, Freiberg |
DOI:
10.1080/02331887408801152
Publication Frequency:
6 issues per year
Subjects:
Mathematical Statistics;
Statistical Theory & Methods;
Statistics;
Statistics for the Biological Sciences;
Stochastic Models & Processes;
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
In the paper some bounds are proved for the mean waising time in reany server queues, especially in M/G/s queues which are more precise than those of KINGMAL and BRUMELLE. For M/G/s queues bounds are given for the probility that an arriving customor has to loss probility in G/M/s loss systems using a semi-ordering relation.
|
| view references (17) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
