USC CSD Home
 

-

 
General Information
Time   :   MW 12:30pm - 1:50pm
Location : OHE 136
Instructor   :   Bill Cheng, Office Hours: TuTh 11:00am - 12:00pm and Fri 12:00pm - 1:00pm, in SAL 228, E-mail: <bill.cheng@usc.edu> or <william@bourbon.usc.edu>   (Please do not send HTML-only e-mails. They will not be read.)
TA   :   Leslie Cheung, E-mail: <lccheung@usc.edu>, Office Hours: MW 2pm - 3pm in SAL 211
Grader   :   Amy Satornsantikul, E-mail: <satornsa@usc.edu>, (The grader will hold office hours the week after the announcement of each project assignment's grades.)
Midterm Exam   :   during class time in GFS 106, Wed, 10/22/2008 (firm) (GFS is located in section C5 of the campus map)
Final Exam   :   11am-1pm, Fri, 12/12/2008 in GFS 106, (firm)  (GFS is located in section C5 of the campus map)
Msg Archives   :   messages from Bill, messages from Leslie, messages from Amy
 
Class Resources
Description   :   textbooks, topics covered, grading policies, additional resources, etc.
Papers   :   required and recommanded technical papers.
Lectures   :   slides from lectures in HTML, PostScript, and PDF formats.
Homeworks   :   (2-4 homeworks will be assigned.)
Projects   :   (please also see important information about the class projects below.)
Moodle   :   social forum can be used for students-to-students discussions about assignments.
 
News
(in reversed chronological order)
  • 12/5/2008: The final exam will be closed book, closed notes, and closed everything (and no "cheat sheet"). Also, no calculators, cell phones, or any electronic gadgets are allowed. Please bring a photo ID. Your ID will be collected at the beginning of the exam and will be returned to you when you turn in your exam. There will be assigned seating.

    The final exam will cover everything after the midterm exam (starting at slide 1 of lecture 16 on 10/20/2008) to the last slide of the lecture on 12/3/2008. For the DEC-bit paper [Ramakrishnan90a], you will only be responsible for the queue management (DEC-bit) part of it.

    Here is a quick summary of the topics covered (not all topics covered are listed):

    • TCP
      • TCP Security and performance issues
        • SYN floods
        • SMURF attacks
        • high bandwidth-delay networks
    • Queue management
      • Fair queueing & weighted fair queueing [Demers89a]
        • arrival time
        • start time
        • finish time
      • DEC-bit [Ramakrishnan90a]
        • queue length
        • fairness
        • power
        • efficiency
      • RED [Floyd93a]
        • random drop
        • threasholds
      • TCP throughput [Padhye98a]
        • bandwidth relationship with loss probabilities, segment size, and RTT
        • triple-dupack period
        • timeouts and limited advertised receiver window size
      • TCP friendliness [Floyd99b]
        • bandwidth equation
        • UDP
    • Peer-to-peer/Distributed Hash Table
      • Freenet [Clarke02a]
        • unstructured DHT system
        • insertion
        • search
      • Chord [Stoica01a]
        • structured DHT system
        • finger table
        • insertion
        • search
      • BitTorent [Yang04a]
        • piece selection
        • fairness
    • Integrated & Differentiated Services
      • Integrated and differentiated services design issues [Shenker95a]
        • efficacy
      • Integrated services [Clark92a]
        • guaranteed, predicted, and best effort services
        • token buckets
        • FIFO+
      • Differentiated services [Clark98a]
        • RIO (Red with In or Out)
      • Differentiated services [Nichols99a]
        • premium, assured, and best effort services
        • two-bit diff-serv
        • border router profile meters
    • Measurements
      • Network performance measurements [Paxson99b]
        • pathologies (reordering, duplication, corruption)
        • bandwidth (bottleneck BW vs. available BW)
        • loss (predictive?)
        • packet bunch (problems with packet pair)
    • Wireless & Mobile
      • Mobile IP [Johnson96b]
      • Media access for wireless LAN [Bharghavan94a]
        • hidden terminal
        • exposed terminal
        • back-off
      • SNOOP [Balakrishnan95b]
        • operation of snoop
      • Ad hoc routing
      • Sensor network [Intanagonwiwat00a]
        • directed diffusion
        • data-centric communication
    • Class project
      • Final project

  • 11/19/2008: The online course evaluations for DEN students are now available. Please click here for the instructions (in PDF). These online evaluations are available for DEN students only.

  • 10/15/2008: The midterm exam will be closed book, closed notes, and closed everything (and no "cheat sheet"). Also, no calculators, cell phones, or any electronic gadgets are allowed. Please bring a photo ID. Your ID will be collected at the beginning of the exam and will be returned to you when you turn in your exam. There will be assigned seating.

    The midterm exam will cover everything from the beginning of the semester till the end of Lecture 15 on 10/15/2008 (includes materials from part of [Ramakrishnan90a]). I will not ask anything about ns and nam. And you will only be responsible for part of [Ramakrishnan90a] which was covered under TCP congestion control (fairness and efficiency) and not under queue management (DEC-bit).

    Here is a quick summary of the topics (not all topics covered are listed):

    • Networking basics
      • CIDR
      • NAT
    • Architecture
      • Internet design issues [Clark88a]
      • End-to-end argument [Saltzer81a]
      • IP (protocol hourglass) [Deering98a]
    • Routing
      • Landmark routing [Tsuchiya88a]
      • Unicast routing
        • static routing
        • distance vector
        • link state
      • Interdomain routing (BGP)
        • BGP messages
        • BGP attributes and policy routing
        • EBGP vs IBGP
        • multihoming
      • Delayed convergence [Labovitz00a]
    • TCP
      • basic TCP mechanisms
        • window-based flow control
        • SYN & 3WH
        • FIN
        • TCP extensions
      • congestion control (includes part of [Ramakrishnan90a])
      • congestion collapse
      • congestion control vs. congestion avoidance
      • fairness
      • efficiency
      • stability
      • Congestion control mechanisms [Jacobson88a]
        • slow start
        • congestion avoidance
        • fast retransmit
      • TCP Tahoe, Reno, New Reno, TCP SACK [Fall96a]
        • fast recovery
        • New Reno partial ACK
        • TCP SACK

  • 9/3/2008: If your e-mail address is <sagardos@usc.edu>, your e-mail account is over quota (again).

  • 8/29/2008: Office hours today been canceled. Sorry about the inconvenience.

  • 8/28/2008: If your e-mail address is <sagardos@usc.edu>, your e-mail account is over quota.

  • 8/10/2008: Registering with the class mailinglist is required for this class because you must get your port assignments. If you have not done so, please visit the mailinglist page. (You do not have to be registered for the course to register with the class mailinglist.)

  • 8/10/2008: Watch this area for important announcements.
 
Prerequisites
 
Important Information about the Class Projects
The class projects will take more than 5,000 lines of C/C++ code to be developed on a UNIX environment. No other programming language will be accepted and your program must compile and run with a Makefile on nunki.usc.edu. (Sorry, no Java.) You must be familiar with the UNIX development environment (vi/pico/emacs, cc/gcc or g++/CC, make, etc.)

If a student signs up late for this class or could not be present at the beginning of the semester, he/she is still required to turn all projects and homeworks on time or he/she will receive a score of 0 for these assignments. No exceptions!

 

   [Please see copyright regarding copying.]