Log In
Or create an account ->
Imperial Library
Home
About
News
Upload
Forum
Help
Login/SignUp
Index
Dedication
Preface
Acknowledgments
CHAPTER 1: INTRODUCTION
1.1 DESCRIPTION OF THE QUEUEING PROBLEM
1.2 CHARACTERISTICS OF QUEUEING PROCESSES
1.3 NOTATION
1.4 MEASURING SYSTEM PERFORMANCE
1.5 SOME GENERAL RESULTS
1.6 SIMPLE DATA BOOK KEEPING FOR QUEUES
1.7 POISSON PROCESS AND THE EXPONENTIAL DISTRIBUTION
1.8 MARKOVIAN PROPERTY OF THE EXPONENTIAL DISTRIBUTION
1.9 STOCHASTIC PROCESSES AND MARKOV CHAINS
1.10 INTRODUCTION TO THE QTSPLUS SOFTWARE
PROBLEMS
CHAPTER 2: SIMPLE MARKOVIAN QUEUEING MODELS
2.1 BIRTH-DEATH PROCESSES
2.2 SINGLE-SERVER QUEUES (M/M/1)
2.3 MULTISERVER QUEUES (M/M/C)
2.4 CHOOSING THE NUMBER OF SERVERS
2.5 QUEUES WITH TRUNCATION (M/M/C/K)
2.6 ERLANG’S LOSS FORMULA (M/M/C/C)
2.7 QUEUES WITH UNLIMITED SERVICE (M/M/∞)
2.8 FINITE-SOURCE QUEUES
2.9 STATE-DEPENDENT SERVICE
2.10 QUEUES WITH IMPATIENCE
2.11 TRANSIENT BEHAVIOR
2.12 BUSY-PERIOD ANALYSIS
CHAPTER 3: ADVANCED MARKOVIAN QUEUEING MODELS
3.1 BULK INPUT (M[X]/M/L)
3.2 BULK SERVICE (M/M[Y]/1)
3.3 ERLANGIAN MODELS
3.4 PRIORITY QUEUE DISCIPLINES
3.5 RETRIAL QUEUES
CHAPTER 4: NETWORKS, SERIES, AND CYCLIC QUEUES
4.1 SERIES QUEUES
4.2 OPEN JACKSON NETWORKS
4.3 CLOSED JACKSON NETWORKS
4.4 CYCLIC QUEUES
4.5 EXTENSIONS OF JACKSON NETWORKS
4.6 NON-JACKSON NETWORKS
CHAPTER 5: GENERAL ARRIVAL OR SERVICE PATTERNS
5.1 GENERAL SERVICE, SINGLE SERVER (M/G/L)
5.2 GENERAL SERVICE, MULTISERVER (M/G/C/·, M/G/∞)
5.3 GENERAL INPUT (G/M/L, G/M/C)
CHAPTER 6: GENERAL MODELS AND THEORETICAL TOPICS
6.1 G/EK/1, G[K]/M/1, AND G/PHK/1
6.2 GENERAL INPUT, GENERAL SERVICE (G/G/1)
6.3 POISSON INPUT, CONSTANT SERVICE, MULTISERVER (M/D/C)
6.4 SEMI-MARKOV AND MARKOV RENEWAL PROCESSES IN QUEUEING
← Prev
Back
Next →
← Prev
Back
Next →