Produktbild: Delayed and Network Queues

Delayed and Network Queues

138,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

03.10.2016

Verlag

John Wiley & Sons

Seitenzahl

416

Maße (L/B/H)

23,6/15,7/2,5 cm

Gewicht

703 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-1-119-02213-8

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

03.10.2016

Verlag

John Wiley & Sons

Seitenzahl

416

Maße (L/B/H)

23,6/15,7/2,5 cm

Gewicht

703 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-1-119-02213-8

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

Die Leseprobe wird geladen.
  • Produktbild: Delayed and Network Queues
  • Preface xi
     
    1 Preliminaries 1
     
    1.1 Basics of Probability, 1
     
    1.1.1 Introduction, 1
     
    1.1.2 Conditional Probability, 2
     
    1.2 Discrete Random Variables and Distributions, 4
     
    1.3 Discrete Moments, 8
     
    1.4 Continuous Random Variables, Density, and Cumulative Distribution Functions, 13
     
    1.5 Continuous Random Vector, 17
     
    1.6 Functions of Random Variables, 19
     
    1.7 Continuous Moments, 23
     
    1.8 Difference Equations, 25
     
    1.8.1 Introduction, 25
     
    1.8.2 Basic Definitions and Properties, 25
     
    1.9 Methods of Solving Linear Difference Equations with Constant Coefficients, 27
     
    1.9.1 Characteristic Equation Method, 27
     
    1.9.2 Recursive Method, 29
     
    1.9.3 Generating Function Method, 30
     
    1.9.4 Laplace Transform Method, 32
     
    Exercises, 36
     
    2 Stochastic Processes 39
     
    2.1 Introduction and Basic Definitions, 39
     
    2.2 Markov Chain, 43
     
    2.2.1 Classification of States, 53
     
    2.3 Markov Process, 58
     
    2.3.1 Markov Process with Discrete Space State, 58
     
    2.4 Random Walk, 61
     
    2.5 Up-and-Down Biased Coin Design as a Random Walk, 69
     
    Exercises, 75
     
    3 Birth and Death Processes 77
     
    3.1 Overviews of the Birth and Death Processes, 77
     
    3.2 Finite B-D Process, 86
     
    3.3 Pure Birth Process (Poisson Process), 94
     
    3.4 Pure Death Process (Poisson Death Process), 96
     
    Exercises, 97
     
    4 Standard Queues 101
     
    4.1 Introduction of Queues (General Birth and Death Process), 101
     
    4.1.1 Mechanism, Characteristics, and Types of Queues, 103
     
    4.2 Remarks on Non-Markovian Queues, 108
     
    4.2.1 Takács's Waiting Time Paradox, 108
     
    4.2.2 Virtual Waiting Time and Takács's Integro-Differential Equation, 109
     
    4.2.3 The Unfinished Work, 113
     
    4.3 Stationary M/M/1 Queueing Process, 116
     
    4.4 A Parallel M/M/C/K with Baking and Reneging, 119
     
    4.5 Stationary M/M/1/K Queueing Process, 120
     
    4.6 Busy Period of an M/M/1/K Queue, 122
     
    4.7 Stationary M/M/1 and M/M/1/K Queueing Processes with Feedback, 124
     
    4.7.1 Stationary Distribution of the Sojourn Time of a Task, 126
     
    4.7.2 Distribution of the Total Time of Service by a Task, 128
     
    4.7.3 Stationary Distribution of the Feedback Queue Size, 129
     
    4.7.4 Stationary Distribution of zetan (Sojourn Time of the nth task), 130
     
    4.8 Queues with Bulk Arrivals and Batch Service, 131
     
    4.9 A Priority Queue with Balking and Reneging, 133
     
    4.10 Discrete Time M/M/1 Queueing Process, Combinatorics Method (Lattice Paths), 137
     
    4.10.1 The Basic Ballot Problem, 138
     
    4.10.2 Ballot Problem (based on Takács 1997), 140
     
    4.10.3 Transient Solution of the M/M/1 by Lattice Path Method, 149
     
    4.11 Stationary M/M/C Queueing Process, 153
     
    4.11.1 A Stationary Multiserver Queue, 154
     
    Exercises, 156
     
    5 Queues With Delay 159
     
    5.1 Introduction, 159
     
    5.2 A Queuing System with Delayed Service, 163
     
    5.3 An M/G/1 Queue with Server Breakdown and with Multiple Working Vacation, 172
     
    5.3.1 Mathematical Formulation of the Model, 173
     
    5.3.2 Steady-State Mean Number of Tasks in the System, 173
     
    5.3.3 A Special Case, 183
     
    5.4 A Bulk Queuing System Under N-Policy with Bilevel Service Delay Discipline and Start-Up Time, 185
     
    5.4.1 Analysis of the Model, 186
     
    5.5 Interrelationship between N-Policy M/G/1/K and F-Policy G/M/1/K Queues with Start-up Time, 188
     
    5.5.1 N-Policy M/G/1/K Queuing System wi