|
 CS/EE 143 Communication Networks
| Schedule |
Fall 2009, Wed/Fri 10:30 - 11:55am, 213 Annenberg |
| Units |
9 (3-3-3) |
| Prerequisite |
Math 2ab, programming experience |
| URL |
http://netlab.caltech.edu/course.php
|
| Professor |
Steven Low, CS, EE;
slow AT caltech.edu; x6767; Rm 219 Annenberg
|
| Admin Assistant |
Sheri Garcia;
sheri AT cs.caltech.edu; x6704; Rm 339 Annenberg
|
| TA |
|
| |
|
|
|
This course introduces the basic mechanisms and protocols in
communication networks, and simple mathematical models for their analysis.
It can be combined with CS/EE 144 Ideas Behind the Web (Winter) and
CS/EE 145 Projects in Networking (Spring) to satisfy the project
requirement for CS undergraduate degree. Towards the end of this
course, students will be asked to present a tentative proposal
for the research project in CS/EE 145 in the Spring term.
Text
- Text: "A Concise Introduction to Networking"
by Jean Walrand and Shyam Parekh, Berkeley, 2009
- References:
- Bersekas and Gallager, Data Networks, 2nd Ed, 1997
- Kurose and Ross, Computer Networking, recent ed (5th in 2009)
Project
Grading
Homework will be assined and usually due in Wed classes
at the beginning of the class
(see schedule below and updates in lectures).
- Homework: 50%
- Project: 50%
- Weekly update: 10%
- Correctness and quality: 30%
- Presentation and documentation: 10%
Collaboration
The only way to learn well in this class is to go through the problems
and project yourself. Therefore, no collaboration is allowed
on homeworks or across project team (students in the same
project team of course must collaborate closely with each other).
You are encouraged to discuss the course materials with any fellow
student to deepen your understanding, but must solve the problems
yourself.
|
Schedule (tentative)
|
| Week |
Topic |
Homework |
Project milestone |
Notes |
| 9/29 |
Organization; Ch 1 Internet |
|
Project description |
No class on 10/2 Fri
Basic concepts: host, router, link, packet switching,
addressing, DNS. Routing. Error detection. ARQ.
Congestion control.
|
| 10/5 |
Ch 2 Principles;
Ch 5.1-5.2 Routing |
HW 1 (due Wed 10/7)
|
M1: Project group & organization |
Sharing. Metrics. Little's Theorem, M/M/1 queue.
Scalability. Layering.
Application topology: client-server, p2p, CDN, cloud computing.
M/M/1/K, generalization of Little's Theorem, Jackson network.
Inter-domain routing: transit, peering, path-vector
routing.
|
| 10/12 |
Ch 5.3-5.4 Routing |
|
M2: Project plan & schedule |
No class on 10/14 Wed
Shortest-path routing: Dijkstra, Bellman-Ford.
FEC.
|
| 10/19 |
Ch 6 Internetworking
Ch 7.1 - 7.3 Transport |
HW 2 (due Mon 10/19 @5pm)
|
M3: Simulator architecture, module spec & owners |
Network coding. Internetworking: addresses, subnets,
subnet masks,
gateway router, ARP. Putting it all together (W&P, P5.3): BGP,
RIP/OSPF, STP (Spanning Tree Protocol). Dynamic routing:
instability (HW3), inefficiency (Braess's Paradox).
Transport basics: ports, flow ID, header, connection setup;
ARQ: stop-and-go, go-back-N, selective repeat, timeout;
|
| 10/26 |
Ch 7.4-7.6 Transport
TCP Intro
|
HW 3 (due Mon 10/26 @5pm)
|
|
Congestion control: Window control (ARQ, ack-clocking),
flow vs congestion control, AIMD, slow-start, FR/FR,
TCP Reno.
Math models of TCP congestion control:
throughput formula x = a / (T sqrt(p)), duality model of
TCP Reno, Vegas, FAST;
|
| 11/2 |
Ch 8 Models |
|
M4: Version 1.0 |
General network model for congestion control; Dynamical systems basics:
existence and uniqueness of solution to x-dot = f(x), equilibrium,
stability, Lyapunov stability theorem, LaSalle's theorem.
|
| 11/9 |
Ch 8 Models
Ch 3 Ethernet |
|
|
Convex optimization basics: convex set, convex function,
KKT optimality condition, duality. Application to congestion
control.
|
| 11/16 |
Ch 3 Ethernet
Ch 4 WiFi |
HW 4 (due Fri 11/20 in clasee)
| M5: Version 2.0 |
Ethernet: Aloha (CSMA), cable Ethernet (CSMA/CD), hub, switch;
binary exponential backoff algorithm, Spanning-Tree Protocol,
maximum throughput of slotted and unslotted CSMA.
|
| 11/23 |
WiFi and WiMax (Ch 4 & Ch 9) |
|
M6: Experiments, measurements, analysis |
|
| 11/30 |
Ch 10 QoS, or
Ch 12 Additional Topics |
HW 5 (W&P):
P3.2, P3.4, P3.5, P3.6, P3.7
|
Tentative project proposal for CS/EE 145 (Spring)
|
|
| 12/7 |
Final week |
|
Project presentation & demo
|
|
|
|
