USC CSD Home
 

Computer Communications - CSCI 551, Spring 2007, TuTh Section

 
General Information
Time   :   TuTh 12:30pm - 1:50pm
Location : KAP 156
Instructor   :   Bill Cheng, Office Hours: TuTh 11:00am - 12:00pm in SAL 228, E-mail: <bill.cheng@usc.edu> or <william@bourbon.usc.edu>   (Please do not send HTML e-mails. They will not be read.)
TA   :   Leslie Cheung, E-mail: <lccheung@usc.edu>, Office Hours: TuTh, 3:00pm - 4:00pm in SAL 211
Grader   :   Pritam Pradhan, E-mail: <ppradhan@usc.edu>,    (The grader will hold office hours the week after the announcement of each project assignment's grades.)
Midterm Exam   :   during class, Thu, 3/8/2007, in THH 210 (firm)
Final Exam   :   2pm-4pm, Wed, 5/9/2007, in THH 212 (firm)
Msg Archives   :   messages from Bill, messages from Leslie, messages from Pritam
 
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.)
 
News
(in reversed chronological order)
  • 4/25/2007: The final exam will be held in THH 212. It is 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) to the last slide of the last lecture on 4/26/2007. 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 (not all topics covered are listed):

    • Queue Management
      • 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
      • dynamic source routing in ad hoc wireless networks [Johnson96c]
        • DSR route discovery and route maintenance
      • sensor network [Intanagonwiwat00a]
        • directed diffusion
        • data-centric communication
    • Scalable upload [Bistro00, Cheng01a]
      • real-time timestamp
      • low-latency commit
      • timely data transfer
      • security protocol
      • coordinated data transfer
    • Multicast
      • IP multicast [Deering88b]
        • composed of a service model, IGMP, and multicast routing protocols
        • MBone and tunnels
      • DVMRP, MOSPF
        • flood and prune in DVMRP
        • receivers floods in MOSPF
      • PIM [Deering96a]
        • shared tree vs. source tree
        • sparse mode vs. dense mode
        • core/center/rendezvous point
      • Single-source Multicast [Holbrook99a]
      • Scalable Reliable Multicast [Floyd97c]
        • sender reliable vs. receiver reliable error detection
        • NACK implosion
        • retransmission
    • Class project
      • final project part (2)

  • 3/3/2007: 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 fair queueing (last slide of lecture 15 on 2/27/2007). 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
        • 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
        • SYN & 3WH
        • FIN
        • RTT & RTO
      • congestion control (includes part of [Ramakrishnan90a])
      • 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
    • Queue management
      • Fair queueing & weighted fair queueing [Demers89a]
        • arrival time
        • start time
        • finish time

  • 1/9/2007: I've mentioned in today's lecture that midterm and final exam will account for 30% of your total grade each. I have changed my mind about this. The midterm exam will account for 25% of your total grade and the final exam will account for 35% of your total grade. The percentages are final and I will not change them again.

  • 1/9/2007: If you are a PhD student, you are strongly encouraged to enroll in Prof. Heidemann's section of CSCI 551 (on Thu 9am-11:50am). If the system would not let you switch, please see Siria in SAL 300 and let her know that you are a PhD student.

  • 1/8/2007: 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.)


  • 1/8/2007: 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!

 

[Last updated Wed Dec 31 1969]    [Please see copyright regarding copying.]