Thompson, Carl M. Author : John F. Rather than focus narrowly on a particular application area, the authors illustrate the theory in practice across a range of fields, from computer science and various engineering disciplines to business and operations research.
Critically, the text also provides a numerical approach to understanding and making estimations with queueing theory and provides comprehensive coverage of both simple and advanced queueing models. As with all preceding editions, this latest update of the classic text features a unique blend of the theoretical and timely real-world applications.
Featuring chapter-end exercises and problems—all of which have been classroom-tested and refined by the authors in advanced undergraduate and graduate-level courses—Fundamentals of Queueing Theory, Fifth Edition is an ideal textbook for courses in applied mathematics, queueing theory, probability and statistics, and stochastic processes.
Its excellentorganizational structure allows quick reference to specific modelsand its clear presentation. Rather than presenting a narrow focus on the subject,this update illustrates the wide-reaching, fundamental concepts inqueueing theory and its applications to diverse areas such ascomputer science, engineering, business, and operationsresearch. This update takes a numerical approach to understanding andmaking probable estimations relating to queues, with acomprehensive outline of simple and more advanced queueing models.
Newly featured topics of the Fourth Edition include: Retrial queues Approximations for queueing networks Numerical inversion of transforms Determining the appropriate number of servers to balance qualityand cost of service Each chapter provides a self-contained presentation of keyconcepts and formulae, allowing readers to work with each sectionindependently, while a summary table at the end of the bookoutlines the types of queues that have been discussed and theirresults.
In addition, two new appendices have been added,discussing transforms and generating functions as well as thefundamentals of differential and difference equations. New examplesare now included along with problems that incorporate QtsPlussoftware, which is freely available via the book's related Website.
With its accessible style and wealth of real-world examples,Fundamentals of Queueing Theory, Fourth Edition is an idealbook for courses on queueing theory at the upper-undergraduate andgraduate levels. Create lists, bibliographies and reviews: or. Search WorldCat Find items in libraries near you. Advanced Search Find a Library. Your list has reached the maximum number of items. Please create a new list with a new name; move some items to a new or existing list; or delete some items.
Your request to send this item has been completed. APA 6th ed. Note: Citations are based on reference standards. However, formatting rules can vary widely between applications and fields of interest or study. The specific requirements or preferences of your reviewing publisher, classroom teacher, institution or organization should be applied.
The E-mail Address es field is required. Please enter recipient e-mail address es. The E-mail Address es you entered is are not in a valid format. Please re-enter recipient e-mail address es. You may send this item to up to five recipients. The name field is required. Please enter your name.
The E-mail message field is required. Please enter the message. Please verify that you are not a robot. The book consists of 15 chapters in five parts. The first part Chapters 1—7 provides results for exact analytical networks that are in the form of product form solutions.
Single station and tandem queues structures are analysed in Chapter 1. Quasi -reversible order-independent queues are analysed in Chapter 2. In Chapter 3, the Erlang loss system is analysed with focus on its insensitivity.
In Chapter 4, Palm calculus and its applications to queues are discussed. In Chapter 5, networks with product form solutions are reviewed. The case of discrete time is discussed in Chapter 6, while in Chapter 7 decomposition and aggregation of multi-class queueing networks with state-dependent routing are presented.
The second part Chapters 8—9 presents two basic approaches that can be used to obtain bounds for performance measures for intractable queueing networks. In Chapter 8, stochastic comparison and monotonocity of queueing networks are presented. In Chapter 9, comparison results and explicit error bounds based on the underlying Markov reward processes are given.
It is shown also that the first approach yields stronger results than the Markov reward process approach, especially for complex structure queueing network. The third part of the book Chapters 10—12 is about diffusion and fluid results that can be used for analyzing some queueing networks. In Chapter 10, the analysis by fluid limits method is used to analyse stability of join-the-shortest-queue networks.
In Chapter 11, diffusion approximations are used to analyse multi-server queues. And in Chapter 12, queueing networks with Gaussian inputs are analysed in an asymptotic way.
0コメント