关注 The Essential Guide to Queueing Theory

186

34页

0次

2021-09-08

5墨值下载

P(W

> 0) =

M − A

M−1

i=1

i !

M − A

The Essential Guide To

Queueing Theory

September 8, 2016 • Revision 3

Meet the Author

Baron Schwartz

Baron is well-known for his contributions to the MySQL,

PostgreSQL, and Oracle communities. Baron has helped build

and optimize database systems for some of the largest Internet

properties. He has written several books, including O'Reilly's

best-selling High Performance MySQL. Prior to founding

VividCortex, Baron managed consulting, support, training, and

software engineering at Percona. He has a CS degree from the

University of Virginia.

Table of Contents

• Queueing Theory is for Everyone 3

• What is Queueing Theory? 4

• Why Queueing Theory is Tricky 5

• Queueing Systems in Real Life 6

• Why Does Queueing Happen? 9

• The Queueing Theory Framework 11

• Describing Queueing Systems 16

• Calculating Queue Lengths and Wait Times 19

• The Erlang Queueing Formulas 22

• Approximations to Erlang Formulas 23

• Many Queues or One Combined Queue? 25

• Tradeoffs Between Cost and Quality of Service 28

• Applying Queueing Theory in the Real World 29

• Conclusions 31

• Further Reading 32

of 34

5墨值下载

关注