Skip to main content

Queueing Theory

A Linear Algebraic Approach

  • Textbook
  • © 2009

Overview

  • Chapter Summaries
  • Detailed Illustrations
  • Numerous Examples
  • The Exercises are often extensions of the examples.
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

Keywords

About this book

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.

Reviews

From the reviews of the second edition:

“In this book, which is in the second edition now … the author presents queueing concepts from the linear algebraic point of view. … The book will be a good addition to the library of researchers in queueing theory. It is more suitable for senior graduate level and doctoral students.” (Srinivas Chakravarthy, Mathematical Reviews, Issue 2010 f)

“This is the 2nd edition of the text book which is intended ‘for those who know queueing theory, but would like to know more about the linear algebraic approach’. On the other hand it can be used as ‘a textbook in a first course in queueing theory’ for the students who know more matrices and algebraic approach than the probability theory. Much discussion on computational aspects including matrix operations (supported by languges MATLAB, Mathematica, Maple) is presented.” (Evsen Morozov, Zentralblatt MATH, Vol. 1169, 2009)

Authors and Affiliations

  • Dept. Computer Science & Engineering, University of Connecticut, Storrs, U.S.A.

    Lester Lipsky

Bibliographic Information

Publish with us