∗ techniques of duality, collective marks
∗ queueing networks
∗ complete appendix on z–transforms and Laplace transforms
∗ an entire appendix on probability theory, providing the notation and main results needed throughout the text
∗ definition and use of a new and convenient graphical notation for describing the arrival and departure of customers to a queueing system
∗ a Venn diagram classification of many common stochastic processes
1975 (0 471–49110–1) 417 pp. Fundamentals of Queueing Theory Second Edition Donald Gross and Carl M. Harris This graduated, meticulous look at queueing fundamentals developed from the authors′ lecture notes presents all aspects of the methodology–including Simple Markovian birth–death queueing models; advanced Markovian models; networks, series, and cyclic queues; models with general arrival or service patterns; bounds, approximations, and numerical techniques; and simulation–in a style suitable to courses of study of widely varying depth and duration. This Second Edition features new expansions and abridgements which enhance pedagogical use: new material on numerical solution techniques for both steady–state and transient solutions; changes in simulation language and new results in statistical analysis; and more. Complete with a solutions manual, here is a comprehensive, rigorous introduction to the basics of the discipline. 1985 (0 471–89067–7) 640 pp.
Inequalities and Approximations.
Computer Time–Sharing and Multiaccess Systems.
Computer–Communication Networks: Analysis and Design.
Computer–Communication Networks: Measurement, Flow Control, and ARPANET Traps.