Communication and Computer Networks

ISBN-13: 9780818651724 / Angielski / Twarda / 1994 / 216 str.

Michael E. Woodward;IEEE

Opis

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.

Spis treści

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.

O autorze

Michael Woodward is currently a Senior Lecturer in the Department of Electronic and Electrical Engineering at Loughborough University of Technology, U.K. He obtained a first class honours degree in Electrical Engineering from the University of Nottingham, U.K., in 1967, and was awarded a Ph.D at the same institution in 1971 for research into decomposition of sequential logic systems. He currently teaches both undergraduate and postgraduate courses in Software Engineering, Digital Communications, and Communication and Computer Networks, and has had over fifty research papers published in these and related areas. His present research interests include discrete–time queueing systems and the performance modeling of ATM networks.
Dr. Woodward is a Fellow of the Institute of Mathematics and its Applications, and is Chartered Mathematician.