Verwandte Artikel zu The M/M/? Service System with Ranked Servers in Heavy...
The M/M/? Service System with Ranked Servers in Heavy Traffic: 231 (Lecture Notes in Economics and Mathematical Systems) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 52,26
EUR 3,42 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für The M/M/? Service System with Ranked Servers in Heavy...
Foto des Verkäufers
The M/ M/ (infinite) service system with ranked servers in heavy traffic. Lecture Notes in Economics and Mathematical Systems Vol. 231;
Verlag:
Berlin ; Heidelberg ; New York ; Tokyo : Springer, 1984
ISBN 10: 3540133771
ISBN 13: 9783540133773
Gebraucht
Broschiert
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Broschiert. Zustand: 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. Bestandsnummer des Verkäufers 1291726
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
The M/M/8service System With Ranked Servers in Heavy Traffic
Verlag:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1984
ISBN 10: 3540133771
ISBN 13: 9783540133773
Gebraucht
Softcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Softcover. Zustand: 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. Bestandsnummer des Verkäufers E-595-785
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Lecture Notes in Economics and Mathematical Systems, Volume 231: The M/M/[Infinity Symbol] Service System With Ranked Servers in Heavy Traffic
Anbieter: BookDepart, Shepherdstown, WV, USA
Verkäuferbewertung 5 von 5 Sternen
Softcover. Zustand: Good. Softcover, volume 231; light fading, light shelf wear to exterior; date written on title page; good condition with clean text, firm binding. Bestandsnummer des Verkäufers 49957
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
The M/M/?Service System with Ranked Servers in Heavy Traffic (Lecture Notes in Economics and Mathematical Systems, 231)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020160189
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
The M/M/Service System with Ranked Servers in Heavy Traffic (Paperback)
ISBN 10: 3540133771
ISBN 13: 9783540133773
Neu
Paperback
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: new. Paperback. 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. We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9783540133773
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
The M/M/?Service System with Ranked Servers in Heavy Traffic (Lecture Notes in Economics and Mathematical Systems, 231)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540133773_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
The M/M/8Service System with Ranked Servers in Heavy Traffic
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540133773
Anzahl: 10 verfügbar
Beispielbild für diese ISBN
The M/M/?Service System with Ranked Servers in Heavy Traffic
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 144. Bestandsnummer des Verkäufers 2658589189
Anzahl: 4 verfügbar
Foto des Verkäufers
The M/M/infinite Service System with Ranked Servers in Heavy Traffic (Lecture Notes in Economics and Mathematical Systems, 231, Band 231)
Anbieter: Leserstrahl (Preise inkl. MwSt.), Oldenbüttel, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Very Good. 1984. Ehemaliges Büchereiexemplar mit Stempel, Aufkleber, Seiten gebräunt, ---. nein. Bestandsnummer des Verkäufers 112452
Anzahl: 1 verfügbar
Foto des Verkäufers
The M/M/¿Service System with Ranked Servers in Heavy Traffic
ISBN 10: 3540133771
ISBN 13: 9783540133773
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540133773
Anzahl: 2 verfügbar