Week 1: Introduction and protocols

• Mon Apr 2: Networking, cloud computing, and course overview
  • Slides
• Wed Apr 4: Introduction to protocols, layering, framing and parsing
  • Slides
  • Reading due: Donahoo and Calvert, Chapters 1 and 5
• Fri Apr 6: In-class project: Framing and parsing
  • Slides
  • Bring your laptop (if you have one)
  • Reading due: The most expensive one-byte mistake, Poul-Henning Kamp, Comm. of the ACM, Vol 54, Issue 9, 2011.

Week 2: Basic network programming (client-side)

• Mon Apr 9: IP addressing, naming, and DNS
  • Slides
  • No in-class lecture: Required video lecture instead (YouTube)
  • Reading due: Donahoo and Calvert, Chapter 3
• Wed Apr 11: Client-side programming
  • Slides
  • In-class demo files
  • Reading due: Donahoo and Calvert, Chapter 2
• Fri Apr 13: Server-side programming
  • Slides

Week 3: Basic network programming (server-side)

• Mon Apr 16: HTTP and the Web
  • Slides
• Wed Apr 18: Options, signals, timeouts, and concurrency
  • Reading due: Donahoo and Calvert, Chapters 6 and 7
  • Slides
• Fri Apr 20: Research Paper
  • Research paper due: “Polaris: Faster page loads using fine-grained dependency tracking”
  • Reading due: Donahoo and Calvert, Chapter 8
  • Homework 1 due, 5pm

Week 4: Storage and remote procedure calls (RPCs)

• Mon Apr 23: Networked storage
  • Slides
• Wed Apr 25: RPCs
  • Slides
• Fri Apr 27: RPCs (con’t)

Week 5: RPCs and time

• Mon Apr 30: In-class project: gRPC
  • Reading due: https://grpc.io
  • Bring your laptop (if you have one)
  • In-class ATM demo file
• Wed May 2: Time synchronization, Cristian’s algorithm, Berkeley algorithm, NTP
  • Slides
  • Project 1 due, 5pm
  • Reading: Sec 6.2
• Fri May 4: Lamport clocks, totally ordered multicast, vector clocks, and causation
  • Slides

Week 6: Reasoning about time and causality, Two-phase commit, and consensus

• Mon May 7: Primary-backup replication, “split brain” operation
  • Slides
  • Reading: Sec 7.5
• Wed May 9: VMWare replication
  • Reading due: Daniel J. Scales, Mike Nelson, and Ganesh Venkitachalam. 2010. The design of a practical system for fault-tolerant virtual machines. SIGOPS Oper. Syst. Rev. 44, 4 (December 2010), 30-39.
  • Pre-reading quiz
  • Slides
  • Homework 2 due, 5pm
• Fri May 11: Two-phase commit; Introduction to consensus
  • Slides

Week 7: Consensus and distributed transactions

• Mon May 14: Introduction to consensus
  • Slides
• Wed May 16: Replicated state machines and concurrency control
  • Slides
• Fri May 18: Transactions, isolation, locking, and recovery
  • Slides

Week 8: Distributing data

• Mon May 21: Performance at scale
  • Reading due: Dean and Barroso, “The Tail at Scale” Link to PDF
  • Slides
• Wed May 23: Raft review; Quantifying performance at scale
  • Reading due: In Search of an Understandable Consensus Algorithm
• Fri May 25: Peer-to-peer networks and DHTs
  • Slides
  • Reading: T & VS, Sec. 2.3 (Decentralized architectures) and Sec. 5.2 (Distributed hash tables)

Week 9: Overlay, peer-to-peer, and secure networks

• Mon May 28: Memorial Day (no class)
• Wed May 30: Content distribution networks (CDNs)
  • Slides
• Fri Jun 1: Overlay networks

Week 10: “Scaling out data”

• Mon Jun 4: Datacenters
  • Reading due: Barroso, Clidaras, and Hölzle, Chapters 1-5
  • Slides
• Wed Jun 6: Datacenters (con’t)
• Fri Jun 8: Datacenters (con’t); review
  • Required reading: “Scale-out networking in the datacenter” paper
  • Project 2 due, 5pm
  • Slides

Final exam:

• Thu Jun 14: Final exam (Location TBD)