Mathematical and Algorithmic Foundations of the Internet

This book introduces the concepts and methods upon which computer networks rely and explores their applications to the Internet and Web. Accessible to readers with an elementary mathematical background, it illustrates mathematical and algorithmic concepts with examples from various fields, including literature, history, and art. The authors provide in-depth coverage of the mathematical prerequisites and assemble a complete presentation of how computer networks function. They cover computational complexity and randomness, networks and graphs, parallel and distributed computing, and search engines.

To truly understand how the Internet and Web are organized and function requires knowledge of mathematics and computation theory. Mathematical and Algorithmic Foundations of the Internet introduces the concepts and methods upon which computer networks rely and explores their applications to the Internet and Web. The book offers a unique approach to mathematical and algorithmic concepts, demonstrating their universality by presenting ideas and examples from various fields, including literature, history, and art.

Progressing from fundamental concepts to more specific topics and applications, the text covers computational complexity and randomness, networks and graphs, parallel and distributed computing, and search engines. While the mathematical treatment is rigorous, it is presented at a level that can be grasped by readers with an elementary mathematical background. The authors also present a lighter side to this complex subject by illustrating how many of the mathematical concepts have counterparts in everyday life.

The book provides in-depth coverage of the mathematical prerequisites and assembles a complete presentation of how computer networks function. It is a useful resource for anyone interested in the inner functioning, design, and organization of the Internet.