CSc 525 -- Principles of Computer Networking, Fall 2008

Lecture Schedule and Reading Assigments

This is a tentative schedule, subject to change.

Slides can be accessed from CS department machines only. If you're outside of the department, log in to Lectura and copy files from /cs/www/classes/cs525/fall08/slides.

Week One

8/25 Introduction, class logistics, review. [slides]
8/27 Dynamic routing and packet switching [slides]

Paper:

  • "On Distributed Communications Networks" by Paul Baran, IEEE Transactions on Communications, 1964.

    Week Two

    9/1 Labor Day, No Class
    9/3 Design philosophy and the End-to-End argument [slides]

    Paper:

  • The Design Philosophy of the DARPA Internet Protocols by Dave Clark, SIGCOMM 1988
  • End-to-end Arguments in System Design by J. Saltzer, D. Reed, and D. Clark, TOCS, 1984

    Week Three

    9/8 Intra-domain Routing: RIP [slides]
    9/10 Intra-domain Routing: OSPF [slides]

    Paper:

  • A Path-Finding Algorithm for Loop-Free Routing by J.J. Garcia-Luna-Aceves and S. Murthy, ToN 1997
  • For your reference, not required reading: RIP and RFC 2453
  • A Revised ARPANET Routing Metric by A. Khanna and J. Zinky, SIGCOMM 1989
  • For your reference, not required reading: OSPF and RFC 2328,

    Week Four

    9/15 Synchronization of Routing Messages [slides]
    9/17 Inter-domain Routing: BGP [slides]

    Paper:

  • The Synchronization of Periodic Routing Messages by Sally Floyd and Van Jacobson, SIGCOMM 1993
  • Delayed Internet Routing Convergence by Craig Labovitz et al., SIGCOMM 2000
  • For your reference, not required reading: BGP4 and RFC 1771

    Week Five

    9/22 BGP Route Flap Damping [slides]
    9/24 Internet Topology [slides]

    Paper:

  • Route Flap Damping Exacerbates Internet Routing Convergence by Morley Mao et al., SIGCOMM 2002
  • Timer Interaction in Route Flap Damping by Beichuan Zhang et al., ICDCS 2005
  • Power-Laws and the AS-level Internet Topology by Michalis Faloutsos et al., ToN, 2003
  • Emergence of Scaling in Random Networks by Albert-Laszlo Barabasi et al., Science, 1999

    Week Six

    9/29 Routing Policy and AS Relationships [slides]
    10/1 Routing Security and Prefix Hijacking [slides]

    Paper:

  • On Inferring Autonomous System Relationships in the Internet by Lixin Gao, ToN 2001
  • A study of prefix hijacking and interception in the internet by Hitesh Ballani et al., SIGCOMM 2007

    Week Seven

    10/6 Multicast: IGMP, DVMRP, MOSPF [slides]
    10/8 Multicast: CBT, PIM [slides]

    Paper:

  • Multicast Routing in Datagram Internetworks and Extended LANs by Steve Deering and David Cheriton, TCS 1990
  • Core Based Trees (CBT) by Tony Ballardie et al., SIGCOMM 1993

    Week Eight

    10/13 No Class
    10/15 First Exam

    Week Nine

    10/20 TCP congestion control [slides]
    10/22 XCP [slides]
    Paper:
  • Congestion Avoidance and Control by Van Jacobson, SIGCOMM 1988
  • Optional: Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks by D. Chiu and R. Jain, Computer Systems and ISDN Systems, 1989
  • Congestion Control for High Bandwidth-Delay Product Networks, by Dina Katabi et al., SIGCOMM 2002

    Week Ten

    10/27 Core-Stateless Fair Queuing [slides]
    10/29 Domain Name System (DNS) [slides]

    Paper:

  • Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High-Speed Networks, by Ion Stoica et al., ToN, 2003
  • Development of the Domain Name System, by P. Mockapetris and K. Dunlap, SIGCOMM 1988
  • Impact of Configuration Errors on DNS Robustness, by V. Pappas et al., SIGCOMM 2004

    Week Eleven

    11/3 Resilient Overlay Networks [slides]
    11/5 Application Layer Multicast [slides]

    Paper:

  • Resilient Overlay Networks, by D. Andersen et al., SOSP 2001
  • A Case for End System Multicast, by Y. Chu et al., SIGMETRICS 2000

    Week Twelve

    11/10 Distributed Hash Table (DHT) [slides]
    11/12 No Class

    Paper:

  • Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications, by Ion Stoica et al., ToN

    Week Thirteen

    11/17 Bittorrent [slides]
    11/19 DDoS [slides]

    Paper:

  • Clustering and Sharing Incentives in BitTorrent Systems, by Arnaud Legout et al., ToN
  • To Filter or to Authorize: Network-Layer DoS Defense Against Multimillion-node Botnets, by Xin Liu et al., SIGCOMM'08

    Week Fourteen

    11/24 Botnets [slides]
    11/26 Power-aware Routing [slides]

    Paper:

  • A Multifaceted Approach to Understanding the Botnet Phenomenon, by Rajab et al., IMC'06
  • Greening of the Internet, by Gupta et al. SIGCOMM'03
  • Reducing Network Energy Consumption via Sleeping and Rate-Adaptation, by Nedevschi et al., NSDI'08

    Week Fourteen

    12/1 IP addresses: v4, v6, and NAT [slides]
    12/3 Routing scalability

    Paper:

  • Peer-to-Peer Communication Across Network Address Translators, by B. Ford et al., USENIX 2005
  • Report from the IAB Workshop on Routing and Addressing, by D. Meyer et al.
  • optional reading: Tussle in Cyberspace: Defining Tomorrow's Internet, by Dave Clark et al., SIGCOMM 2002

    Week Sixteen

    12/8 Second Exam
    12/10 No class