Stock Image

Foundations of Queueing Theory

N. U. Prabhu

Published by Springer
ISBN 10: 0792399625 / ISBN 13: 9780792399629
New / Hardcover / Quantity Available: 20
From BuySomeBooks (Las Vegas, NV, U.S.A.)
Available From More Booksellers
View all  copies of this book
Add to basket
Price: US$ 304.86
Convert Currency
Shipping: US$ 3.95
Within U.S.A.
Destination, Rates & Speeds

30 Day Returns Policy

Save for Later

About the Book

Bibliographic Details


Title: Foundations of Queueing Theory

Publisher: Springer

Binding: Hardcover

Book Condition: New

Book Type: Hardcover

Description:

Hardcover. 206 pages. Dimensions: 9.1in. x 6.3in. x 0.8in.The order and presentation of Foundations of Queueing Theory is drawn from Professor Prabhus extensive experience as a researcher, teacher, expositor, and editor. The book deals with the foundations of queueing theory and is intended as an advanced text for courses on queueing theory, and as a professional reference to queueing research. The results of queueing theory are established within the context of the books instructional framework. The central results of queueing theory are stated in the form of theorems for accessibility and reading ease. Current research has shown the need to pay more attention to the basic concepts and techniques of queueing theory. These include the busy period, imbedded chains, regeneration points, Wiener-Hopf technique, time-reversibility, output, vector Markov processes, remaining workload and completion times. The use of these concepts and techniques considerably simplifies the analysis of models involving last come, first served queue discipline, priorities, networks, set-up times and server vacations. It is these conceptional techniques that form the foundations of queueing theory. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Bookseller Inventory # 9780792399629

About this title:

Book ratings provided by GoodReads:
0 avg rating
(0 ratings)

Synopsis: 3. 2 The Busy Period 43 3. 3 The M 1M IS System with Last Come, First Served 50 3. 4 Comparison of FCFS and LCFS 51 3. 5 Time-Reversibility of Markov Processes 52 The Output Process 54 3. 6 3. 7 The Multi-Server System in a Series 55 Problems for Solution 3. 8 56 4 ERLANGIAN QUEUEING SYSTEMS 59 4. 1 Introduction 59 4. 2 The System M I E/c/1 60 4. 3 The System E/cl Mil 67 4. 4 The System MIDI1 72 4. 5 Problems for Solution 74 PRIORITY SYSTEMS 79 5 5. 1 Description of a System with Priorities 79 Two Priority Classes with Pre-emptive Resume Discipline 5. 2 82 5. 3 Two Priority Classes with Head-of-Line Discipline 87 5. 4 Summary of Results 91 5. 5 Optimal Assignment of Priorities 91 5. 6 Problems for Solution 93 6 QUEUEING NETWORKS 97 6. 1 Introduction 97 6. 2 A Markovian Network of Queues 98 6. 3 Closed Networks 103 Open Networks: The Product Formula 104 6. 4 6. 5 Jackson Networks 111 6. 6 Examples of Closed Networks; Cyclic Queues 112 6. 7 Examples of Open Networks 114 6. 8 Problems for Solution 118 7 THE SYSTEM M/G/I; PRIORITY SYSTEMS 123 7. 1 Introduction 123 Contents ix 7. 2 The Waiting Time in MIGI1 124 7. 3 The Sojourn Time and the Queue Length 129 7. 4 The Service Interval 132 7.

Product Description: The order and presentation of Foundations of Queueing Theory is drawn from Professor Prabhu's extensive experience as a researcher, teacher, expositor, and editor. The book deals with the foundations of queueing theory and is intended as an advanced text for courses on queueing theory, and as a professional reference to queueing research. The results of queueing theory are established within the context of the book's instructional framework. The central results of queueing theory are stated in the form of theorems for accessibility and reading ease.
Current research has shown the need to pay more attention to the basic concepts and techniques of queueing theory. These include the busy period, imbedded chains, regeneration points, Wiener-Hopf technique, time-reversibility, output, vector Markov processes, remaining workload and completion times. The use of these concepts and techniques considerably simplifies the analysis of models involving last come, first served queue discipline, priorities, networks, set-up times and server vacations. It is these conceptional techniques that form the foundations of queueing theory.

"About this title" may belong to another edition of this title.

Bookseller & Payment Information

Payment Methods

This bookseller accepts the following methods of payment:

  • American Express
  • MasterCard
  • Visa

[Search this Seller's Books]

[List this Seller's Books]

[Ask Bookseller a Question]

Bookseller: BuySomeBooks
Address: Las Vegas, NV, U.S.A.

AbeBooks Bookseller Since: May 21, 2012
Bookseller Rating: 5-star rating

Terms of Sale:

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

BuySomeBooks is operated by Drive-On-In, Inc., a Nevada co...

[More Information]

Shipping Terms:

Orders usually ship within 1-2 business days. Books are shipped from multiple locations so your order may arrive from Las Vegas,NV, Roseburg,OR, La Vergne,TN, Momence,IL, or Commerce,GA.


Store Description: BuySomeBooks is great place to get your books online. With over eight million titles available we're sure to have what you're looking for. Despite having a large selection of new books available for immediate shipment and excellent customer service, people still tell us they prefer us because of our prices.