Mathematical Foundations of Computer Networking

Graduate students often require concise introductions to the theoretical foundations of networking. Many students lack a 'feel' for probability, statistics, optimization, game theory, control theory, and queueing theory. However, unlike discrete algebra and, to some degree calculus and linear algebra, these subjects are not taught in a typical CS curriculum. Graduate students confronted by papers using these ideas are at a loss, and it is impractical to require remedial courses of every student.

This book addresses the problem by taking an intuitive approach to these topics. The depth of coverage provided here is not a substitute for standard textbooks. Rather, I hope to provide enough intuition to allow a student to grasp the essence of a research paper that uses these theoretical foundations.

My book on this topic was published by Addison-Wesley ( in April 2012. The draft version of the book is therefore no longer available from this site. However, you can find 80 hours of video of me lecturing on topics from the book on YouTube.

An Engineering Approach to Computer Networking

I wrote a textbook called An Engineering Approach to Computer Networking ( that was published in 1997 by Addison-Wesley.

Here are Powerpoint slides ( that cover the material in the book.

The first edition of my book is out of date, emphasizes ATM, and does not cover topics such as wireless, mobility, and cell phone technologies. These will be covered in a second edition, someday, I hope.

Retrieved from ""

This page has been accessed 21164 times. This page was last modified 23:56, 20 Aug 2012. Content is available under GNU Free Documentation License 1.2.

Log in