CS
540 - Computer Network Architecture
Spring
2006
MonWed
9am -
Date |
Homework |
Planned Activity |
Required Reading |
3/6 Mon |
|
|
|
3/8 Wed |
|
Review of basic networking
concepts |
[1] Ch. 1-5 |
3/13 Mon |
|
Web 2.0 |
“What
is Web 2.0” by Tim O’Reilly [4] Chapter
7 on HTTP/1.1 |
3/15 Wed |
|
|
[5], [6],
[7] |
3/20 Mon |
HW #1 posted Due 9am, 4/3 |
CDNs, tunneling |
[1] pp.
348-350, [2] pp.
268-270, Ch. 4.5.3, 9.4.3, |
3/22 Wed |
|
Overlay networks |
|
3/27 Mon |
|
Introduction to p2p |
[3] |
3/29 Wed |
|
No class |
|
4/3 Mon |
|
Unstructured p2p |
[3] |
4/5 Wed |
|
Structured p2p |
[3] Ch.6-7 Chord: A
Scalable Peer-to-peer lookup service for Internet Applications Pastry:
Scalable, distributed object location and routing for large-scale
peer-to-peer systems Complimentary
reading (no review required): “The
structure and function of complex networks,” M. E. J. Newman, SIAM Review
Vol. 45, No. 2, pp. 167-256 |
4/7 Fri (Make-up for 3/29) |
|
HW#1
Review Structured
p2p |
[3] Ch 8, 9 OpenDHT: A Public DHT Service and Its Uses (review due Mon, 4/10) |
4/10 Mon |
|
Structured p2p |
[3] Ch. 9-10 |
4/12 Wed |
|
|
|
4/17 Mon |
|
Advanced topics in p2p |
Declarative Routing: Extensible
Routing with Declarative Queries (review due Mon, 4/17) |
4/19 Wed |
|
Advanced topics in p2p |
|
4/20 ~ 4/26 Mid-Term (4/20 Thu 4pm) |
|||
5/1 Mon |
|
Congestion control |
[1] [2] Analysis of the Increase and
Decrease Algorithms for Congestion Avoidance in Computer Networks by D.
Chiu and R. Jain (review due Mon, 5/8) Congestion Avoidance and Control
by V. Jacobson (review due Mon, 5/8) |
5/3 Wed |
|
|
Improving TCP/IP Performance over
wireless networks by H. Balakrishnan, Binary Increase Congestion Control for
Fast, Long Distance Networks by L. Xu, K. Harfoush, and |
5/8 Mon |
|
|
|
5/10 Wed |
|
|
|
5/15 Mon |
HW #2
(due 5/26) |
|
|
5/17 Wed |
|
Review routing (routing
algorithms, BGP tutorial) |
|
5/22 Mon |
|
No class |
|
5/24 Wed |
|
No class |
|
5/29 Mon |
|
BGP |
BGP4
Inter-Domain Routing in the Internet by John W. Stewart “Understanding
the Border Gateway Protocol (BGP)” ICNP 2002 Tutorial by Tim Griffin BGP Beacons by M. Mao, R. Bush, T.
Griffin, M. Roughan The Interdomain
connectivity of PlanetLab nodes by (Review either one and submit by
Wed, 5/31) |
5/31 Wed |
|
No class (Election Day) |
|
6/2 Fri 9am – 11am (make-up) |
|
No
class took place. |
|
6/5 Mon |
HW #3 Proposal Due |
Project
Proposal Review (15min
with each team, starting
with team #1) |
HW #3: Implement any distributed algorithm of
your choice in p2 and describe expected challenges in coding and
debugging. The more complex, the more
relevant to your own research, or the more intriguing, the better. |
6/7 Wed |
|
Metarouting |
Metarouting
by T. Griffin, J. Sobrinho (review due Mon, 6/5) |
6/9 Fri (10am- |
|
MPLS/DiffServ |
Review relevant chapter in [1],
[2] MPLS Support of Differentiated Services (RFC
3270) (no review) |
6/12 Mon |
|
Wrap-up |
Overcoming barriers to disruptive
innovation in networking (review due Mon, 6/12) |
6/14 Wed |
|
In-Class Final Project Review |
|
6/20 Tue 4-6pm |
|
Final Exam |
|