CSE 222: Computer Communications Networks

Syllabus

Introduction and Packet Switched Networks

Alternative Infrastructures

Routing

Data Center Networks

Congestion Control

Overlays and Multicast

Additional Reading Schedule

We ask each student to select two papers from the following list and sign up to evaluate them. The calendar of available dates is posted below. Signups for dates are done chronologically, and papers are first-come-first-served.

Additional paper evaluations are to be submitted at noon on Saturday/Monday, so as to not conflict with the Tuesday/Thursday schedule above. Each student is to do two such reviews. To sign up to do one of your additional paper evaluations, email barath@cs.ucsd.edu with the paper (from the list below) and date you'd like to do the eval. There are three paper evaluation slots per date and eval slots for subsequent weeks are not available for signup until previous weeks are filled.

We expect you to read these additional-paper evaluations written by your fellow students, and encourage you to ask questions on the blog in response to the evaluation postings. (It is likely that some of these papers will happen to be relevant or related to your course research project.)

Available Papers


Classic Papers

  1. Analysis and Simulation of a Fair Queueing Algorithm, Demers et al.
  2. Efficient Fair Queueing using Deficit Round Robin, Shreedhar et al.
  3. On packet switches with infinite storage, Nagle
  4. Random Early Detection gateways for Congestion Avoidance, Floyd et al.
  5. TCP and Explicit Congestion Notification, Floyd
  6. Consistent Overhead Byte Stuffing, Cheshire et al.
  7. The Synchronization of Periodic Routing Messages, Floyd et al.
  8. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Chaum
  9. End-to-End Routing Behavior in the Internet, Paxson
  10. An algorithm for distributed computation of a spanning tree in an extended LAN, Perlman
  11. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks, Chiu et al.
  12. Multicast Routing in Datagram Internetworks and Extended LANs, Deering et al.

Routing

  1. The Case for Separating Routing from Routers, Feamster et al.
  2. A Comparison of Overlay Routing and Multihoming Route Control, Akella et al.
  3. ROFL: Routing on Flat Labels, Caesar et al.
  4. A BGP-based Mechanism for Lowest-Cost Routing, Feigenbaum et al.
  5. MIRO: Multi-path Interdomain ROuting, Xu et al.
  6. On Selfish Routing in Internet-Like Environments, Qiu et al.

Transport and Congestion Control

  1. Binary Increase Congestion Control for Fast, Long Distance Networks, Xu et al.
  2. Cloud Control with Distributed Rate Limiting, Raghavan et al.
  3. Understanding the Performance of TCP Pacing, Aggarwal et al.
  4. Structured Streams: a New Transport Abstraction, Ford

Measurement

  1. Inferring Internet Denial of Service Activity, Moore et al.
  2. The End-to-end Effects of Internet Path Selection, Savage et al.
  3. Sting: a TCP-based Network Measurement Tool, Savage
  4. Network Coordinates in the Wild, Ledlie et al.

Internet Architecture

  1. A Framework for Scalable Global IP-Anycast (GIA), Katabi and Wroclawski
  2. Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination, Anand et al.
  3. A Delay-Tolerant Network Architecture for Challenged Internets, Fall
  4. A Layered Naming Architecture for the Internet, Balakrishnan et al.
  5. Towards an Evolvable Internet Architecture, Ratnasamy et al.
  6. Accountable Internet Protocol (AIP), Andersen et al.
  7. Paris Metro Pricing for the Internet, Odlyzko

Network Analysis and Experimentation

  1. Unraveling the Complexity of Network Management, Benson et al.
  2. Scalability and Accuracy in a Large-Scale Network Emulator, Vahdat et al.
  3. Systematic Topology Analysis and Generation Using Degree Correlations, Mahadevan et al.
  4. Realistic and Responsive Network Traffic Generation, Vishwanath et al.
  5. NetComplex: A Complexity Metric for Networked System Designs, Chun et al.
  6. In VINI Veritas: Realistic and Controlled Network Experimentation, Bavier et al.
  7. Modeling TCP throughput: a simple model and its empirical validation, Padhye et al.

Data Centers and Switch Architectures

  1. DCell: A Scalable and Fault-Tolerant Network Structure for Data Centers, Guo et al.
  2. A Policy-aware Switching Layer for Data Centers, Joseph et al.
  3. The Tiny Tera: A Packet Switch Core, McKeown et al.

Security

  1. TCP Congestion Control with a Misbehaving Receiver, Savage et al.
  2. Automated Worm Fingerprinting, Singh et al.
  3. Timing Analysis of Keystrokes and SSH Timing Attacks, Song et al.
  4. How to 0wn the Internet in Your Spare Time, Staniford et al.
  5. Practical Network Support for IP Traceback, Savage et al.
  6. Tor: The Second-Generation Onion Router, Dingledine et al.

Wireless

  1. Jigsaw: Solving the Puzzle of Enterprise 802.11 Analysis, Cheng et al.
  2. Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks, Chen et al.
  3. ZigZag Decoding: Combating Hidden Terminals in Wireless Networks, Gollakota et al.
  4. Trickle: A Self-Regulating Algorithm for Code Propagation and Maintenance in Wireless Sensor Networks, Levis et al.
  5. ExOR: opportunistic multi-hop routing for wireless networks, Biswas et al.

Networked Systems and Overlays

  1. High Bandwidth Data Dissemination for Large-scale Distributed Systems, Kostic et al.
  2. The Impact of DHT Routing Geometry on Resilience and Proximity, Gummadi et al.
  3. Lessons from Giant-Scale Services, Brewer
  4. Endpoint Admission Control: Architectural Issues and Performance, Breslau et al.