||Introduction. Syllabus. Overview and motivation. The telephone network vs. the Internet. Time-division, frequency-division & statistical multiplexing.||P&D: Ch. 1.1 - 1.2|
||Telephone network vs. Internet continued: virtual circuits, packetization, store & forward, packet-switching vs. circuit-switching, end-to-end delay, bandwidth-delay product.||Week 2
Layering and Reliable Delivery
| 9/11||Internetworking basics: definitions, Internet address allocation, Internet routing basics.|| Homework 1 assigned.
Addressing is in P&D: Ch. 4.1.3
| 9/13||Layering. Modularity, decentralization. Hourglass principle. OSI model.|| 9/15||Simple reliability: Stop-and-Wait, timeouts, sequence numbers, throughput. Sliding Window algorithm: windowing, cumulative acknowledgments.||P&D: Ch. 2.5||Week 3
Transport Level Issues and Transport Protocols
| 9/18||Pipelined reliability: Static sliding window: algorithm and performance. Sliding window example. Using sequence numbers and setting window sizes.|
| 9/20||Simple (EWMA) RTT estimation. Basics of congestion control. User Datagram Protocol (UDP). UDP packet format and packet processing, encapsulation, ports.|| P&D: Ch. 5.1 |
Homework 1 due.
| 9/22||UDP checksums, UDP vs. TCP. TCP objectives, TCP segments, TCP header format, three-way handshake.|| P&D: Ch. 5.2 |
| 9/25||TCP state diagram. TCP flow control and interface with the application.|
| 9/27, |
|Example of flow control operation. Using TCP & UDP: Sockets in BSD UNIX, socket system calls.||HW 2 assigned.|
|Week 5 |
TCP Internals (continued)
| 10/2||Better RTT estimation and setting timeout values (Jacobson, Karn & Partridge). Intro to TCP congestion control.|
| 10/4||Slow start vs. steady-state AIMD. Fast retransmit and fast recovery. Flow control vs. congestion control.|| P&D: Ch. 6.3 |
| 10/6||Discussion of Programming Assignment 1. Motivation of forwarding, routing and contention resolution. Virtual circuits.|| PA 1 assigned |
HW 2 due
Forwarding and Routing
| Tues., 10/10||Virtual circuits, connection-oriented forwarding. datagram forwarding, source routing. Intro to intradomain routing algorithms.||P&D: Ch. 3.1|
| 10/11||Routing algorithms: Distance-vector, routing loops, breaking loops. Split horizon and poison-reverse. Link-state routing and Dijkstra's algorithm.||P&D: Ch. 4.2|
| 10/13||Introduction to switch fabrics. Input and output buffering. Analysis of throughput through a crossbar.|| P&D: 3.4.1 - 3.4.3 |
HW 3 assigned
|Week 7 |
Switching & Internetworking
||Crossbar design, cont: Output buffer design issues, building a knockout switch. IP and its objectives. IP packet format, encapsulation.|| 10/18, 10/20
|| IP fragmentation and reassembly. IP and ARP.
ICMP error reporting.
||P&D: Ch. 4.1 - 4.2|
|Week 8 |
||ARP, RARP, Dynamic Host Configuration Protocol (DHCP), Intro to Mobile IP.||Homework 3 due|| 10/25
|| Mobile IP concepts, example of Mobile IP in practice,
|| PA1 due
In class midterm.
|| Class cancelled.
||Midterm returned. Answers to questions on the midterm.||
||Efficient use of Internet addresses: subnetting and supernetting. Use of subnet masks. CIDR for classless addressing.|| P&D: Ch. 4.3
||Week 10 |
Internetworking & Multicast
||Issues of scale in wide-area network routing. Brief survey of BGP. Issues in IPv6: protocol changes, incremental deployment.|| P&D: Ch. 4.3
||Guest lecture by Paul Barford on issues in wide-area network measurement.|| 11/10
||Motivation and applications for multicast. Intro to IP Multicast. Multicast addressing, the MBone, tunneling between multicast-enabled routers.||P&D: Ch. 4.4 (incomplete coverage)||Week 11 |
More on Multicast
||Multicast session management and delivery strategies: spanning tree, reliable flooding, reverse-path forwarding. IGMP, PIM-SM.|| P&D: Ch. 4.3
||Issues and techniques in reliable multicast: ACK implosion, hierarchical multicast, use of forward error correction (parity packets).|| 11/16
|| Issues at the physical Layer: Manchester vs. NRZ vs. 4B/5B encoding.
Intro to media access protocols. Ethernet intro and Ethernet framing.
||P&D: Ch. 2.2, 2.6||Week 12 |
||Motivation for and performance analysis of Ethernet's CSMA/CD protocol. exponential backoff.|| P&D: 2.6 (partial coverage)
|| 11/22, 11/24
||Thanksgiving Holiday||Homework 4 due by noon on 11/22.||Week 13 |
MAC Layer Protocols (cont.)
||FDDI. Configuration, fault-tolerance and frame formats. Token-based access, synchronous vs. asynchronous traffic, bidding for token rotation time.|| P&D: Ch. 2.7
||Wireless (802.11). Collision avoidance with MACA(W). RTS and CTS handshake. Hidden node and exposed node problems. Interaction between mobile hosts and wired access points.|| 12/1
||Cyclic redundancy checksums (CRC). Intro to compression. Example with Huffman codes.||P&D: Ch. 4.4 (incomplete coverage)||Week 14
Provisioning for Real-time Traffic + Integrated Services
|12/4||Compressing and encoding of images and video streams. Techniques used in JPEG and MPEG standards. Networking implications.||
P & D: Chapter 9.2
||12/6||Requirements of real-time applications. Quality of service guarantees, rate- and delay-adaptivity, elasticity, admission control.||
P & D: Chapter 6.5
PA2 due on 12/8.
|12/8||Course overview in conjunction with application level protocols. DNS: mapping hostnames to IP addresses. Steps in executing an ftp transfer.||
P & D: Chapter 9.1
Last day of class.
Course overview in conjunction with application level protocols (cont):
SMTP. HTTP: Persistent connections and caching.
Recap of hourglass model and implications.
|  HW5 (optional) due on 12/11.|