EECS 148 Introduction to Computer Networks

Course Outline
Course Policies
Problem Sets
Visual Materials
Useful Links

Course Outline

EECS 148 Introduction to Computer Networks (4) S. Network architectures, models, protocols, routing, flow control, and services. Queueing models for network performance analysis.  Prerequisites: EECS 40 or consent of instructor, EECS 112 or consent of instructor, EECS 140 or Mathematics 67. (Design units: 2)





1-3 Introduction 1.1-1.3
Telephone networks circuit switching, TDMA, FDMA 1.4.1
telephone networks
4-11 LANs packet switching 1.4.2, 2.1, 4.1-4.2, 4.7, 4.11
token ring, FDDI 4.3-4.4, 4.9-4.10
Ethernet and token ring performance 4.8-4.9
date to be determined Midterm
12-20 Internet layered architectures & Internet topology 1.4.2, 2.2, 3.1-3.3, 3.4.1, 3.6
routing 3.4.2, 3.7
error control 3.4.3-3.4.5, 3.5
flow control 6.1-6.6, 6.11
21-25 Performance random variables A.1-A.4
packet arrivals and transmissions 9.3
a switch model 9.2.1-9.2.2, B.1
delay, throughput, loss 9.2.2
26-30 ATM protocol stack 1.4.2, 2.3-2.4, 2.5.3, 5.1
routing, switching 5.2, 5.5
service classes 5.3-5.4
6/11/07 4:00-6:00 Final cumulative  

Course Objectives & Outcomes:

Objectives Outcomes
Understand the basic technical components of a different types of networks. Calculate transmission, propagation, and queueing delays.
Analyze LAN medium access protocols, and explain LAN switch and router operation.
Explain Internet addressing and naming, and analyze Internet routing and flow control protocols.
Understand how the architecture of a network relates to the requirements of the target application.
Build basic probability models of network phenomena.
Describe when circuit-switching, packet-switching, and virtual circuit is more appropriate, and explain architectural differences between telephone networks, Internet, and ATM.