Computer Networks

What belongs in extra practiceOptional practice · after the papers
Topology counting · example 1Unit 1 · Networks and topology · optional practice
Topology counting · example 2Unit 1 · Networks and topology · optional practice
Topology counting · example 3Unit 1 · Networks and topology · optional practice
How a Hamming code locates a single errorUnit 3 · Errors, block coding and CRC · optional practice
Single-error correction · example 1Unit 3 · Errors, block coding and CRC · optional practice
Single-error correction · example 2Unit 3 · Errors, block coding and CRC · optional practice
Single-error correction · example 3Unit 3 · Errors, block coding and CRC · optional practice
Supporting numerical: stop-and-wait utilizationUnit 3 · Flow control and ARQ · optional practice
Window utilization · example 1Unit 3 · Flow control and ARQ · optional practice
Window utilization · example 2Unit 3 · Flow control and ARQ · optional practice
Window utilization · example 3Unit 3 · Flow control and ARQ · optional practice
Collision detection · minimum size 1CSMA, collision detection and avoidance · optional practice
Collision detection · minimum size 2CSMA, collision detection and avoidance · optional practice
Collision detection · minimum size 3CSMA, collision detection and avoidance · optional practice
Backoff · example 1CSMA, collision detection and avoidance · optional practice
Backoff · example 2CSMA, collision detection and avoidance · optional practice
Backoff · example 3CSMA, collision detection and avoidance · optional practice
Store-and-forward and pipeliningSwitching techniques · optional practice
Compare completion times · example 1Switching techniques · optional practice
Compare completion times · example 2Switching techniques · optional practice
Packet pipeline with header overheadSwitching techniques · optional practice
IPv6 packet length · example 1IPv6: addresses and packet format · optional practice
IPv6 packet length · example 2IPv6: addresses and packet format · optional practice
IPv6 packet length · example 3IPv6: addresses and packet format · optional practice
DHCP leases, renewal and a relayARP, RARP and DHCP · optional practice
DHCP timer example 1ARP, RARP and DHCP · optional practice
DHCP timer example 2ARP, RARP and DHCP · optional practice
DHCP timer example 3ARP, RARP and DHCP · optional practice
IPv4 header-length example 1IP packet details · supporting practice · optional practice
IPv4 header-length example 2IP packet details · supporting practice · optional practice
IPv4 header-length example 3IP packet details · supporting practice · optional practice
IPv4 fragmentation · optional extensionIP packet details · supporting practice · optional practice
Optional fragmentation · example 1IP packet details · supporting practice · optional practice
Optional fragmentation · example 2IP packet details · supporting practice · optional practice
Optional fragmentation · example 3IP packet details · supporting practice · optional practice
UDP length calculation · example 1Unit 5 · Process delivery, UDP, TCP and SCTP · optional practice
UDP length calculation · example 2Unit 5 · Process delivery, UDP, TCP and SCTP · optional practice
UDP length calculation · example 3Unit 5 · Process delivery, UDP, TCP and SCTP · optional practice
TCP sequence and ACK arithmetic · example 1Unit 5 · Process delivery, UDP, TCP and SCTP · optional practice
TCP sequence and ACK arithmetic · example 2Unit 5 · Process delivery, UDP, TCP and SCTP · optional practice
TCP sequence and ACK arithmetic · example 3Unit 5 · Process delivery, UDP, TCP and SCTP · optional practice
Leaky-bucket timeline · example 1Unit 5 · Congestion control and QoS · optional practice
Leaky-bucket timeline · example 2Unit 5 · Congestion control and QoS · optional practice
Leaky-bucket timeline · example 3Unit 5 · Congestion control and QoS · optional practice
Token-bucket waiting · example 1Unit 5 · Congestion control and QoS · optional practice
Token-bucket waiting · example 2Unit 5 · Congestion control and QoS · optional practice
Token-bucket waiting · example 3Unit 5 · Congestion control and QoS · optional practice
Token-bucket sustained burst · example 1Unit 5 · Congestion control and QoS · optional practice
Token-bucket sustained burst · example 2Unit 5 · Congestion control and QoS · optional practice
Token-bucket sustained burst · example 3Unit 5 · Congestion control and QoS · optional practice
Supporting HTTP timing · example 1Unit 6 · HTTP, DNS, FTP and SMTP · optional practice
Supporting HTTP timing · example 2Unit 6 · HTTP, DNS, FTP and SMTP · optional practice
Supporting HTTP timing · example 3Unit 6 · HTTP, DNS, FTP and SMTP · optional practice
Delays, units and packet pipelineExtra timing and packet-length formulas
Collision timing and backoffExtra timing and packet-length formulas
IPv6 and packet lengthsExtra timing and packet-length formulas
Block coding, Hamming distance and CRCExtra mathematical models
ARQ windows and utilizationExtra mathematical models
UDP and TCP arithmeticExtra mathematical models
Leaky queue and token bucketExtra mathematical models
Topology and HTTP timing · supporting examplesExtra mathematical models

TEE · Practice Chapter

TEE · Read

Full CN TEE reading orderStart here · CN TEE
Device, link, frame, packet and routerEssential vocabulary and maths
Bits, bytes and rate: read the units firstEssential vocabulary and maths
Delay example 1Essential vocabulary and maths
Delay example 2Essential vocabulary and maths
Delay example 3Essential vocabulary and maths
Binary place values: why the rightmost place is 1Essential vocabulary and maths
Binary to decimal · example 1Essential vocabulary and maths
Binary to decimal · example 2Essential vocabulary and maths
Binary to decimal · example 3Essential vocabulary and maths
Binary to decimal · example 4Essential vocabulary and maths
Decimal to binary · example 1Essential vocabulary and maths
Decimal to binary · example 2Essential vocabulary and maths
Decimal to binary · example 3Essential vocabulary and maths
Powers of two, percentages and the meaning of eEssential vocabulary and maths
Calculator steps for ALOHA and subnettingEssential vocabulary and maths
How to read a routing graphEssential vocabulary and maths
What a network is and how networks are classifiedUnit 1 · Networks and topology
Client-server and peer-to-peerUnit 1 · Networks and topology
Network topologies and choosing a layoutUnit 1 · Networks and topology
OSI layers and encapsulationUnit 2 · Models and transmission media
TCP/IP layers and comparison with OSIUnit 2 · Models and transmission media
Guided and unguided transmission mediaUnit 2 · Models and transmission media
Optical fiber: advantages and limitsUnit 2 · Models and transmission media
Apply wired and wireless concepts to a campusUnit 2 · Models and transmission media
Error detection, correction and block codingUnit 3 · Errors, block coding and CRC
Parity and the limits of redundancyUnit 3 · Errors, block coding and CRC
Hamming distance and guaranteed capabilityUnit 3 · Errors, block coding and CRC
Hamming-distance working · example 1Unit 3 · Errors, block coding and CRC
Hamming-distance working · example 2Unit 3 · Errors, block coding and CRC
Hamming-distance working · example 3Unit 3 · Errors, block coding and CRC
CRC: polynomial division without carriesUnit 3 · Errors, block coding and CRC
CRC worked division · example 1Unit 3 · Errors, block coding and CRC
CRC worked division · example 2Unit 3 · Errors, block coding and CRC
CRC worked division · example 3Unit 3 · Errors, block coding and CRC
CRC worked division · example 4Unit 3 · Errors, block coding and CRC
Flow control is different from error controlUnit 3 · Flow control and ARQ
Stop-and-Wait ARQ and lost ACKsUnit 3 · Flow control and ARQ
Go-Back-N with window 7: three complete casesUnit 3 · Flow control and ARQ
Selective Repeat: window bound and bufferingUnit 3 · Flow control and ARQ
Compare all three ARQ protocolsUnit 3 · Flow control and ARQ
ARQ sequence/window arithmetic · example 1Unit 3 · Flow control and ARQ
ARQ sequence/window arithmetic · example 2Unit 3 · Flow control and ARQ
ARQ sequence/window arithmetic · example 3Unit 3 · Flow control and ARQ
Pure ALOHA: transmit first, retry if necessaryALOHA: access, collisions and throughput
Why Pure ALOHA has a 2T vulnerable periodALOHA: access, collisions and throughput
Slotted ALOHA: starts only at slot boundariesALOHA: access, collisions and throughput
G, S and throughput: which number are you finding?ALOHA: access, collisions and throughput
Pure ALOHA · load example 1ALOHA: access, collisions and throughput
Pure ALOHA · load example 2ALOHA: access, collisions and throughput
Pure ALOHA · load example 3ALOHA: access, collisions and throughput
Slotted ALOHA · load example 1ALOHA: access, collisions and throughput
Slotted ALOHA · load example 2ALOHA: access, collisions and throughput
Slotted ALOHA · load example 3ALOHA: access, collisions and throughput
Frames/s to throughput · example 1ALOHA: access, collisions and throughput
Frames/s to throughput · example 2ALOHA: access, collisions and throughput
Frames/s to throughput · example 3ALOHA: access, collisions and throughput
Frames/s to throughput · example 4ALOHA: access, collisions and throughput
Frames/s to throughput · example 5ALOHA: access, collisions and throughput
Why the two maximum throughputs differALOHA: access, collisions and throughput
Carrier sensing: why listening does not remove every collisionCSMA, collision detection and avoidance
1-persistent, non-persistent and p-persistent CSMACSMA, collision detection and avoidance
CSMA/CD: detect a collision while transmittingCSMA, collision detection and avoidance
Binary exponential backoffCSMA, collision detection and avoidance
CSMA/CA: reduce collision risk before sendingCSMA, collision detection and avoidance
Hidden terminals and RTS/CTSCSMA, collision detection and avoidance
Circuit, message and packet switchingSwitching techniques
Datagram versus virtual-circuit packet switchingSwitching techniques
IPv4 addresses: four octets, one 32-bit valueIPv4: understand the address before subnetting
Classful addressing: historical default boundariesIPv4: understand the address before subnetting
Private, loopback and special IPv4 addressesIPv4: understand the address before subnetting
Subnet masks: 1 keeps a network bit; 0 marks a host bitIPv4: understand the address before subnetting
Prefix to mask · example 1IPv4: understand the address before subnetting
Prefix to mask · example 2IPv4: understand the address before subnetting
Prefix to mask · example 3IPv4: understand the address before subnetting
Prefix to mask · example 4IPv4: understand the address before subnetting
One method for every ordinary IPv4 block questionSubnetting: first address, last address and host range
Complete block · 192.168.10.77/26Subnetting: first address, last address and host range
Complete block · 200.140.64.48/26Subnetting: first address, last address and host range
Complete block · 193.20.35.40/26Subnetting: first address, last address and host range
Complete block · 192.168.1.150/27Subnetting: first address, last address and host range
Complete block · 10.4.9.55/28Subnetting: first address, last address and host range
Complete block · 172.16.35.123/20Subnetting: first address, last address and host range
Complete block · 10.20.5.130/23Subnetting: first address, last address and host range
Complete block · 192.168.2.129/25Subnetting: first address, last address and host range
Complete block · 192.0.2.6/30Subnetting: first address, last address and host range
Why /31 and /32 do not use the ordinary minus-two ruleSubnetting: first address, last address and host range
Hosts to prefix · 25 hostsSubnetting: first address, last address and host range
Hosts to prefix · 64 hostsSubnetting: first address, last address and host range
Hosts to prefix · 1000 hostsSubnetting: first address, last address and host range
Equal-size subnet design · example 1Subnetting: first address, last address and host range
Equal-size subnet design · example 2Subnetting: first address, last address and host range
Equal-size subnet design · example 3Subnetting: first address, last address and host range
CIDR and VLSM: two related but different ideasCIDR, VLSM and route matching
Complete VLSM allocation · example 1CIDR, VLSM and route matching
Complete VLSM allocation · example 2CIDR, VLSM and route matching
Complete VLSM allocation · example 3CIDR, VLSM and route matching
Route aggregation: combine only a valid aligned blockCIDR, VLSM and route matching
Exact route aggregation · example 1CIDR, VLSM and route matching
Exact route aggregation · example 2CIDR, VLSM and route matching
Exact route aggregation · example 3CIDR, VLSM and route matching
Longest-prefix match: choose the most specific matching routeCIDR, VLSM and route matching
Forwarding table · example 1CIDR, VLSM and route matching
Forwarding table · example 2CIDR, VLSM and route matching
Forwarding table · example 3CIDR, VLSM and route matching
IPv6: eight hexadecimal groupsIPv6: addresses and packet format
Expand :: by counting visible groupsIPv6: addresses and packet format
Expand IPv6 · example 1IPv6: addresses and packet format
Expand IPv6 · example 2IPv6: addresses and packet format
Expand IPv6 · example 3IPv6: addresses and packet format
Expand IPv6 · example 4IPv6: addresses and packet format
Write the shortest standard IPv6 representationIPv6: addresses and packet format
Compress IPv6 · example 1IPv6: addresses and packet format
Compress IPv6 · example 2IPv6: addresses and packet format
Compress IPv6 · example 3IPv6: addresses and packet format
IPv6 base header: every field and its purposeIPv6: addresses and packet format
IPv4 versus IPv6 headers and address typesIPv6: addresses and packet format
ARP: find the local next-hop MAC addressARP, RARP and DHCP
ARP decision · example 1ARP, RARP and DHCP
ARP decision · example 2ARP, RARP and DHCP
ARP decision · example 3ARP, RARP and DHCP
RARP: the reverse historical mappingARP, RARP and DHCP
DHCP: automatic configuration through DORAARP, RARP and DHCP
Routing, forwarding, distance and next hopRouting: build the shortest path one step at a time
Relaxation: replace an old route only when the candidate is cheaperRouting: build the shortest path one step at a time
One edge relaxation · example 1Routing: build the shortest path one step at a time
One edge relaxation · example 2Routing: build the shortest path one step at a time
One edge relaxation · example 3Routing: build the shortest path one step at a time
Dijkstra: settle the closest unfinished vertexRouting: build the shortest path one step at a time
Dijkstra · complete example 1Routing: build the shortest path one step at a time
Dijkstra · complete example 2Routing: build the shortest path one step at a time
Dijkstra · complete example 3Routing: build the shortest path one step at a time
Bellman–Ford: repeat relaxation across all edgesRouting: build the shortest path one step at a time
Bellman–Ford · complete example 1Routing: build the shortest path one step at a time
Bellman–Ford · complete example 2Routing: build the shortest path one step at a time
Bellman–Ford · negative-cycle exampleRouting: build the shortest path one step at a time
Distance-vector routing: learn costs through neighboursDistance vector, RIP, link state and OSPF
Distance-vector update · example 1Distance vector, RIP, link state and OSPF
Distance-vector update · example 2Distance vector, RIP, link state and OSPF
Distance-vector update · example 3Distance vector, RIP, link state and OSPF
RIP: hop counts, updates and the value 16Distance vector, RIP, link state and OSPF
Count-to-infinity and loop-mitigation methodsDistance vector, RIP, link state and OSPF
Link-state routing: share a map, calculate locallyDistance vector, RIP, link state and OSPF
OSPF: link-state shortest paths within an autonomous systemDistance vector, RIP, link state and OSPF
The five OSPF packet typesDistance vector, RIP, link state and OSPF
RIP versus OSPF; Bellman–Ford versus DijkstraDistance vector, RIP, link state and OSPF
IPv4 header fields needed for the IPv6 comparisonIP packet details · supporting practice
Process-to-process communication, ports and socketsUnit 5 · Process delivery, UDP, TCP and SCTP
UDP services, operation and headerUnit 5 · Process delivery, UDP, TCP and SCTP
TCP features and segment structureUnit 5 · Process delivery, UDP, TCP and SCTP
TCP connection, data and terminationUnit 5 · Process delivery, UDP, TCP and SCTP
UDP versus TCP versus SCTPUnit 5 · Process delivery, UDP, TCP and SCTP
SCTP association, chunks and multiple streamsUnit 5 · Process delivery, UDP, TCP and SCTP
Open-loop and closed-loop congestion controlUnit 5 · Congestion control and QoS
TCP congestion window and classic control phasesUnit 5 · Congestion control and QoS
QoS metrics and improving techniquesUnit 5 · Congestion control and QoS
Leaky-bucket operation and tradeoffsUnit 5 · Congestion control and QoS
Token-bucket operation and limitationsUnit 5 · Congestion control and QoS
Leaky bucket versus token bucketUnit 5 · Congestion control and QoS
WWW and the complete HTTP request journeyUnit 6 · HTTP, DNS, FTP and SMTP
HTTP methods, status, persistence and HTTPSUnit 6 · HTTP, DNS, FTP and SMTP
DNS hierarchy, delegation and uniquenessUnit 6 · HTTP, DNS, FTP and SMTP
DNS records, recursive/iterative queries and cachingUnit 6 · HTTP, DNS, FTP and SMTP
FTP control/data connections and active/passive modesUnit 6 · HTTP, DNS, FTP and SMTP
SMTP phases, commands and email flowUnit 6 · HTTP, DNS, FTP and SMTP
Compare the four application protocolsUnit 6 · HTTP, DNS, FTP and SMTP

TEE · Read Chapter

TEE · Revision

One final pass through all six unitsTEE last-day revision
Units 1–2: five-mark answer framesTEE last-day revision
Unit 3: error and access trapsTEE last-day revision
Unit 4: numerical method checklistTEE last-day revision
Unit 5: distinguish the quantitiesTEE last-day revision
Unit 6: redraw four message flowsTEE last-day revision

TEE · Revision Chapter

TEE last-day revision