| Week |
Topics |
Notable
Events |
| 1. Jan
12 |
- Topics:
Administrative aspects
of
CSE 489/589, introduction to computer networking, the TCP/IP reference
model, protocol architecture
- Reading
Assignment:
- Supplementary
Materials:
|
Fri,
Jan 16: Project 1 out.
(Could be late by a couple of
days, i.e. may be out on Saturday or Sunday. Please check the blog for
announcement.)
No recitations in the
first week.
TAs will
hold no office hours in the first week.
My office hours are still
held
though.
|
| 2. Jan
19 |
- Topics:
- Brief Intro to the
TCP/IP Transport Layer: TCP &
UDP
introduction.
- Unix Network
Programming API.
- Reading
Assignment:
- Textbook: Chapter
2, and Section 3.1
- Beej's
Guide to Network Programming
- Introduction To Unix Signals Programming
- Read the following
network programming examples
carefully, in the order given. The simpler example goes first.
- TCP echo
client/server (tar.gz
file)
- UDP echo
client/server (tar.gz
file)
- TCP echo
client/server with select (tar.gz
file)
- Generic server
(tar.gz
file)
|
No
class on Mon,
Jan 19:
Martin Luther King day.
|
| 3.
Jan 26 |
- Topics:
- The Application
Layer: DNS, SMTP, P2P
- Reading
Assignment:
- Supplementary
reading:
- DNS
Cache Poisoning and Other Security Problems
|
Mon,
Jan 26: hw1 out.
|
| 4. Feb
02 |
- Topic:
The transport layer
- Multiplexing and
Demultiplexing
- Reliable Data
Transfer
- Reading
Assignment:
- Supplementary
reading:
|
|
| 5. Feb
09 |
- Topic:
TCP
- TCP's reliable data
transfer
- Connection management
- Flow control
- Various heuristics
for performance tuning
- Reading
Assignment:
- Supplementary
Reading:
- Basic
TCP:
- SACK
and NewReno:
(according to these
slides from Sally Floyd, half
the servers use SACK, half use
NewReno, all browsers use SACK)
- Recent
variations
- TCP
Security Issues:
- Sequence number
analysis:
- SYN Flooding:
- Session
Hijacking:
- Descriptions
of
different TCP implementations:
|
Mon,
Feb 09: hw1 due, hw2
out.
|
| 6.
Feb 16 |
- Topic:
Congestion control and TCP
- Reading
Assignment:
- Textbook: 3.6--3.8
- V. Jacobson and M.
Karels, "congestion
avoidance and control",
Proceedings of ACM SIGCOMM'88 (Palo
Alto, CA), pp.314-329, August 1988. (A
classic paper!)
- Suplementary
Reading:
- Main
RFCs on congestion
control:
- RFC 2001
(Congestion control, 1997, W. Stevens)
- RFC
2581
(Slow start and congestion control, 1999, an update of RFC 2001),
- Papers
on congestion
control
- S. Floyd, and V.
Jacobson, "Random
Early Detection Gateways for Congestion Avoidance",
IEEE/ACM
Transactions on Networking, V.1, N.4, August 1993, p. 397-413.
- C. Q. Yang and
Reddy A. A
taxonomy for congestion control algorithms in packet switching networks.
IEEE Network Magazine, 9:34--45, 1995
- D.-M. Chiu and
R.
Jain, "Analysis
of the Increase and Decrease Algorithms for Congestion Avoidance in
Computer Networks", Computer
Networks and ISDN Systems, Vol.
17, 1989, pp. 1-14.
- Other
papers on TCP
modelling:
|
|
| 7.
Feb 23 |
- Topic:
The Network Layer
+ Discussion of Project
phase 2
- Services
- Routing algorithms,
routing and forwarding
- IP Addressing (in
the recitations)
- Reading
assignment:
- Supplemenatry
reading:
- A. Shaikh and A.
Greenberg, "OSPF Monitoring: Architecture, Design
and
Deployment Experience", Proc.
USENIX Symposium on Networked
System Design and Implementation (NSDI), March 2004.
- A. Shaikh, C. Isett,
A. Greenberg, M. Roughan and
J. Gottlieb, "A Case Study of OSPF Behavior in a
Large
Enterprise Network. Proc. ACM
SIGCOMM Internet Measurement
Workshop (IMW), pp. 217-230, November 2002.
- IANA
current /8-network allocation
- How
much of Internet address space is used? (1997)
- RFC
791: The Internet Protocol
- RFC
1518: An Architecture for IP
Address Allocation with CIDR
(1993)
- RFC
4632: CIDR - The Internet
Address Assignment and Aggregation
Plan (2006)
- Recitation
topics: IP Addressing,
CIDR
|
Mon,
Feb 23: Project phase 1 due.
Project
phase 2 out. Absolute
deadline!
Fri, Feb 27: hw2 due.
|
| 8. Mar
02 |
- Topic: The
Network Layer + Review for the midterm
exam
- Routing protocols
- Fragmentation and
reassembly
- Reading
assignment:
- Supplementary
reading:
|
Fri,
Mar 06: Midterm
exam.
|
| 9.
Mar 09 |
|
No
classes this week. Spring
recess! |
| 10. Mar
16 |
- Topic: Inside
a Router
- Inside a router
- Switching Fabrics
- Reading
Assignment:
- Textbook: 4.4--4.5
- Textbook: 4.6--4.10
- Suplementary Reading:
- Issues
and Trends in Router Design
- (The
FIFO-IQ means 58% throughput paper)
M. Karol, M. Hluchyj
and S. Morgan, "Input
Versus Output Queueing of a Space-Division
Packet Switch," IEEE
Transactions
on Communications, 35(12):319-352, December 1987.
- (MWM
for
VOQ-switches achieves 100% throughput, so are CIOQ-switches using
maximal matching with speedup 2.)
J.G. Dai and B.
Prabhakr, "The
Throughput of Data
Switches with and without Speedup," Proceedings of the IEEE INFOCOM,
2:556-564, Tel Aviv, Israel, March 2000
- (CIOQ
emulates OQ with
speedup 2, plus WFQ)
Shang-Tse Chuang, Ashish Goel,
Nick McKeown, Balaji Prabhakar, "Matching
Output Queueing with a
Combined Input Output Queued Switch,"
IEEE Journal on
Selected
Areas in
Communications, vol.17, n.6, Dec.1999, pp. 1030-1039.
- Emilio
Leonardi, Marco Mellia, Marco Ajmone Marsan, Fabio Neri: Stability of
Maximal Size Matching Scheduling in Input-Queued Cell Switches. ICC (3)
2000: 1758-1763
- (How
large
should router's buffer be?) Guido
Appenzeller , Isaac Keslassy , Nick McKeown, Sizing
router buffer,
SIGCOMM 2004
- (2
good
introductory chapters on lookup and classification?) R.
Gupta, Algorithms
for
routing lookup and packet classification,
Ph.D. thesis,
Stanford. (Chapter
1 | Chapter
2)
- Nick McKeown, "A
Fast Switched Backplane for a Gigabit Switched Router",
Business Communications Review, December 1997.
- A.
Parekh and R. Gallager, "A Generalized Processor Sharing Approach to
Flow
Control in Integrated Services Networks: The Single Node Case,"
IEEE/ACM Transactions on Networking,
1(3):344-357, June 1993.
- N. McKeown,
"The iSLIP Scheduling
Algorithm for
Input-Queued
Switches," IEEE/ACM Transactions on Networking,
7(2):188-201, April 1999.
- Weighted
Fair Queueing:
- A. Demers, S.
Keshav, and S. Shenker,
"Analysis
and
Simulation of a Fair Queueing Algorithm," Proceedings of the ACM
Sigcomm '89 and Computer Communications Review 19(4):1-12, 1989.
- M. Shreedhar and
G.Varghese, "Efficient Fair
Queueing
Using Deficit
Round-Robin," Proceedings of the ACM
Sigcomm '95 and IEEE/ACM Transactions on Networking, 4(3):375-385, June
1996.
- Buffer
sizing/design:
- Sundar
Iyer, R. R. Kompella, and Nick McKeown, "Designing Buffers for Router
Line Cards," IEEE/ACM Transactions on
Networking, Nov. 2002.
- Other
(non-CIOQ)
architectures:
- Sundar Iyer and
Nick McKeown, "Analysis of the
Parallel
Packet Switch
Architecture," IEEE/ACM Transactions on
Networking, April 2003.
- Sundar
Iyer, Rui Zhang, Nick McKeown, "Routers with a Single Stage of
Buffering," ACM SIGCOMM, Pittsburgh, USA, Sep. 2002.
Computer Communication Review, vol. 32, no. 4, Oct 2002.
- Address
lookup
problem
- A. Brodnik, S.
Carlsson, M. Degermark, S. Pink.
“Small Forwarding Tables for Fast Routing Lookups”,
Sigcomm
1997, pp 3-14.
- P. Gupta, S. Lin,
N.McKeown. “Routing lookups in
hardware at memory access speeds”, Infocom 1998, pp
1241-1248,
vol. 3.
- P. Gupta, B.
Prabhakar, S. Boyd. “Near-optimal
routing lookups with bounded worst case performance,” Proc.
Infocom, March 2000
- V.
Srinivasan, G. Varghese, "Fast Address Lookups Using Controlled Prefix
Expansion," ACM Transactions on Computing Systems, 1999. (Sigmetrics
1998).
- P. Gupta,
“Algorithms
for
routing lookups and packet classification”,
PhD Thesis, Ch 1
and 2, Dec 2000
- B. Lampson, V.
Srinivasan, G. Varghese. “ IP
lookups using multiway and multicolumn search”, Infocom 1998,
pp
1248-56, vol. 3.
- Y. Lu, B.
Prabhakar and F. Bonomi. “Perfect
hashing for network applications”, ISIT, July 2006
- S. Nilsson, G.
Karlsson. “Fast address lookup for
Internet
routers”, IFIP Intl Conf on Broadband Communications,
Stuttgart,
Germany, April 1-3, 1998.
- M. Waldvogel, G.
Varghese, J. Turner, B.
Plattner.
“Scalable high speed IP routing lookups”, Sigcomm
1997, pp
25-36.
|
|
| 11. Mar
23 |
|
Mon,
Mar 23: hw3 out.
|
| 12. Mar
30 |
- Topic:
More on the Internet
Protocol
- Internetworking
- Routing on the
Internet: RIP & OSPF, BGP
- ICMP/DHCP/NAT/PAT
- Reading
Assignment:
- Textbook: 4.4--4.5
- Textbook: 4.6--4.10
- Suplementary
Reading:
- Intra-domain
routing
- OSPF
Version 2 (RFC 2328)
- A. Shaikh and A.
Greenberg, "OSPF Monitoring:
Architecture, Design and Deployment Experience", Proc. USENIX Symposium
on Networked System Design and Implementation (NSDI), March 2004.
- A. Shaikh, C.
Isett, A. Greenberg, M. Roughan and
J. Gottlieb, "A Case Study of OSPF Behavior in a Large Enterprise
Network. Proc. ACM SIGCOMM Internet Measurement Workshop (IMW), pp.
217-230, November 2002
- Inter-domain
routing
- Craig Labovitz,
Abha Ahuja, Abhijit Bose, Farnam
Jahanian, "Delayed
Internet Routing Convergence",
IEEE/ACM Transactions on
Networking, Vol. 9, No. 3 (April 2001), Pages 293-306.
- Gao &
Rexford, “Stable Internet Routing
without Global Coordination”, IEEE/ACM ToN, 2001
- IP
multicasting
|
|
| 13. Apr
06 |
- Topic:
Brief overview of the
physical layer & Datalink layer
- Multiple Access
Protocols
- ARP
- Reading
Assignment:
- Suplementary
Reading:
- Textbook: Chapter
3 except section 3.5
|
Wed
Apr 08: hw3 due, hw4 out.
|
| 14. Apr
13 |
- Topic:
Local Area Networks
- Ethernet
- Hardwares: hubs,
bridges, switches
- Wireless LANs:
802.11
- Reading
Assignment:
- Suplementary
Reading:
|
|
| 15. Apr
20 |
I
will be out
of town for the entire week. I will ask one of the TAs to cover for me. |
Friday
Apr 24: project 2 due. Absolute
deadline!
|
| 16. Apr
27 |
- Wrap things up -
review for final exam.
|
- Monday, Apr 27 is the
last day of classes.
- Monday
Apr 27: hw4 due.
|
|
Monday,
May 04: Final Exam,
3:30pm--6:30pm, Knox 110 |
|