ME Woodward
John Wiley & Sons
e druk, 1993
9780818651724
Communication and Computer Networks – Modelling with Discrete–Time Queues
Modelling with discrete–time queues
Specificaties
Gebonden, 216 blz.
|
Engels
John Wiley & Sons |
e druk, 1993
ISBN13: 9780818651724
Rubricering
Onderdeel van serie
Systems
Levertijd ongeveer 8 werkdagen
Samenvatting
This book presents a unified approach to developing accurate discrete–time models of communication and computer networks, using discrete–time queuing theory and approximation techniques to obtain solutions. The first chapter outlines the basic aims and philosophy of the book and introduces discrete–time queues at the simplest possible level. The chapters that follow cover probability theory and discrete–time Markov chains, delve into discrete–time queues and queuing networks, and focus on applications for satellite and local area networks. In addition, the book gives examples of specific modeling techniques, and covers handling statistically different users, finite channel delays, timing delays, and unsolvable traffic equations.
Specificaties
ISBN13:9780818651724
Taal:Engels
Bindwijze:gebonden
Aantal pagina's:216
Uitgever:John Wiley & Sons
Serie:Systems
Inhoudsopgave
1. Networks, Queues and Performance Modelling.
<br />
<br /> 1.1 Introduction.
<br />
<br /> 1.2 Network tyes.
<br />
<br /> 1.3 Multiple–access protocols.
<br />
<br /> 1.4 Discrete–time queues.
<br />
<br /> 1.5 Performance measures.
<br />
<br /> 2. Probability, Random Variables, and Distributions.
<br />
<br /> 2.1 Probability.
<br />
<br /> 2.2 Random variables.
<br />
<br /> 2.3 Distributions.
<br />
<br /> 2.4 Conditional distributions.
<br />
<br /> 3. Stochastic Process and Markov Chains.
<br />
<br /> 3.1 Poisson process.
<br />
<br /> 3.2 Properties of the Poisson process.
<br />
<br /> 3.3 Markov chains.
<br />
<br /> 3.4 Markov chain models.
<br />
<br /> 3.5 Exercises.
<br />
<br /> 4. Discrete–Time Queues.
<br />
<br /> 4.1 Performance measures and Litte′s result.
<br />
<br /> 4.2 Discrete–time queueing conventions.
<br />
<br /> 4.3 Discrete–time M/M/1 queue.
<br />
<br /> 4.4 Discrete–time M/M/1/J queue.
<br />
<br /> 4.5 Discrete–time M?an/M/1
<br />
<br /> 4.6 Discrete–time M?an/M?dm/ infinity queue.
<br />
<br /> 4.7 S–queues.
<br />
<br /> 4.8 Exercises.
<br />
<br /> 5. Discrete–Time Queueing Networks.
<br />
<br /> 5.1 Tandem S–queues.
<br />
<br /> 5.2 Network of S–queues.
<br />
<br /> 5.3 Discrete–time queueing network models for multiple access protocols.
<br />
<br /> 5.4 Equilibrium point analysis.
<br />
<br /> 5.5 Different customer classes.
<br />
<br /> 5.6 Exercises.
<br />
<br /> 6. Satellite Networks.
<br />
<br /> 6.1 Time–division multiple access.
<br />
<br /> 6.2 Slotted Aloha.
<br />
<br /> 6.3 Code division multiple access.
<br />
<br /> 6.4 Buffered slotted Aloha
<br />
<br /> 6.5 Exercises.
<br />
<br /> 7. Local Area Networks.
<br />
<br /> 7.1 Carrier sensing networks.
<br />
<br /> 7.2 Token passing networks.
<br />
<br /> 7.3 Slotted rings.
<br />
<br /> 7.4 Exercises.
<br />
<br /> Appendix.
<br />
<br /> References.
<br />
<br /> Index.
<br />
<br /> 1.1 Introduction.
<br />
<br /> 1.2 Network tyes.
<br />
<br /> 1.3 Multiple–access protocols.
<br />
<br /> 1.4 Discrete–time queues.
<br />
<br /> 1.5 Performance measures.
<br />
<br /> 2. Probability, Random Variables, and Distributions.
<br />
<br /> 2.1 Probability.
<br />
<br /> 2.2 Random variables.
<br />
<br /> 2.3 Distributions.
<br />
<br /> 2.4 Conditional distributions.
<br />
<br /> 3. Stochastic Process and Markov Chains.
<br />
<br /> 3.1 Poisson process.
<br />
<br /> 3.2 Properties of the Poisson process.
<br />
<br /> 3.3 Markov chains.
<br />
<br /> 3.4 Markov chain models.
<br />
<br /> 3.5 Exercises.
<br />
<br /> 4. Discrete–Time Queues.
<br />
<br /> 4.1 Performance measures and Litte′s result.
<br />
<br /> 4.2 Discrete–time queueing conventions.
<br />
<br /> 4.3 Discrete–time M/M/1 queue.
<br />
<br /> 4.4 Discrete–time M/M/1/J queue.
<br />
<br /> 4.5 Discrete–time M?an/M/1
<br />
<br /> 4.6 Discrete–time M?an/M?dm/ infinity queue.
<br />
<br /> 4.7 S–queues.
<br />
<br /> 4.8 Exercises.
<br />
<br /> 5. Discrete–Time Queueing Networks.
<br />
<br /> 5.1 Tandem S–queues.
<br />
<br /> 5.2 Network of S–queues.
<br />
<br /> 5.3 Discrete–time queueing network models for multiple access protocols.
<br />
<br /> 5.4 Equilibrium point analysis.
<br />
<br /> 5.5 Different customer classes.
<br />
<br /> 5.6 Exercises.
<br />
<br /> 6. Satellite Networks.
<br />
<br /> 6.1 Time–division multiple access.
<br />
<br /> 6.2 Slotted Aloha.
<br />
<br /> 6.3 Code division multiple access.
<br />
<br /> 6.4 Buffered slotted Aloha
<br />
<br /> 6.5 Exercises.
<br />
<br /> 7. Local Area Networks.
<br />
<br /> 7.1 Carrier sensing networks.
<br />
<br /> 7.2 Token passing networks.
<br />
<br /> 7.3 Slotted rings.
<br />
<br /> 7.4 Exercises.
<br />
<br /> Appendix.
<br />
<br /> References.
<br />
<br /> Index.