Chapter 1 is a whole course in miniature: what the Internet is made of, how well it performs, how it is organised, and why it is not secure.
What this page is for
Not new material. This page does three things:
- Recaps the chapter’s argument in the order the book made it.
- Maps every idea to the section that taught it, so you can go back to any one directly.
- Tests you once per section, in the quiz at the bottom.
If a question here is uncomfortable, follow the link and reread that section. That is what the map is for.
Why this matters
The book calls this chapter a mini-course in computer networking, and means it. Every later chapter is a magnified view of one box on the map below.
If you leave chapter 1 with a developing intuition for the pieces, a developing command of the vocabulary, and a wish to know more, it has done its job.
The map
Hover an idea to see what it connects to. Click one to go back to the section that taught it.
Three clusters: what the Internet is made of, how well it performs, and how it is organised. Security sits outside all three, which is exactly the problem chapter 8 inherits.
Read this map as a list
- the Internet (§1.1) — connects to hosts, protocol
- hosts (§1.2) — connects to the Internet, access networks
- access networks (§1.2.1) — connects to hosts, physical media, bottleneck link
- physical media (§1.2.2) — connects to access networks
- protocol (§1.1) — connects to the Internet, five layers
- four delays (§1.4.1) — connects to queuing · La/R, end-to-end delay, store-and-forward
- queuing · La/R (§1.4.2) — connects to four delays, packet loss, store-and-forward
- packet loss (§1.4.2) — connects to queuing · La/R, attacks
- end-to-end delay (§1.4.3) — connects to four delays, throughput
- throughput (§1.4.4) — connects to end-to-end delay, bottleneck link
- bottleneck link (§1.4.4) — connects to access networks, throughput
- packet switching (§1.3.1) — connects to circuit switching, store-and-forward, forwarding table
- circuit switching (§1.3.2) — connects to packet switching
- store-and-forward (§1.3.1) — connects to packet switching, four delays, queuing · La/R
- forwarding table (§1.3.1) — connects to packet switching, network of networks, five layers
- network of networks (§1.3.3) — connects to forwarding table
- five layers (§1.5) — connects to encapsulation, protocol, forwarding table
- encapsulation (§1.5) — connects to five layers
- how it got here (§1.7) — connects to built for trust
- attacks (§1.6) — connects to built for trust, packet loss
- built for trust (§1.6) — connects to how it got here, attacks
The recap
What the Internet is made of
The chapter opened by answering what is the Internet? twice — as hardware and software, and as a service for distributed applications. Both answers are needed, and the second is why the book is organised top-down.
Then it worked inward. At the network edge are the hosts host Simple Any device connected to the Internet that runs your programs: a laptop, a phone, a server. Precise A device connected to the Internet that runs (hosts) application programs. Also called an end system, because it sits at the edge of the network; the book uses host = end system. introduced in ch. 1 — open in glossary that run the applications. Reaching them are access networks — DSL (Digital Subscriber Line) Digital Subscriber Line Home Internet access over the existing telephone wire. introduced in ch. 1 , cable, fibre to the home, 5G fixed wireless, Ethernet and WiFi (IEEE 802.11 wireless LAN) IEEE 802.11 wireless LAN Wireless LAN access; a user must be within a few tens of metres of the access point. WiFi is a trade name, not an abbreviation. introduced in ch. 1 — and beneath those, the physical media that actually carry the bits.
The thing to carry forward
The recurring question in §1.2 was who shares what:
- DSL gives you a private wire;
- cable shares one coaxial segment with up to 5,000 homes;
- a PON (Passive Optical Network) Passive Optical Network An FTTH distribution architecture using a passive neighbourhood splitter shared by up to about 100 homes. introduced in ch. 1 shares a fibre with fewer than 100;
- WiFi shares the air with everyone in range.
That question — is this medium shared, and with how many? — comes back in chapter 6, which is largely about the rules for taking turns on a shared medium.
How data actually moves
At the network core the book set out the chapter’s sharpest contrast.
Packet switching packet switching Simple Sending data as separate packets that share links with everyone else's packets, on demand. Precise The approach in which a source breaks a long message into packets that travel through links and packet switches without reserving any link resources. Link capacity is allocated on demand, packet by packet, only among users who have packets to send. introduced in ch. 1 — open in glossary sends packets with no reservation, and shares each link on demand. Circuit switching reserves a share of every link in advance, using FDM (Frequency-Division Multiplexing) Frequency-Division Multiplexing Gives each connection its own frequency band on the link, all of the time. introduced in ch. 1 or TDM (Time-Division Multiplexing) Time-Division Multiplexing Gives each connection the whole link, but only during its own repeating time slot. introduced in ch. 1 , and guarantees a constant rate. Packet switching won because user traffic is bursty: a link that supports 10 reserved users supports 35 on-demand users at essentially the same quality.
The price is that packets wait. Store-and-forward means every switch receives a whole packet before sending any of it, so one packet over links costs — the chapter’s first equation.
How well it performs
The second half of the chapter stopped describing and started measuring.
Four delays at every node — processing, queuing, transmission, propagation — add up to the nodal delay nodal delay Simple The total time a packet spends at one router. Precise d_nodal = d_proc + d_queue + d_trans + d_prop: the sum of the four delay components suffered at a single node. introduced in ch. 1 — open in glossary and accumulate into the end-to-end delay. The pair that must never be confused is , which depends on packet length and link rate, and , which depends on distance.
Queuing delay is the only one that varies from packet to packet. It is governed by the traffic intensity , which explodes as it approaches 1. Real buffers are finite, so instead of infinite delay you get packet loss — silently, with nothing reported to the sender.
Throughput throughput Simple How many bits per second actually arrive at the receiver. Precise The rate, in bits/second, at which the receiving host receives data. Instantaneous throughput is that rate at an instant; the average throughput of a transfer of F bits taking T seconds is F/T. With no competing traffic it is min{R₁, …, R_N}. introduced in ch. 1 — open in glossary is set by the bottleneck link: of the rates along the path. In today’s Internet that is usually the access network, because the core is over-provisioned. The exception is a core link shared by many flows, where what matters is rather than .
How it is organised
Two organising ideas, and they are the ones later chapters lean on hardest.
The Internet is a network of networks network of networks Simple The Internet is not one network but many separate networks joined together. Precise The structure of today's Internet: hundreds of thousands of access ISPs interconnected through regional ISPs and about a dozen tier-1 ISPs, together with PoPs, multi-homing, peering, IXPs and content-provider networks. introduced in ch. 1 — open in glossary : hundreds of thousands of independently managed ISPs, arranged in a hierarchy that economics built. Access ISPs pay regional ISPs, regional ISPs pay tier-1 ISPs, and tier-1 ISPs pay nobody. Wherever two networks can avoid paying a third, they connect directly.
The Internet has five layers, and each wraps what it is handed in its own header.
The book uses a different word at each layer, and it is never careless about which. Neither is this site.
| Layer | Call it a… | Looks like | Its header says |
|---|---|---|---|
| application | message | What the application actually wants to send. | |
| transport | segment | Which program on the far host, plus error-detection bits. | |
| network | datagram | The addresses of the two hosts. | |
| link | frame | How to cross this one link — and it changes at every hop. |
M is the application's message. Ht, Hn and Hl are the transport, network and link headers. Each layer treats everything handed down to it as one opaque payload and puts its own header in front.
And what goes wrong
Malware, botnets, three kinds of denial-of-service attack, passive sniffing and address spoofing — and behind all of them one architectural fact. The Internet was designed for a group of mutually trusting users attached to a transparent network, a model in which security is unnecessary. That assumption no longer holds, and chapter 8 is the repair job.
The road ahead
The book’s remaining chapters are organised around the layers, taken top-down.
Why top-down
The book starts at the application layer because you already have intuition there. You have used the Web and e-mail. Once you understand what those applications need, you can see what the transport layer must offer. Once you know that, you can see what the network layer must do to support it.
Working the other way — physical layer first — means learning several layers of machinery before you know what any of it is for.
Check yourself
Chapter 1 recap — one question per section
0 of 10 answered1.§1.1 — A protocol defines the format and order of messages. What else?
2.§1.2 — Which access technology is a shared broadcast medium?
3.§1.2.2 — Why is optical fibre the preferred long-haul medium?
4.§1.3 — Why can packet switching support 35 users on a link that circuit switching supports only 10 on?
5.§1.3.3 — What makes an ISP tier-1?
6.§1.4 — You double the packet length. Which delay component doubles?
7.§1.4.4 — Your transfer runs at 1 Mbps over a path whose links are 2, 1 and 8 Mbps. You upgrade the 2 Mbps link to 10. What happens?
8.§1.5 — Which header is discarded and rebuilt at every hop?
9.§1.6 — Why is a packet sniffer so hard to detect?
10.§1.7 — Why could the ARPAnet switch to TCP/IP on a single day in 1983, when nothing like that is possible now?
The chapter in three lines
- The Internet is hosts joined by links and packet switches, and everything between two hosts is governed by a protocol protocol Simple An agreed set of rules for what messages to send, in what order, and what to do with them. Precise A protocol defines the format and the order of messages exchanged between two or more communicating entities, as well as the actions taken on the transmission and/or receipt of a message or other event. introduced in ch. 1 — open in glossary .
- Packet switching allocates on demand; circuit switching reserves in advance. Bursty traffic is why the first one won.
- Five layers, four packet names, one header per layer. The link header is rebuilt at every hop.