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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
1. Introduction.- 2. Limit properties for a » 1.- 3. Descriptive properties of the evolution.- 4. The overflow distribution.- 5. Joint distributions.- 6. A diffusion equation.- 7. Transient properties.- 8. Equilibrium properties of the diffusion equation.- 9. Equivalent random method.- Index of Notation.
Book by Newell GF
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Ammareal, Morangis, Francia
Softcover. Condizione: Très bon. Ancien livre de bibliothèque. Edition 1984. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1984. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-595-785
Quantità: 1 disponibili
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
Broschiert. Condizione: Gut. X, 126 S. : graph. Darst. Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.). Schnitt und Einband sind etwas staubschmutzig; Einbandkanten sind leicht bestossen; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Sprache: Englisch Gewicht in Gramm: 250. Codice articolo 1291726
Quantità: 1 disponibili
Da: BookDepart, Shepherdstown, WV, U.S.A.
Softcover. Condizione: Good. Softcover, volume 231; light fading, light shelf wear to exterior; date written on title page; good condition with clean text, firm binding. Codice articolo 49957
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783540133773_new
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
PF. Condizione: New. Codice articolo 6666-IUK-9783540133773
Quantità: 10 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 144 pp. Englisch. Codice articolo 9783540133773
Quantità: 2 disponibili
Da: Leserstrahl (Preise inkl. MwSt.), Oldenbüttel, Germania
Taschenbuch. Condizione: Very Good. 1984. Ehemaliges Büchereiexemplar mit Stempel, Aufkleber, Seiten gebräunt, ---. nein. Codice articolo 112452
Quantità: 1 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 144. Codice articolo 2658589189
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 144 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Codice articolo 50970586
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 144. Codice articolo 1858589199
Quantità: 4 disponibili