regenerative processes queueing theory (20 resultados)

Condición: Very Good. *Price HAS BEEN temporarily REDUCED by 10% until Monday, Oct. 6 (sale item)* 102 pp., Paperback, very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Paperback. First Edition. Near Fine, small bumps on corners; Library of Congress surplus stamp, 93 pp.

Condición: New.

Paperback. Condición: new. Paperback. I. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 3 The sequence n 1,2, . . . 4 = !::!n' 1. 4 The process t dO,co)} 11 {~t' The process t dO,co)} 1. 5 15 {~t' Applications to the GIIG/1 queue 1. 6 16 The average virtual waiting time during a busy 17 cycle ii. Little's formula 17 iii. The relation between the stationary distributions 18 of the virtual and actual waiting time iv. The relation between the distribution of the idle 20 period and the stationary distribution of the actual waiting time v. The limiting distribution of the residual service 24 time . , -pw vi. The relation for ~ rn E{e -n} 25 n=O 1. 7 Some notes on chapter I 27 II. The M/G/K system 31 2. 1 On the stationary distribution of the actual and virtua131 waiting time for the M/G/K queueing system 2. 2 The M/G/K loss system 36 2. 3 Proof of Erlang's formula for the M/G/K loss system 43 i. Proof for the system MIMI'" 45 ii. Proof for the system M/G/co 47 VI iii. Proof fol' the MIG IK los s system III. The M/G/1 system 3. 1 Introduction 71 (K) 3. 2 Downcrossings of the ~t -process 74 3. 3 The distribution of the supremum of the virtual waiting 75 (00) d' b 1 tlme ~t urlng a usy cyc e i. The exit probability 76 ii. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 1 On the stationary distribution of the actual and virtua131 waiting time for the M/G/K queueing system 2. 3 The distribution of the supremum of the virtual waiting 75 (00) d' b 1 tlme ~t urlng a usy cyc e i. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condición: New.

Condición: New. SUPER FAST SHIPPING.

Condición: As New. Unread book in perfect condition.

Condición: New. In.

Paperback. Condición: New.

Condición: New. pp. 108.

Condición: New. Series: Lecture Notes in Economics and Mathematical Systems. Num Pages: 102 pages, biography. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 5. Weight in Grams: 186. . 1976. Softcover reprint of the original 1st ed. 1976. paperback. . . . .

Condición: New. Series: Lecture Notes in Economics and Mathematical Systems. Num Pages: 102 pages, biography. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 5. Weight in Grams: 186. . 1976. Softcover reprint of the original 1st ed. 1976. paperback. . . . . Books ship from the US and Ireland.

Paperback. Condición: Brand New. 102 pages. 9.61x6.69x0.25 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - I. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 3 The sequence n 1,2, . . . 4 = !::!n' 1. 4 The process t dO,co)} 11 {~t' The process t dO,co)} 1. 5 15 {~t' Applications to the GIIG/1 queue 1. 6 16 The average virtual waiting time during a busy 17 cycle ii. Little's formula 17 iii. The relation between the stationary distributions 18 of the virtual and actual waiting time iv. The relation between the distribution of the idle 20 period and the stationary distribution of the actual waiting time v. The limiting distribution of the residual service 24 time Pds. . , -pw vi. The relation for ~ rn E{e -n} 25 n=O 1. 7 Some notes on chapter I 27 II. The M/G/K system 31 2. 1 On the stationary distribution of the actual and virtua131 waiting time for the M/G/K queueing system 2. 2 The M/G/K loss system 36 2. 3 Proof of Erlang's formula for the M/G/K loss system 43 i. Proof for the system MIMI'' 45 ii. Proof for the system M/G/co 47 VI iii. Proof fol' the MIG IK los s system III. The M/G/1 system 3. 1 Introduction 71 (K) 3. 2 Downcrossings of the ~t -process 74 3. 3 The distribution of the supremum of the virtual waiting 75 - (00) d' b 1 tlme ~t urlng a usy cyc e i. The exit probability 76 ii.

Paperback. Condición: new. Paperback. I. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 3 The sequence n 1,2, . . . 4 = !::!n' 1. 4 The process t dO,co)} 11 {~t' The process t dO,co)} 1. 5 15 {~t' Applications to the GIIG/1 queue 1. 6 16 The average virtual waiting time during a busy 17 cycle ii. Little's formula 17 iii. The relation between the stationary distributions 18 of the virtual and actual waiting time iv. The relation between the distribution of the idle 20 period and the stationary distribution of the actual waiting time v. The limiting distribution of the residual service 24 time . , -pw vi. The relation for ~ rn E{e -n} 25 n=O 1. 7 Some notes on chapter I 27 II. The M/G/K system 31 2. 1 On the stationary distribution of the actual and virtua131 waiting time for the M/G/K queueing system 2. 2 The M/G/K loss system 36 2. 3 Proof of Erlang's formula for the M/G/K loss system 43 i. Proof for the system MIMI'" 45 ii. Proof for the system M/G/co 47 VI iii. Proof fol' the MIG IK los s system III. The M/G/1 system 3. 1 Introduction 71 (K) 3. 2 Downcrossings of the ~t -process 74 3. 3 The distribution of the supremum of the virtual waiting 75 (00) d' b 1 tlme ~t urlng a usy cyc e i. The exit probability 76 ii. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 1 On the stationary distribution of the actual and virtua131 waiting time for the M/G/K queueing system 2. 3 The distribution of the supremum of the virtual waiting 75 (00) d' b 1 tlme ~t urlng a usy cyc e i. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Condición: New. Print on Demand pp. 108 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 108.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. I. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 3 The sequence n 1,2, . . . 4 = !::!n 1. 4 The process t dO,co)} 11 {~t The process t dO,co)} 1. 5 15 {~t Applications to the GIIG/1 queue 1. 6 16 The average virtual.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -I. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 3 The sequence n 1,2, . . . 4 = !::!n' 1. 4 The process t dO,co)} 11 {~t' The process t dO,co)} 1. 5 15 {~t' Applications to the GIIG/1 queue 1. 6 16 The average virtual waiting time during a busy 17 cycle ii. Little's formula 17 iii. The relation between the stationary distributions 18 of the virtual and actual waiting time iv. The relation between the distribution of the idle 20 period and the stationary distribution of the actual waiting time v. The limiting distribution of the residual service 24 time £. , -pw vi. The relation for ~ rn E{e -n} 25 n=O 1. 7 Some notes on chapter I 27 II. The M/G/K system 31 2. 1 On the stationary distribution of the actual and virtua131 waiting time for the M/G/K queueing system 2. 2 The M/G/K loss system 36 2. 3 Proof of Erlang's formula for the M/G/K loss system 43 i. Proof for the system MIMI'' 45 ii. Proof for the system M/G/co 47 VI iii. Proof fol' the MIG IK los s system III. The M/G/1 system 3. 1 Introduction 71 (K) 3. 2 Downcrossings of the ~t -process 74 3. 3 The distribution of the supremum of the virtual waiting 75 ¿ (00) d' b 1 tlme ~t urlng a usy cyc e i. The exit probability 76 ii.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 108 pp. Englisch.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -I. The single server queue GIIG/1 1 1. 1 Definitions 1 1. 2 Regenerative processes 2 1. 3 The sequence n 1,2, . . . 4 = !::!n' 1. 4 The process t dO,co)} 11 {~t' The process t dO,co)} 1. 5 15 {~t' Applications to the GIIG/1 queue 1. 6 16 The average virtual waiting time during a busy 17 cycle ii. Little's formula 17 iii. The relation between the stationary distributions 18 of the virtual and actual waiting time iv. The relation between the distribution of the idle 20 period and the stationary distribution of the actual waiting time v. The limiting distribution of the residual service 24 time Pds. . , -pw vi. The relation for ~ rn E{e -n} 25 n=O 1. 7 Some notes on chapter I 27 II. The M/G/K system 31 2. 1 On the stationary distribution of the actual and virtua131 waiting time for the M/G/K queueing system 2. 2 The M/G/K loss system 36 2. 3 Proof of Erlang's formula for the M/G/K loss system 43 i. Proof for the system MIMI'' 45 ii. Proof for the system M/G/co 47 VI iii. Proof fol' the MIG IK los s system III. The M/G/1 system 3. 1 Introduction 71 (K) 3. 2 Downcrossings of the ~t -process 74 3. 3 The distribution of the supremum of the virtual waiting 75 - (00) d' b 1 tlme ~t urlng a usy cyc e i. The exit probability 76 ii. 108 pp. Englisch.