Queueing Theory: A Linear Algebraic Approach

Lester Lipsky

ISBN 10: 0387497048 / ISBN 13: 9780387497044

Verlag: Springer, 2008

Deals with systems where there is contention for resources, but the demands are only known probabilistically. This book is suitable for those who already know Queueing Theory but would like to know more of the Linear Algebraic Approach; and also for students who don't have a strong background in probability. Num Pages: 548 pages, biography. BIC Classification: PBF; TJK. Category: (P) Professional & Vocational. Dimension: 240 x 166 x 32. Weight in Grams: 922. . 2008. 2nd. Hardcover. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9780387497044

Inhaltsangabe:

Queueing Theory deals with systems where there is contention for resources, but the demands are only known probabilistically.

This book can be considered to be a monograph or a textbook, and thus is aimed at two audiences: those who already know Queueing Theory but would like to know more of the Linear Algebraic Approach; and as a rst course for students who don’t already have a strong background in probability, and feel more comfortable with algebraic arguments. Also, the equations are well suited to easy computation. In fact, there is much discussion on how various properties can be easily computed in any language that has automatic matrix operations (e.g., MATLAB). To help with physical insight, there are over 80 gures, numerous examples and exercises distributed throughout the book. There are, perhaps 50 books on QT that are available today, and most practitioners have several of them on their shelves. This book would be a good addition, as well as a good supplement to another text.

This second edition has been updated throughout including a new chapter on Semi Markov Processes and new material on matrix representations of distributions and Power-tailed distribution.

Lester Lipsky is a Professor in the Department of Computer Science and Engineering at the University of Connecticut.

Von der hinteren Coverseite:

Queueing Theory deals with systems where there is contention for

resources, but the demands are only known probabilistically. This book can

be considered as either a monograph or a textbook on the subject, and thus

is aimed at two audiences. It can be useful for those who already know

queueing theory, but would like to know more about the linear algebraic approach.

It can also be used as a textbook in a first course on queueing theory for

students who feel more comfortable with matrices and algebraic arguments than

with probability theory. The equations are well-suited to easy computation.

The text has much discussion on how various properties can be computed using any

language that has built-in matrix operations (e.g., MATLAB, Mathematica, Maple).

To help with physical insight, there are over 80 figures, numerous examples,

and many exercises distributed throughout the book.

There are over 50 books on queueing theory that are available today and

most practitioners have several of them on their shelves. Because of its

unusual approach, this book would be an excellent addition. It would also

make a good supplement where another book was selected as the primary text

for a course in system performance modelling.

This second edition has been greatly expanded and updated thoughout, including

a new chapter on semi-Markov processes and new material on representations

of distributions. In particular, there is much discussion of power-tailed

distributions and their effects on queues.

Lester Lipsky is a professor in the Department of Computer Science and

Engineering at the University of Connecticut.

Bibliografische Details

Titel: Queueing Theory: A Linear Algebraic Approach
Verlag: Springer
Erscheinungsdatum: 2008
Einband: Hardcover
Zustand: New
Auflage: 2. Auflage