A text that presents a unified method for modeling any network access protocol as a discrete-time queuing network, and develops efficient solution techniques for these models. A significant number of the models and their solutions have not previously appeared in the open literature. The treatment is self-contained and progresses from basic probability theory and discrete-time Markov chains, through to discrete-time queues, and discrete-time queuing 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. Annotation copyright Book News, Inc. Portland, Or.
