Index / 001 EN

Computer Science

Computer Science

Computer Networking: Principles, Protocols and Practice

Olivier Bonaventure

A complete open networking textbook connecting application behavior, transport, routing and link-layer mechanisms with protocol reasoning.

Prerequisites: Basic programming, binary representation and introductory computer systems are helpful. Review graphs, elementary probability and the difference between a process, an address and a communication endpoint before packet-level exercises.

Difficulty Level
Intermediate
Academic Level
Undergraduate
network protocolsTCP IPnetwork architecture

01 / Reading Guide

Reading Guide

Computer networks: choose a text and account for every delay

Compare three networking routes, then solve original transmission and window examples that separate payload rate, serialization, propagation and assumptions.

Study route and exercise: University Reading List editorial project.

Who this book is for

For undergraduate students studying computer networks after an initial computing course. The book connects layered abstractions with the behavior of actual protocols, making it useful for readers who can run applications but want to explain the messages and assumptions beneath them. Exercises support reasoning rather than memorizing acronym lists.

Prerequisites

Basic programming, binary representation and introductory computer systems are helpful. Review graphs, elementary probability and the difference between a process, an address and a communication endpoint before packet-level exercises.

What it covers

Application-level communication, reliable transport, congestion, addressing, forwarding and routing lead into local network and link mechanisms. The third edition includes an interactive online form and source material for building the book. The learning route emphasizes what each layer promises and the conditions needed to satisfy those promises.

How to use it

Draw a small exchange and annotate every message with sender, receiver, purpose and relevant state. Introduce one lost packet or delayed response and predict the resulting protocol behavior. Compare the prediction with a controlled classroom trace. Separate a routing decision from a forwarding step, and distinguish reliability from ordering and congestion control. When reproducing an experiment, record the network assumptions and implementation version so that a different result can be explained rather than dismissed.

Edition and sources

The complete university-hosted PDF contains 418 pages, labels itself Release 2021 and is built May 15, 2024. Its preface credits Bonaventure and De Coninck as principal third-edition contributors and grants CC BY 3.0. The source repository states CC BY-SA 3.0; follow the notice of the actual format used.

Open the official resource

Selected edition, access and a first output

The selected university PDF is the fixed Release 2021 snapshot built on 15 May 2024, not an assertion that the evolving repository has stopped changing. Its front matter verifies 418 pages and a CC BY 3.0 notice; follow the terms of the actual format used. Begin by drawing sender/receiver state and marking when a full frame and acknowledgment have arrived. A timed paper trace requires only algebra and clear units; experiments or implementation claims need separately stated versions and conditions.