http://dsg.cs.ubc.ca/pmwiki.php?n=Main.Cs527w2007term1
CS 527 : Computer Communication Protocols
(Graduate Networking)
Tuesdays and Thursdays, 11:00am-12:30pm DMP 101
Instructor: Charles 'Buck'
Krasic
Office Hours: by Appointment (see my calendar for busy times).
Optional Textbook: Kurose and Ross, Computer
Networking (A Top-Down Approach), 4th Ed., Addison-Wesley.
The 4th edition is new, the 3rd edition is OK, but the 2nd edition is
pretty old now.
Pre-Requisites: The official
pre-req is CPSC 417 or equivalent. A basic familiarity with systems
concepts, and knowledge of networking and the Internet protocols in
particular will be helpful but not strictly required. This class will
cover material that balances between principles and applied topics,
there will be little in the way of formal mathematics. The class does
have a major project component, which will likely involve substantial
programming.
Overview
This class will cover a series of topics in systems and networking
topics, generally focused on the Internet architecture, its protocols,
and a sampling of interesting research papers (past and present).
Term Project
Project Due Dates:
- Proposal
- Oct. 25th.
- Final Report
- Dec. 7th.
Project Description and Guidelines
There is one major project required for this course. It's purpose is
to give you some hands on exposure to networking topics, complementary
to the analytical and critical process of material discussed in class.
You are encouraged to form groups and work collaboratively, although it
is not strictly required. The first phase of the project is to select a
topic, and write up a 1 page proposal describing the project, which is
due on October 25th. During this phase you are encouraged to brainstorm
and form groups. The proposal should outline the topic, describe
briefly what your investigation will be about, and what you plan to do.
The final project deadline is December 7th.
You are expected to hand in a report, about 5-10 pages in length. You
may also schedule an appointment with me to provide a short
presentation or demonstration of your project.
Topic Selection
The topics covered in class should serve as a starting point for the
types of topic you propose. The goal of the project may be to initiate
investigation into a research topic, or it may just be for you to gain
some practical experience with networking. You may choose to implement
or extend an idea from one of the papers we cover. You may choose to
construct a simulation and experiments to validate (or disprove) an
idea.
Some rough examples:
- implement or simulate the performance of some form of network
resource management
- congestion control (XCP, one more bit, etc)
- active queue management (RED, BLUE, etc.)
- implement BLUE and SFB in the linux kernel
- Vegas over TCP
- see me. This is an idea to improve TCP's delay for streaming
by lowering latency, entirely at user level.
- Adaptive Packet Sizing
- see me. When TCP's fair share CWND size approaches one, fair
sharing suffers. Investigate approaches to
congestion control that defer this effect by reducing packet sizes.
- Web 2.0 application
- web based IDE
- web based collaborative video editor
- Distributed systems
- More to come...
|
Class Schedule
|
|
Week 1
|
Class 1
Tues - Sept 11
Course Introduction
Internet Overview
How to read a paper.
S. Keshav (2007)
SIGCOMM Comput. Commun. Rev., 37(3):83-84.
(PDF)
(BibTeX)
|
Class 2
Thurs - Sept 13
Internet Overview (cont'd)
Part I: Internet Fundamentals
Architecture and Design Principles
The design philosophy of the DARPA internet protocols.
D. Clark (1988)
In SIGCOMM '88: Symposium proceedings on Communications architectures
and protocols. New York, NY, USA. ACM Press, pages 106-114.
(PDF)
(BibTeX)
|
|
Week 2
|
Class 3
Tues - Sept 18
Architectural considerations for a new generation of
protocols.
D. D. Clark and D. L. Tennenhouse (1990)
In SIGCOMM '90: Proceedings of the ACM symposium on Communications
architectures \& protocols. New York, NY, USA. ACM Press, pages
200-208.
(PDF)
(BibTeX)
|
Class 4
Thurs - Sept 20
End-to-end arguments in system design.
J. H. Saltzer , D. P. Reed and D. D. Clark (1984)
ACM Trans. Comput. Syst., 2(4):277-288.
(PDF) (BibTeX)
Structured streams: a new transport abstraction.
Bryan Ford (2007)
In SIGCOMM '07: Proceedings of the 2007 conference on Applications,
technologies, architectures, and protocols for computer communications.
New York, NY, USA. ACM Press, pages 361-372.
(PDF)
(BibTeX)
|
|
Week 3
|
Class 3
Tues - Sept 25
Routing
The revised ARPANET routing metric.
A. Khanna and J. Zinky (1989)
In SIGCOMM '89: Symposium proceedings on Communications architectures
\& protocols. New York, NY, USA. ACM Press, pages 45-56.
(PDF)
(BibTeX)
Interdomain Internet Routing.
Hari Balakrishnan and Nick Feamster (2005)
http://nms.csail.mit.edu/6829-papers/L4-routing.pdf.
(BibTeX)
|
Class 4
Thurs - Sept 27
Congestion Control
Congestion avoidance and control.
V. Jacobson (1988)
SIGCOMM Comput. Commun. Rev., 18(4):314-329.
(PDF) (BibTeX)
|
|
Week 4
|
Class 5
Tues - Oct 2
Naming
Development of the domain name system.
P. Mockapetris and K. J. Dunlap (1988)
In SIGCOMM '88: Symposium proceedings on Communications architectures
and protocols. New York, NY, USA. ACM Press, pages 123-133.
(PDF) (BibTeX)
Persistent personal names for globally connected
mobile devices.
Bryan Ford , Jacob Strauss , Chris Lesniewski-Laas , Sean
Rhea , Frans Kaashoek and Robert Morris (2006)
In USENIX'06: Proceedings of the 7th conference on USENIX Symposium on
Operating Systems Design and Implementation. Berkeley, CA, USA. USENIX
Association, pages 17-17.
(PDF)
(BibTeX)
|
Class 6
Thurs - Oct 4
Internet indirection infrastructure.
Ion Stoica , Daniel Adkins , Shelley Zhuang , Scott Shenker
and Sonesh Surana (2002)
In SIGCOMM '02: Proceedings of the 2002 conference on Applications,
technologies, architectures, and protocols for computer communications.
New York, NY, USA. ACM Press, pages 73-86.
(PDF)
(BibTeX)
|
|
Week 5
|
Class 7
Tues - Oct 9
Wireless
Bluetooth: Technology for Short-Range Wireless Apps.
Pravin Bhagwat (2001)
IEEE Internet Computing, 5(3):96-103.
(PDF) (BibTeX)
Presented by: Chris
IEEE 802.11 Wireless Local Area Networks.
B. P. Crow , I. Widjaja , L. G. Kim and P. T. Sakai
(1997)
IEEE Communications Magazine, 35(9):116-126.
(PDF)
(BibTeX)
Presented by: Emt.
|
Class 8
Thurs - Oct 11
Part II: Advanced Resource Management
Dynamic behavior of slowly-responsive congestion
control algorithms.
Deepak Bansal , Hari Balakrishnan , Sally Floyd and Scott
Shenker (2001)
In SIGCOMM '01: Proceedings of the 2001 conference on Applications,
technologies, architectures, and protocols for computer communications.
New York, NY, USA. ACM Press, pages 263-274.
(PDF)
(BibTeX)
Presented: Nasa
Quality of Service
Analysis and simulation of a fair queueing algorithm.
A. Demers , S. Keshav and S. Shenker (1989)
In SIGCOMM '89: Symposium proceedings on Communications architectures
\& protocols. New York, NY, USA. ACM Press, pages 1-12.
(PDF)
(BibTeX)
Presented by: Jonatan
|
|
Week 6
|
Tues - Oct 16
No Class - SOSP
|
Thurs - Oct 18
Class 9
Supporting real-time applications in an Integrated
Services Packet Network: architecture and mechanism.
David D. Clark , Scott Shenker and Lixia Zhang (1992)
In SIGCOMM '92: Conference proceedings on Communications architectures
\& protocols. New York, NY, USA. ACM Press, pages 14-26.
(PDF)
(BibTeX)
Presented by: Mahdi
Explicit allocation of best-effort packet delivery
service.
David D. Clark and Wenjia Fang (1998)
IEEE/ACM Trans. Netw., 6(4):362-373.
(PDF)
(BibTeX)
|
|
Week 7
|
Class 10
Tues - Oct 23
Active Queue Management
Random early detection gateways for congestion
avoidance.
Sally Floyd and Van Jacobson (1993)
IEEE/ACM Trans. Netw., 1(4):397-413.
(PDF)
(BibTeX)
Presented by: Dutch
The BLUE active queue management algorithms.
Wu-chang Feng , Kang G. Shin , Dilip D. Kandlur and Debanjan
Saha (2002)
IEEE/ACM Trans. Netw., 10(4):513-528.
(PDF)
(BibTeX)
Presented by: Chris
|
Class 11
Thurs - Oct 25
Term Project Proposal Due
Integrated Congestion Control and Router Queue Management
Congestion control for high bandwidth-delay product
networks.
Dina Katabi , Mark Handley and Charlie Rohrs (2002)
In SIGCOMM '02: Proceedings of the 2002 conference on Applications,
technologies, architectures, and protocols for computer communications.
New York, NY, USA. ACM Press, pages 89-102.
(PDF)
(BibTeX)
Presented by: Zohreh
One more bit is enough.
Yong Xia , Lakshminarayanan Subramanian , Ion Stoica and
Shivkumar Kalyanaraman (2005)
SIGCOMM Comput. Commun. Rev., 35(4):37-48.
(PDF)
(BibTeX)
|
|
Week 8
|
Class 12
Tues - Oct 30
Resource Management Potpourri
Emulating AQM from end hosts.
Sumitha Bhandarkar , A. L. Narasimha Reddy , Yueping Zhang
and Dimitri Loguinov (2007)
SIGCOMM Comput. Commun. Rev., 37(4):349-360.
(PDF) (BibTeX)
Presented by: Emtiyaz
Cloud control with distributed rate limiting.
Barath Raghavan , Kashi Vishwanath , Sriram Ramabhadran ,
Kenneth Yocum and Alex C. Snoeren (2007)
SIGCOMM Comput. Commun. Rev., 37(4):337-348.
(PDF) (BibTeX)
Prestented by: Nasa
Optional
Policing congestion response in an internetwork using
re-feedback.
Bob Briscoe , Arnaud Jacquet , Carla Di Cairano-Gilfedder ,
Alessandro Salvatori , Andrea Soppera and Martin Koyabe (2005)
In SIGCOMM '05: Proceedings of the 2005 conference on Applications,
technologies, architectures, and protocols for computer communications.
New York, NY, USA. ACM Press, pages 277-288.
(PDF) (BibTeX)
Flow rate fairness: dismantling a religion.
Bob Briscoe (2007)
SIGCOMM Comput. Commun. Rev., 37(2):63-74.
(PDF)
(BibTeX)
|
Class 13
Thurs - Nov 1
Part III: Multicast, Content Distribution, P2P
Receiver-driven layered multicast.
Steven McCanne , Van Jacobson
and Martin Vetterli (1996)
In SIGCOMM '96: Conference proceedings on Applications, technologies,
architectures, and protocols for computer communications. New York, NY,
USA. ACM Press, pages 117-130.
(PDF) (BibTeX)
Enabling conferencing applications on the internet
using an overlay muilticast architecture.
Yang Chu , Sanjay Rao , Srinivasan Seshan and Hui Zhang
(2001)
SIGCOMM Comput. Commun. Rev., 31(4):55-67.
(PDF)
(BibTeX)
|
|
Week 9
|
Class 14
Tues - Nov 6
Looking up data in P2P
systems.
Hari Balakrishnan , M. Frans Kaashoek , David Karger , Robert
Morris and Ion Stoica (2003)
Commun. ACM, 46(2):43-48.
(PDF) (BibTeX)
Incentives Build Robustness in BitTorrent.
Bram Cohen (2003)
http://www.bittorrent.org/bittorrentecon.pdf.
(BibTeX)
|
Class 15
Thurs - Nov 8
ROFL: routing on flat labels.
Matthew Caesar , Tyson Condie , Jayanthkumar Kannan , Karthik
Lakshminarayanan and Ion Stoica (2006)
SIGCOMM Comput. Commun. Rev., 36(4):363-374.
(PDF)
(BibTeX)
Part IV: Network Security
Hash-based IP traceback.
Alex C. Snoeren (2001)
In SIGCOMM '01: Proceedings of the 2001 conference on Applications,
technologies, architectures, and protocols for computer communications.
New York, NY, USA. ACM Press, pages 3-14.
(PDF)
(BibTeX)
|
|
Week 10
|
Class 16
Tues - Nov 13
A DoS-limiting network
architecture.
Xiaowei Yang , David Wetherall and Thomas Anderson (2005)
In SIGCOMM '05: Proceedings of the 2005 conference on Applications,
technologies, architectures, and protocols for computer communications.
New York, NY, USA. ACM Press, pages 241-252.
(PDF)
(BibTeX)
How to Own the Internet in Your Spare Time.
Stuart Staniford , Vern Paxson and Nicholas Weaver (2002)
In Proceedings of the 11th USENIX Security Symposium. Berkeley, CA,
USA. USENIX Association, pages 149-167.
(PDF) (BibTeX)
Presented by: Chris F.
|
Class 17
Thurs - Nov 15
Automated worm fingerprinting.
Sumeet Singh , Cristian Estan , George Varghese and Stefan
Savage (2004)
In OSDI'04: Proceedings of the 6th conference on Symposium on Opearting
Systems Design \& Implementation. Berkeley, CA, USA. USENIX
Association, pages 4-4.
(PDF)
(BibTeX)
Part VI: Network Games
A traffic characterization of popular on-line games.
Wu-chang Feng , Francis Chang , Wu-chi Feng and Jonathan
Walpole (2005)
IEEE/ACM Trans. Netw., 13(3):488-500.
(PDF) (BibTeX)
|
|
Week 11
|
Class 18
Tues - Nov 20
Measurement-based characterization of a collection of
on-line games.
Chris Chambers , Wu-chang Feng , Sambit Sahu and Debanjan Saha
(2005)
In IMC'05: Proceedings of the Internet Measurement Conference 2005 on
Internet Measurement Conference. Berkeley, CA, USA. USENIX Association,
pages 1-1.
(PDF)
(BibTeX)
Mitigating information exposure to cheaters in
real-time strategy games.
Chris Chambers , Wu-chang Feng , Wu-chi Feng and Debanjan Saha
(2005)
In NOSSDAV '05: Proceedings of the international workshop on Network
and operating systems support for digital audio and video. New York,
NY, USA. ACM, pages 7-12.
(PDF)
(BibTeX)
|
Class 19
Thurs - Nov 22
Low-Latency Adaptive Streaming over TCP.
Ashvin Goel , Charles Krasic and Jonathan Walpole (2008)
ACM Transactions on Multimedia Computing,Communications, and
Applications (TOMCCAP), 4(3).
(PDF) (BibTeX)
Latency Evaluation of Networking Mechanisms for Game
Traffic.
Szabolcs Harcsik , Andreas Petlund , Carsten Griwodz and
P{\aa}l Halvorsen (2007)
In NETGAMES..
(PDF) (BibTeX)
|
|
Week 12
|
Class 18
Tues - Nov 27
Part VI: Distributed Systems
MapReduce: simplified
data processing on large clusters.
Jeffrey Dean and Sanjay Ghemawat (2004)
In OSDI'04: Proceedings of the 6th conference on Symposium on Opearting
Systems Design \& Implementation. Berkeley, CA, USA. USENIX
Association, pages 10-10.
(PDF)
(BibTeX)
Dynamo: amazon's highly available key-value store.
Giuseppe DeC,
ia , Deniz Hastorun , Madan Jampani , Gunavardhan Kakulapati , Avinash
Lakshman , Alex Pilchin , Swaminathan Sivasubramanian , Peter Vosshall
and Werner Vogels (2007)
In SOSP '07: Proceedings of
twenty-first ACM SIGOPS symposium on Operating systems principles. New
York, NY, USA. ACM, pages 205-220.
(PDF) (BibTeX)
|
Class 19
Thurs - Nov 29
Sinfonia: a new paradigm for building scalable
distributed systems.
Marcos K. Aguilera , Arif Merchant , Mehul Shah , Alistair
Veitch and Christos Karamanolis (2007)
In SOSP '07: Proceedings of twenty-first ACM SIGOPS symposium on
Operating systems principles. New York, NY, USA. ACM, pages 159-174.
(PDF) (BibTeX)
Part VI: Application layer: Web 2.0, AJAX and the REST...
IBM
DeveloperWorks AJAX Resource Center
|
Full BibteX
bibliography
http://www.cs.ubc.ca/~krasic
|