Optimal design of queueing systems. (©2009)

• Record Type: Book
• Further Information: Note: Shaler Stidham, Jr.
• Other Names: Jr, Stidham, Shaler
• Contents: Preface Introduction to Design Models Optimal Service Rate Optimal Arrival Rate Optimal Arrival Rate and Service Rate Optimal Arrival Rates for a Two-Class System Optimal Arrival Rates for Parallel Queues Optimal Arrival Rates in a Single-Class Queue A Model with General Utility and Cost Functions Generalizations of Basic Model GI/GI/1 Queue with Probabilistic Joining Rule Uniform Value Distribution: Stability Power Criterion Bidding for Priorities Dynamic Adaptive Algorithms: Stability and Chaos Basic Model Discrete-Time Dynamic Adaptive Model Discrete-Time Dynamic Algorithms: Variants Continuous-Time Dynamic Adaptive Algorithms Continuous-Time Dynamic Algorithm: Variants Optimal Arrival Rates in a Multiclass Queue General Multiclass Model: Formulation General Multiclass Model: Optimal Solutions General Multiclass Model: Dynamic Algorithms Waiting Costs Dependent on Total Arrival Rate Linear Utility Functions: Class Dominance Examples with Different Utility Functions Multiclass Queue with Priorities Figures for FIFO Examples Optimal Service Rates in a Single-Class Queue The Basic Model Models with Fixed Toll and Fixed Arrival Rate Models with Variable Toll and Fixed Arrival Rate Models with Fixed Toll and Variable Arrival Rate Models with Variable Toll and Variable Arrival Rate Multifacility Queueing Systems: Parallel Queues Optimal Arrival Rates Optimal Service Rates Optimal Arrival Rates and Service Rates Single-Class Networks of Queues Basic Model Individually Optimal Arrival Rates and Routes Socially Optimal Arrival Rates and Routes Comparison of S.O. and Toll-Free I.O. Solutions Facility Optimal Arrival Rates and Routes Multiclass Networks of Queues General Model Fixed Routes: Optimal Solutions Fixed Routes: Dynamic Adaptive Algorithms Fixed Routes: Homogeneous Waiting Costs Variable Routes: Homogeneous Waiting Costs Appendix: Scheduling a Single-Server Queue Strong Conservation Laws Work-Conserving Scheduling Systems GI/GI/1 WCSS with Non-Preemptive Scheduling Rules GI/GI/1 Queue: Preemptive-Resume Scheduling Rules References Index Endnotes appear in each chapter.
• Publisher Details: Boca Raton : CRC Press/Taylor & Francis
• Publication Date: 2009
• Copyright Date: 2009
• Extent: 1 online resource (xii, 371 pages), illustrations
• Subjects: 519.8/2; Queuing theory; Combinatorial optimization; MATHEMATICS -- Applied; MATHEMATICS -- Probability & Statistics -- General; Combinatorial optimization; Queuing theory; Electronic books
• Languages: English
• ISBNs: 9781420010008; 9781584880769; 1584880767
• Related ISBNs: 142001000X
• Notes: Note: Includes bibliographical references (pages 359-368) and index.; Note: Print version record.
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.