|
Date |
Topic
|
Suggested Reading
|
|
|
|
|
Aug 25 |
Overview,
Course
Syllabus
|
-
|
|
Aug 31 |
Error Detection, Media Access Control
|
Stone and Patridge,
When the CRC and TCP Checksum Disagree,
ACM SIGCOMM, 2000.
|
|
Sep 2 |
Media Access Control
|
Gollakota and Katabi,
ZigZag Decoding: Combatting Hidden
Terminals in Wireless Networks,
ACM SIGCOMM, 2008.
|
|
Sep 7 |
No Class (Labor Day)
|
-
|
|
Sep 9 |
Packet
Switching,
Internetworking
|
Al-Fares et. al.,
A Scalable, Commodity Data Center Network
Architecture,
ACM SIGCOMM, 2008.
Luckie et. al., Inferring and Debugging Path
MTU Discovery Failures, IMC 2005.
|
|
Sep 14 |
IP
Addressing
|
Padmanabhan et. al., An Investigation of
Geographic Mapping Techniques for Internet Hosts, ACM SIGCOMM,
2001.
|
|
Sep 16 |
Distance
Vector Routing
|
-
|
|
Sep 21 |
Link
State Routing
|
-
|
|
Sep 23 |
BGP
|
Labovitz et. al.,
Delayed Internet
Routing Convergence,
ACM SIGCOMM, 2000.
Mahajan et. al.,
Understanding BGP
Misconfiguration,
ACM SIGCOMM, 2002.
Spring et. al.,
Quantifying the Causes of
Path Inflation,
ACM SIGCOMM, 2003.
|
|
Sep 28 |
Transport Protocols
|
Saltzer et. al.,
End-to-end Arguments in System
Design,
ACM Transactions on Computer Systems, 1984.
|
|
Sep 30 |
Sliding Window
|
-
|
|
Oct 5 |
Adaptive Timeouts
|
P. Karn and C. Partridge,
Improving Round-trip Time Estimates in
Reliable Transport Protocols,
ACM SIGCOMM, 1987.
|
|
Oct 7 |
Congestion Control
|
V. Jacobson and M. Karels,
Congestion Avoidance and Control,
ACM SIGCOMM, 1988
Blanton et. al., A Conservative
SACK-based Loss Recovery Algorithm for TCP, RFC 3517.
|
|
Oct 12 |
No Class (University Day)
|
-
|
|
Oct 14 |
Congestion Control,
Congestion Avoidance
|
T. Kelly, Scalable TCP: Improving
Performance in Highspeed Wide Area Networks.
S. Floyd, HighSpeed TCP for Large
Congestion Windows, Internet Draft, Aug 2003.
Floyd and Jacobson, Random Early Detection
gateways for Congestion Avoidance, IEEE/ACM Trans. on Networking,
Aug 1993.
|
|
Oct 19 |
Congestion Avoidance
|
Brakmo et. al., TCP Vegas: New Techniques
for Congestion Detection and Avoidance, ACM SIGCOMM 1994.
|
|
Oct 21 |
Mid-term Exam
|
-
|
|
Oct 26 |
Virtualization
|
Savage et. al., Detour: Informed
Internet Routing and Transport, IEEE Micro 1999.
Andersen et. al., Resilient Overlay
Networks, ACM SOSP 2001.
|
|
Oct 28 |
Indirection
|
Stoica et. al.,
Internet Indirection
Infrastructure, ACM SIGCOMM 2002.
|
|
Nov 2 |
DNS
|
-
|
|
Nov 4 |
DNS Caching
|
Jung et. al.,
DNS Performance and the Effectiveness of Caching
, ACM SIGCOMM IMW 2001.
|
|
Nov 9 |
Peer-to-peer Lookup Systems
|
Chawathe et. al.,
Making Gnutella-like P2P Systems Scalable, ACM SIGCOMM 2003.
Lv et. al., Search and
Replication in Unstructured Peer-to-Peer Networks, Supercomputing
2002.
|
|
Nov 11 |
DHTs -- Chord
|
Stoica et. al.,
Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet
Applications, Transactions on Networking, 2003
|
|
Nov 16 |
DHTs -- Pastry
|
Rowstron and Druschel, Pastry: Scalable, distributed object
location and routing for large-scale peer-to-peer systems,
Distributed Systems Platforms (Middleware), 2001.
|
|
Nov 18 |
P2P Content Distribution --- Bittorrent
|
Cohen, Incentives Build
Robustness in BitTorrent.
Piatek etl. al., Do Incentives Build
Robustness in BitTorrent?, NSDI 2007.
Levin etl. al., Bittorrent is
an auction: Analyzing and Improving BitTorrent's Incentives,
ACM SIGCOMM 2008.
|
|
Nov 23 |
Content Distribution Networks --- Akamai
|
Dilley, et. al., Globally Distributed Content
Delivery, IEEE Internet Comuting 2002.
Su, et. al., Drafting Behind Akamai
(Travelocity-Based Detouring), ACM SIGCOMM 2006.
|
|
Nov 25 |
No Class (Thanksgiving)
|
-
|
|
Nov 30 |
Distributed File Systems
|
Baker, et. al., Measurements of a Distributed File
System, ACM SOSP 1991.
Leung, et. al., Measurement and Analysis of
Large-Scale Network File System Workloads, 2008 USENIX Conference.
|
|
Dec 2 |
Case Study: Andrew
|
Howard, et al., Scale and Performance in a Distributed
File System, ACM TOCS 1988.
|
|
Dec 7 |
Case Study: Google
|
Ghemawat, et. al., The Google File System,
ACM SOSP 2003.
|
|
Dec 9 |
-
|
-
|