This book is concerned exclusively with discrete-time queues and their applications to the performance modeling of communication and computer networks. Since most modern networks operate on the basis of time slotting, and transmit information in fixed length (packets or cells), it thus becomes natural to model such networks in discrete-time by associating a time slot in a physical network with the unit time in the corresponding discrete-time model. The book shows how, in this way, very accurate models that faithfully reproduce the stochastic behaviour of a communication or computer network can be constructed.
The treatment is self contained, and progresses from basic probability theory and discrete-time queueing networks. These latter are applied to model the performance of numerous wide area satellite networks and local area networks, ranging in complexity from simple Aloha schemes to the timed token protocol of the FDDI network. The main objective of this book is to present a unified method for modeling any network access protocol as a discrete-time queueing network and t develop efficient solution techniques for these models. A significant number of the models and their solutions which are included have not previously appeared in the open literature.
The text should prove useful to practitioners and researchers concerned with communication and computer network performance modeling, or anyone wanting a sound understanding of the application of discrete-time technique to this subject area.
Reihe
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Produkt-Hinweis
Fadenheftung
Gewebe-Einband
Maße
Höhe: 235 mm
Breite: 157 mm
Dicke: 16 mm
Gewicht
ISBN-13
978-0-8186-5172-4 (9780818651724)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Scott D Woodward was born in the Balboa Naval Hospital in San Diego. He spent his formative years in San Diego and Japan where he developed a fascination for Asian culture, history and religion. Since his youth, Scott has lived and worked on six continents. He is a voracious reader and avid writer, writing at the professional level operations, sales and training manuals for a variety of industries. Scott is an accomplished athlete competing in surfing, cycling, karate, track and field and archery events. He has been writing poetry since middle school and has won several poetry awards, including the Editors Choice Award three times. Scott holds degrees in British/American Literature and Business Finance, graduating Magna Cum Laude. He was senior vice president for a large commodities brokerage firm and a licensed stock and commodities broker as well as the corporate sales director for a multi-billion dollar international inter-modal freight forwarding company.
Autor*in
Loughborough University of Technology
1. Networks, Queues and Performance Modelling.
1.1 Introduction.
1.2 Network tyes.
1.3 Multiple-access protocols.
1.4 Discrete-time queues.
1.5 Performance measures.
2. Probability, Random Variables, and Distributions.
2.1 Probability.
2.2 Random variables.
2.3 Distributions.
2.4 Conditional distributions.
3. Stochastic Process and Markov Chains.
3.1 Poisson process.
3.2 Properties of the Poisson process.
3.3 Markov chains.
3.4 Markov chain models.
3.5 Exercises.
4. Discrete-Time Queues.
4.1 Performance measures and Litte's result.
4.2 Discrete-time queueing conventions.
4.3 Discrete-time M/M/1 queue.
4.4 Discrete-time M/M/1/J queue.
4.5 Discrete-time M?an/M/1
4.6 Discrete-time M?an/M?dm/ infinity queue.
4.7 S-queues.
4.8 Exercises.
5. Discrete-Time Queueing Networks.
5.1 Tandem S-queues.
5.2 Network of S-queues.
5.3 Discrete-time queueing network models for multiple access protocols.
5.4 Equilibrium point analysis.
5.5 Different customer classes.
5.6 Exercises.
6. Satellite Networks.
6.1 Time-division multiple access.
6.2 Slotted Aloha.
6.3 Code division multiple access.
6.4 Buffered slotted Aloha
6.5 Exercises.
7. Local Area Networks.
7.1 Carrier sensing networks.
7.2 Token passing networks.
7.3 Slotted rings.
7.4 Exercises.
Appendix.
References.
Index.
