Book Description
“To design future networks that are worthy of society’s trust, we must put the ‘discipline’ of computer networking on a much stronger foundation. This book rises above the considerable minutiae of today’s networking technologies to emphasize the longstanding mathematical underpinnings of the field.”
–Professor Jennifer Rexford, Department of Computer Science, Princeton University
“This book is exactly the one I have been waiting for the last couple of years. Recently, I decided most students were already very familiar with the way the net works but were not being taught the fundamentals–the math. This book contains the knowledge for people who will create and understand future communications systems."
–Professor Jon Crowcroft, The Computer Laboratory, University of Cambridge
The Essential Mathematical Principles Required to Design, Implement, or Evaluate Advanced Computer Networks
Students, researchers, and professionals in computer networking require a firm conceptual understanding of its foundations. Mathematical Foundations of Computer Networking provides an intuitive yet rigorous introduction to these essential mathematical principles and techniques.
Assuming a basic grasp of calculus, this book offers sufficient detail to serve as the only reference many readers will need. Each concept is described in four ways: intuitively; using appropriate mathematical notation; with a numerical example carefully chosen for its relevance to networking; and with a numerical exercise for the reader.
The first part of the text presents basic concepts, and the second part introduces four theories in a progression that has been designed to gradually deepen readers’ understanding. Within each part, chapters are as selfcontained as possible.
The first part covers probability; statistics; linear algebra; optimization; and signals, systems, and transforms. Topics range from Bayesian networks to hypothesis testing, and eigenvalue computation to Fourier transforms.
These preliminary chapters establish a basis for the four theories covered in the second part of the book: queueing theory, game theory, control theory, and information theory. The second part also demonstrates how mathematical concepts can be applied to issues such as contention for limited resources, and the optimization of network responsiveness, stability, and throughput.
Table of Contents
 Title Page
 Copyright Page
 Contents
 Preface
 1. Probability

2. Statistics
 2.1. Sampling a Population
 2.2. Describing a Sample Parsimoniously
 2.3. Inferring Population Parameters from Sample Parameters
 2.4. Testing Hypotheses about Outcomes of Experiments
 2.5. Independence and Dependence: Regression and Correlation
 2.6. Comparing Multiple Outcomes Simultaneously: Analysis of Variance
 2.7. Design of Experiments
 2.8. Dealing with Large Data Sets
 2.9. Common Mistakes in Statistical Analysis
 2.10. Further Reading
 2.11. Exercises
 3. Linear Algebra
 4. Optimization

5. Signals, Systems, and Transforms
 5.1. Background
 5.2. Signals
 5.3. Systems
 5.4. Analysis of a Linear TimeInvariant System
 5.5. Transforms
 5.6. The Fourier Series
 5.7. The Fourier Transform and Its Properties
 5.8. The Laplace Transform
 5.9. The Discrete Fourier Transform and Fast Fourier Transform
 5.10. The Z Transform
 5.11. Further Reading
 5.12. Exercises
 6. Stochastic Processes and Queueing Theory
 7. Game Theory

8. Elements of Control Theory
 8.1. Overview of a Controlled System
 8.2. Modeling a System
 8.3. A FirstOrder System
 8.4. A SecondOrder System
 8.5. Basics of Feedback Control
 8.6. PID Control
 8.7. Advanced Control Concepts
 8.8. Stability
 8.9. State Space–Based Modeling and Control
 8.10. Digital Control
 8.11. Partial Fraction Expansion
 8.12. Further Reading
 8.13. Exercises
 9. Information Theory
 Solutions to Exercises
 Index
Product Information
 Title: Mathematical Foundations of Computer Networking
 Author(s):
 Release date: April 2012
 Publisher(s): AddisonWesley Professional
 ISBN: 9780132826143