EE 644 Computer Communication Networks
Spring 1998
Lecture Schedule
Under Construction
Topics
- A. An Overview of Computer Network Architecture (~ 5 lectures)
- Introduction + overview of OSI network model
- Physical layer + DLC (error detection, ARQ)
- DLC (ARQ, framing, synchronization)
- Examples
- Network layer (routing tables and flow control) and up
- B. Performance Evaluation Techniques -- Markov chains
(~ 6 lectures)
- Queueing delay models + Little's theorem
- Discrete time markov chains
- Poisson arrivals, exponential rvs, continuous markov chains
- Continuous time markov chains
- M/M/1, M/M/m, M/M/m/m.
- Product form + circuit switching models
- C. Performance Evaluation Techniques -- Other methods (~ 6 lectures)
- Properties of Poisson arrivals -- PASTA property
- Renewal process + PK formula + G/G/1 formula
- Multi-user queueing (single user)
- Multi-user queueing (multi user)
- Prioritized queueing
- Leaky-bucket deterministic traffic
- D. Local Area Networks (LANs) (~ 6 lectures)
- ALOHA - bold poisson assumption
- Pseudo bayesian
- Delay analysis
- CSMA + CSMA/CD
- Token ring, token bus, register insertion (cut through routing)
- Fair access protocols -- SAT and DQDB
- E. Network Algorithms for Control (~ 6 lectures)
- Graphs -- definitions
- Search algorithms + complexity
- Spanning tree algorithms
- Shortest path algorithms
- Dynamic programming
- Max flow + bipartite matching
- F. Optimal Routing (~ 6 lectures)
- Characterization of optimal routing
- Flow deviation method
- Unconstrained optimization (one and two dimensional)
- Unconstrained optimization (multi dimensional)
- Nonlinear optimization over the positive orthant
- Application to optimal routing
- G. Flow Control (~ 2 lectures)
- Review of types of flow control
- Max-min fair flow control
Lecture Schedule
A. An Overview of Computer Network Architecture
Lecture A.1. (1/12) Introduction. What is a network (packet and circuit
switched) and the service it provides. The layered network architecture.
An quick overview of the OSI network model.
Lecture A.2. (1/14) The Physical Layer. The Data Link Control
Layer (error detection codes, ARQ stop-and-wait).
- Reading: Sections 2.3 and 2.4
Lecture A.3. (1/16) The Data Link Control Layer
(go-back-n ARQ, selective-repeat ARQ, ARPANET ARQ, framing).
Holiday (1/19)
Lecture A.4 (1/21) DLC Example. Frame organization examples.
- Reading: Sections 2.7 and 2.8.
Lecture A.5. (1/23) MAC Sublayer,
Network Layer (routing tables, flow control).
Transport, Session, Presentation, and Application Layers.
- Reading: Sections 1.3.3--1.3.7
Lecture B.1. (1/26) Motivation for queueing theory and Little's
theorem.
- Reading: Sections 3.1 and 3.2
- Homework 3:
Lecture B.2. (1/28) Discrete-time Markov chains.
- Reading: Sections 3A.1, 3A.2, 3A.3
Lecture B.3. (1/30) More on discrete-time Markov chains