Index / 001 EN

Computer Science

Computer Science

An Introduction to Computer Networks

Peter L. Dordal

A free networking textbook connecting packets, protocols, routing and transport with the reasons the Internet behaves as it does.

Prerequisites: Introductory programming, basic computer organization and willingness to follow protocol diagrams. Elementary probability and algebra help with performance discussions; advanced mathematics is not the starting requirement.

Difficulty Level
Intermediate
Academic Level
Undergraduate
computer networksTCP/IProuting

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 taking a first substantial networks course who want more than a glossary of protocol names. The book provides a broad free text with diagrams, exercises and selected simulation material. Its emphasis on mechanisms is useful when a reader needs to explain a packet trace or a congestion effect rather than memorize a layer diagram.

Prerequisites

Introductory programming, basic computer organization and willingness to follow protocol diagrams. Elementary probability and algebra help with performance discussions; advanced mathematics is not the starting requirement.

What it covers

Local networks, internetworking, routing and transport support discussions of congestion and related network topics. The organization makes connections between a protocol’s rules and its performance. Historical mechanisms can serve as contrasts, but readers should distinguish them from the behaviour of a current deployed system.

How to use it

Trace a small exchange packet by packet and record what each endpoint knows at every step. Introduce a loss or delay and predict the response before looking at a simulator. Compare throughput with raw link rate and identify the bottleneck assumption. Keep a drawing of state transitions alongside a sequence diagram, and explain how a rule prevents or recovers from a specific failure.

Edition and sources

The author site provides the complete second edition in several free formats. The second edition began in 2020; the web preface records later minor revisions. No commercial German-edition ISBN is assigned to this English online text; its own licence and redistribution terms apply.

Open the official resource

Selected edition, access and a first output

The author’s second-edition site currently identifies revision 2.0.11; the main page dates the start of the second-edition family to July 2020. Keep that edition identity separate from later web revisions. The preface states CC BY-NC-ND with additional author permissions, so free reading is not blanket permission to translate or redistribute adaptations. For a first output, label bit rate, frame size and propagation time separately before predicting an exchange; advanced protocols cannot repair a unit error.