The M/M/8Service System with Ranked Servers in Heavy Traffic
6 Angebote vergleichen
| Preise | 2013 | 2014 | 2015 | 2019 |
|---|---|---|---|---|
| Schnitt | € 71,59 | € 73,82 | € 112,48 | € 101,99 |
| Nachfrage |
1
Symbolbild
The MM Service System with Ranked Servers in Heavy Traffic
DE PB NWISBN: 9783540133773 bzw. 3540133771, in Deutsch, Springer, Taschenbuch, neu.
Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
Paperback. 144 pages. Dimensions: 9.6in. x 6.7in. x 0.3in.We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate and that a A is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s , t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN.
Paperback. 144 pages. Dimensions: 9.6in. x 6.7in. x 0.3in.We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate and that a A is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s , t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN.
2
The M/M/8Service System with Ranked Servers in Heavy Traffic (1984)
~EN PB NWISBN: 9783540133773 bzw. 3540133771, vermutlich in Englisch, Springer, Taschenbuch, neu.
Lieferung aus: Deutschland, Lieferbar in 2 - 3 Tage.
The M/M/8Service System with Ranked Servers in Heavy Traffic We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant. 01.09.1984, Taschenbuch.
The M/M/8Service System with Ranked Servers in Heavy Traffic We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant. 01.09.1984, Taschenbuch.
3
Symbolbild
The M/M/ Service System with Ranked Servers in Heavy Traffic (2015)
DE PB NWISBN: 9783540133773 bzw. 3540133771, in Deutsch, SPRINGER VERLAG GMBH 01/05/2015, Taschenbuch, neu.
Von Händler/Antiquariat, Paperbackshop-US [8408184], Secaucus, NJ, U.S.A.
New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. This item is printed on demand.
New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. This item is printed on demand.
4
Symbolbild
The M/M/"service System With Ranked Servers in Heavy Traffic (Lecture Notes in Economics and Mathematical Systems) (1984)
DE PB NWISBN: 9783540133773 bzw. 3540133771, in Deutsch, Springer Berlin Heidelberg, Taschenbuch, neu.
Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, DEV, United Kingdom.
softcover reprint of the original 1st ed. 1984 edition. 144 pages. 9.61x6.69x0.33 inches. In Stock.
softcover reprint of the original 1st ed. 1984 edition. 144 pages. 9.61x6.69x0.33 inches. In Stock.
5
Symbolbild
The M/M/"Service System with Ranked Servers in Heavy Traffic (1984)
DE PB USISBN: 9783540133773 bzw. 3540133771, in Deutsch, Springer, Taschenbuch, gebraucht.
Von Händler/Antiquariat, Herb Tandree Philosophy Books [17426], Stroud, United Kingdom.
9783540133773 Paperback, This listing is a new book, a title currently in-print which we order directly and immediately from the publisher.
9783540133773 Paperback, This listing is a new book, a title currently in-print which we order directly and immediately from the publisher.
Lade…