Let us wish you a happy birthday!
Date of Birth
Please fill in a complete birthday Enter a valid birthday
×
The Metrical Theory of Jacobi-Perron Algorithm by F. Schweiger - Paperback
229.69 AED

The Metrical Theory of Jacobi-Perron Algorithm by F. Schweiger - Paperback

Be the first to rate this product 

229.69 AED 

  - You Save -229.69 AED
All prices include VAT  Details
FREE Shipping Details
Category Type
Mathematics
ISBN
9783540063889
Author
F. Schweiger
Publisher
Springer
Description:

For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists and the typical queue size is large compared with the number n of servers, all servers are ...

Ships From United States
Ship to Dubai (Change city)
Delivered within Saturday, Aug 4 - Sunday, Aug 5 to Dubai

Condition:
New
Sold by:
InternationalBookStore (87% Positive Rating)

PRODUCT INFORMATION

  •  

    Specifications

    Category Type
    Mathematics
    ISBN
    9783540063889
    Languages
    English
    Item EAN
    2724436331764
    People
    Author
    F. Schweiger
    Category Type
    Mathematics
    ISBN
    9783540063889
    Languages
    English
    Item EAN
    2724436331764
    People
    Author
    F. Schweiger
    People
    Publisher
    Springer
    Technical Information
    Binding
    Paperback
    Languages and countries
    Book Language
    English
    Read more
  •  

    Description:

    For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists

    For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists and the typical queue size is large compared with the number n of servers, all servers are kept busy most of the time and the service behaves like some "effective" single server wit: l mean se.- vice time lin times that of an actual server. The behavior of the queueing system can be described, at least approximately, by use of known results from the much studied single-channel queueing system. For n- 1, however, (we are thinking p- ticularlyof cases in which n 10), the system may be rather congested and quite sensitive to variations in demand even when the average queue is small compared with n. The behavior of such a system will, generally, differ quite significantly from any "equivalent" single-server system. The following study deals with what, in the customary classification of queueing systems, is called the G/G/n system; n servers in parallel with independent s- vice times serving a fairly general type of customer arrival process. rhe arrival rate of customers may be time-dependent; particular attention is given to time - pendence typical of a "rush hour" in which the arrival rate has a single maximum possibly exceeding the capacity of the service.

    Product Features:
    • Category: Mathematics
    • Binding: Paperback
    • Language of Text: English
    • Author(s): G. F. Newell
    • Publisher: Springer
    • ISBN: 9783540063667
    • Number of Pages: 120
    • Dimensions: 10 x 7 x 0.29 inches
 

Customer Reviews

0
No ratings yet
Be the first to rate this product
Rate this product:

Sponsored products for you

×

Please verify your mobile number to complete your checkout

We will send you an SMS containing a verification code. Please double check your mobile number and click on "Send Verification Code".

+ Edit