The M/M/∞Service System with Ranked Servers in Heavy Traffic

The M/M/∞Service System with Ranked Servers in Heavy Traffic

Author: G.F. Newell

Publisher: Springer Science & Business Media

ISBN: 9783642455766

Category: Business & Economics

Page: 129

View: 314

Download Now
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.
The M/M/∞Service System with Ranked Servers in Heavy Traffic
Language: en
Pages: 129
Authors: G.F. Newell
Categories: Business & Economics
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

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
The M/M/∞Service System with Ranked Servers in Heavy Traffic
Language: en
Pages: 129
Authors: G.F. Newell
Categories: Business & Economics
Type: BOOK - Published: 1984 - Publisher: Springer

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
Transportation and Traffic Theory
Language: en
Pages: 596
Authors: Carlos Daganzo
Categories: Technology & Engineering
Type: BOOK - Published: 1993 - Publisher: Elsevier Science Limited

Traces the history of such forms of entertainment as drama, dance, opera, and film.
Annual Report
Language: en
Pages:
Authors: University of California, Berkeley. Institute of Transportation Studies
Categories: Transportation
Type: BOOK - Published: 1983 - Publisher:

Books about Annual Report
ITS Annual Report
Language: en
Pages:
Authors: University of California (System). Institute of Transportation Studies
Categories: Transportation
Type: BOOK - Published: 1984 - Publisher:

Books about ITS Annual Report