EE 644 Computer Communication Networks
Spring 2002
Lecture Schedule, Notes, and Reading Assignments

A. Overview of Computer Network Architecture

• A.1. [1/14, mon] Network architecture, TCP/IP, OSI, physical layer. Optional reading: Chapter 1, and review undergraduate probability.
• A.2. [1/16, wed] Data link control layer, synchronization, error control Reading: Section 2.3.
• A.3. [1/18, fri] Media access control sub-layer, network layer, routing. Reading: Section 2.4, up through the subsection on the correctness of stop and wait. WWW sites of interest: .
• Martin Luther King Day. [1/21, mon] No class. Optional Reading: Section 5.1.
• A.3. [1/23, wed] Transport/Session layers, go-back-N ARQ, flow control, Presentation and Application layers. Reading: Continue reading Section 2.4, but stop before "Correctness of go back n".

B. Performance Evaluation Techniques -- Markov chains

• B.1 [1/25, fri] Queueing delay models + Little's theorem. Reading assignment: Sections 3.1 and 3.2. WWW sites of interest: Queueing Humor.
• B.2 [1/28, mon; 1/30, wed] Discrete time markov chains Reading assignment: Appendix A of Chapter 3.
• B.3 [2/1, fri] Poisson arrivals, exponential rvs, continuous markov chains Reading assignment: Introduction of Section 3.3 and Subsection 3.3.1. Do not read Subsections 3.3.2 and 3.3.3 yet.
• B.4 [2/2, sat Holmes 247] Continuous time markov chains Reading assignment: same as for B.3 above.
• B.5 [2/2, sat Holmes 247] M/M/1, M/M/m, M/M/m/m. Reading assignment: Sections 3.4.1-3.4.3.
• B.6. [2/2, sat Holmes 247] Properties of Poisson arrivals -- PASTA property. Reading assignment: Subsections 3.3.2 and 3.3.3.
• B.7 [2/2, sat Holmes 247] Product form + circuit switching models Reading assignment: Section 3.4.4.

C. Performance Evaluation Techniques -- Other methods

• C.1. [2/5 and 2/11, mon] Renewal process + PK formula + G/G/1 formula Reading assignment: Introduction to 3.5, but stopping before Subsection 3.5.1.
• NO CLASS ON 2/6 (WED) AND 2/8 (FRI)
• C.2. [2/13, wed] Multi-user queueing (single user) Reading assignment: Subsection 3.5.1 and start Subsection 3.5.2, but stop before "Multiuser System"
• C.3. [2/13, wed] Multi-user queueing (multi user) Reading assignment: Continue Subsection 3.5.2 until completion.
• C.4. [2/15, fri] Prioritized queueing. Reading assignment: Subsection 3.5.3.
• C.5. [2/22] Networks of queues, time reversibility. Reading assignment: Section 3.6 and 3.7. Optional reading: Section 3.8.
• C.5. [2/22] Leaky-bucket deterministic traffic Reading assignment: Notes.
• C.X [We'll get to this time permitting] Dynamic programming: simple discounted cost models Reading assignment: Notes handed out in class. Optional reading: Bob Givan's home page (See at the bottom of the page under Talks there is an MDP tutorial --- definitions and extensions

D. Media Access Control

• D.1. [2/25] ALOHA - bold poisson assumption Reading assignment: Section 4.1 and Section 4.2 but stopping before Subsection 4.2.3.
• D.2. [2/27] Stabilized slotted aloha and unslotted aloha. Reading assignment: Subsection 4.2.3.
• D.3. [3/1] Splitting algorithms Reading assignment: Section 4.3 but stopping before Section 4.3.2.
• D.4. [3/4] CSMA + CSMA/CD Reading assignment: Section 4.4 but stopping before Section 4.4.4. Subsection 4.5.2 is optional.
• D.5. [3/6] Token ring, token bus, register insertion (cut through routing) Reading assignment: Subsection 4.5.3 but skip the subsection on FDDI. Subsection 4.5.4 but stopping before "Implicit tokens: CSMA/CA".
• D.6. [3/8 and 3/13] Fair access protocols -- SAT and DQDB Reading assignment: Subsection 4.5.5 but stopping before "Homenets".
• Exam 1 [3/11]. This exam wil cover everything and up to and including C.5. This includes the homeworks 1, 2, and 3. You are allowed one sheet (8.5"x11") of notes, front and back. This exam will be in class which means it will be 50 minutes long.

E. Network Algorithms for Control

E.1. [3/15 fri] Graphs -- definitions Reading assignment: Subsection 5.2.1.
• Remember we will cover 3 lectures on 3/16 (saturday) in Holmes 247. The lectures will run from 9:45-11:00, five min break, and then 11:05-12:20.
• E.2. [3/16] Search algorithms + complexity Reading assignment: Notes
• E.3. [3/16] Spanning tree algorithms + proof of Kruskal's algorithm. Reading assignment: Subsection 5.2.2.
• E.4. [3/16 but may not have time for it] Shortest path algorithms + proof of Dijkstra's algorithm. Reading assignment: Subsection 5.2.3 but skip the "Floyd-Warshall algorithm". Optional reading: Section 5.2.5.
• E.5. [If time permits] Broadcasting Reading assignment: Section 5.3 but stopping before Subsection 5.3.3.

F. Optimal Routing

• F.1 [4/5, fri] Characterization of optimal routing Reading assignment: Introduction to Section 5.4, but stop before Subsection 5.4.1. Also, Section 5.5.
• F.2 [4/8, mon] Flow deviation method Reading assignment: Section 5.6.
• F.3 [4/10, wed] Unconstrained optimization (one and two dimensional) Reading assignment: Section 5.7 but stopping before Subsection 5.7.2.
• F.4 [4/12, fri] Unconstrained optimization (multi dimensional) Reading assignment: Same as in F.3.
• F.5 [4/15, mon] Nonlinear optimization over the positive orthant Reading assignment: The rest of Section 5.7.
• F.6 [4/17, wed] Application to optimal routing Reading assignment: Section 5.8.
• Exam 2 [4/17, wed]

G. Flow Control

• G.1 Review of types of flow control, Max-min fair flow control Reading assignment: Sections 6.1, 6.2, 6.3, and 6.5 (but you can skip subsection 6.5.1).
• G.2 TCP and related flow control, throughput models. Reading assignment: Notes.