Graduate

Summary of Course Content
I. Overview of computer networks

II. Application Layer
A. Client-server model
B. Socket and related system calls
C. HyperText Transfer Protocol (HTTP)
D. File Transfer Protocol (FTP)
E. Domain Name Service (DNS)
F. Peer-to-peer model

III. Transport Layer
A. Priciples of reliable data transfer
B. Connection-oriented transport (TCP)
C. Principles of congestion control
D. TCP congestion control

IV. Network Layer
A. Routing principles
B. Internet Protocol
C. Routing in the Internet
D. Router architectures
E. Multicast routing

V. Local Area Networks
A. Multiple access protocols and LANs
B. Ethernet and token ring
C. Aysnchronous Transfer Mode (ATM)

VI. Delay Models
A. Little's Theorem
B. M/M/1 system
C. Generalized state dependent arrival and service system
D. M/G/1 system
E. Polling system
F. Random access system

VII. Multimedia Networking
A. Multimedia applications
B. RTP and RTSP
C. IP Telephony using best effort service
D. Beyond best-effort
E. QoS architecture

Laboratory/Project/Term Paper:

Students work individually or in small groups on a course project. The projects will complement and extend the lecture material. The project may include: (1) implementation of a network protocol, or (2) proposal/design of a new protocol or extension of an existing one followed by its evaluation via computer simulation (and mathematical analysis, whenever possible). Students therefore gain hands-on experience in network protocol design, development, and analysis.

Engineering Design Statement:

The course project includes design, development, and implementation issues in computer network protocols and architectures. Lectures discuss various design issues in computer networks, implementation of the protocols, and tradeoffs between various performance measures such as delay and thruput. The homework and exam problems are based on design issues discussed in lecture.

Illustrative Reading
Textbooks:

J.E. Kurose and K.W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, Addision-Wesley, 2000

D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1992

W. Stallings, Local and Metropolitan Area Networks, fifth edition, Prentice Hall, 1997

References:

Selected papers from the recent literature.

Potential Course Overlap
There is no significant overlap with other courses since this course builds the foundation for advance networking courses.

Summary of Course Content
I. OS Structure
Monolithic and Structured Kernel, Micro-Kernel, Processes, Threads, Events, Servers, OS Extensibility

II. Scheduling and Process Control
Context Switching, Process Management, Scheduling Algorithms, Interrupt, Device Drivers

III. Concurrency Control and Recovery
Synchronization, Deadlock, Priority Inversion, Fault Tolerance and Recovery

IV. File/Storage Systems and Memory Management
Disk Management, I/O Subsystems, Virtual Memory Management, Distributed Shared Memory, Security and Access Control, File System Structure, Distributed File Systems

V. Performance Evaluation and Monitoring VI. Special OS Topics
Communication Models, Domain-specific Operating Systems (Real-time, Embedded, Network OS, etc.) , Distributed operating systems, Distributed system issues, Embedded systems, Real-time systems, and NPU (Network Processor Unit)

Programming Projects:

The instructor will assign two problems during the quarter, one will be related to scheduling and concurrency and the other will be related to memory management or file systems. The two programming assignments will give students an opportunity to understand the principles deeply.

Illustrative Reading
Deitel, Deitel, and Chofnes, Operating Systems, 3rd edition, Prentice-Hall, 2004, ISBN:0-13-124696-8

Potential Course Overlap
There is no significant overlap with other courses.

Summary of Course Content
I. Fundamental Concepts
A. Programming logics
1) Program notation
2) Inference rules for proof outline logic (PL)

B. Sequential programming
1) Invariants
2) Proofs in PL
3) Weakest precondition
4) Program derivation

C. Processes and Process Interaction
1) Concurrency
2) Interference
3) Synchronization
4) Critical section problem

II. Synchronization Based on Shared Variables
A. Busy Waiting
1) Techniques
2) Correctness proofs

B. Semaphores
1) Derivation method
2) Change of variables method
3) Passing the baton method

C. Conditional critical regions
1) Concepts
2) Proof rules
3) Implementation

D. Monitors
1) Concepts
2) Formal semantics
3) Derivation method
4) Implementation
5) Alternative signaling methods

III. Synchronization Based on Message Passing
A. Asynchronous message-passing
1) Naming
2) Synchronization
3) Conversations
4) Implementations

B. Synchronous message-passing
1) Remote procedure call
2) Rendezvous

C. Remote operations
1) Generating invocations
2) Servicing invocations

D. Distributed synchronization
1)Time
2)Clocks

Homework:

Each homework set includes programming problems (see Laboratory section below) in addition to problems dealing with program derivation, correctness proofs, developing inference rules and implementation techniques.

Laboratory:

Students work individually or in small groups on several programming problems, which are an integral part of the homework sets. These projects are designed to reinforce and complement the lecture material. The specific problems are programmed using the JR concurrent programming language. For shared variables, semaphores, and rendezvous problems, students write programs in native JR. For CCRs (Conditional Critical Regions), monitors, and CSP (Communicating Sequential Processes) problems, students write programs using preprocessors for JR that support those notations. Students therefore gain hands-on experience in using a wide range of synchronization mechanisms.

Engineering Design Statement:

The course material includes design and implementation issues in concurrent programming. Lectures discuss various synchronization mechanisms, how they are implemented, and the tradeoffs (usability, efficiency, etc.) between them. The homeworks sets including the laboratory problems follow these themes too. They also examine in detail the different programming styles that result in using the different constructs. Homework sets grades are based in part on these design issues. Examination questions are based on design issues discussed in lecture and from the homeworks.

ABET Category Content:

Engineering Science: 2 units
Engineering Design: 2 units

Illustrative Reading
G.R. Andrews, Concurrent Programming: Principles and Practice, Benjamin/ Cummings, 1991

R.A. Olsson and A.W. Keen, The JR Programming Language: Concurrent Programming in an Extended Java (draft)

Potential Course Overlap
There is no significant overlap with any other course.

Summary of Course Content
I. Introduction
A. Overall compiler organization: frontend, backend
B. Intermediate representation: high-level, low level
C. Backend organization

II. Control-Flow Analysis
A. Basic blocks
B. Control-flow graph
C. Dominators
D. Loops
E. Call graph
F. Program profiling

III. Control-Oriented Optimizations
A. Local Instruction Scheduling
B. Global Instruction Scheduling
C. Branch Alignment
D. Procedure ordering
E. Unreachable Code Elimination

IV. Loop-Oriented Optimizations
A. Loop-Invariant Code Motion
B. Induction Variable Elimination
C. Loop Unrolling
D. Modulo Scheduling
E. Loop Reversal, Interchange, Pealing, Fission, Fusion, Unswitching, Collapsing

V. Data-Flow Analysis
A. Data Dependence
B. Aliasing
C. Static Single Assignment
D. Reaching Definitions
E. Def-Use Chains, Use-Def Chains
F. Bit-Vector Iterative Analysis
G. Live-Range Analysis (Web Analysis)
H. Symbolic-Register Renumbering, Interference
I. Available Expressions
J. Value Numbering

VI. Data-Oriented Optimizations
A. Dead-Code Elimination
B. Copy propagation
C. Code Hoisting/Sinking
D. Common Sub-Expression Elimination
E. Partial Redundancy Elimination
F. Strength Reduction
G. Register Allocation

Illustrative Reading
K.Cooper and L. Torczon, Engineering A Compiler (chapters 8-13), Morgan Kaufmann, 2003
Plus papers from the literature.

Potential Course Overlap
There is no significant overlap with another course.

Summary of Course Content
I. Introduction to computer security

II. Overview of intrusion detection methods

III. The many threats computers and networks are vulnerable to

IV. Anomaly detection

V. Misuse detection

VI. Machine learning methods with application to intrusion detection

VII. Correlation methods to detection multi-stage attacks

VIII. Traceback methods

IX. Automated response

Computer Usage:

Project, primarily to research and acquire an existing intrusion detection tool, and to modify it to meet a threat for which the tool was not intended to apply.

Illustrative Reading
E. Amoroso, Intrusion Detection: An Introduction to Internet Surveillance, Correlation, Trace Back, Traps, and Responses, Intrusion.Net Books, Sparta, New Jersey, 1999

Potential Course Overlap
ECS 236 is an advanced and specialized class in computer security, emphasizing the new area of intrusion detection which uses concepts from other disciplines, including artificial intelligence, programming languages, statistics, operating systems, networks, and theory of computing. It naturally complements ECS 235, which is a general overview of computer security; ECS 235 provides good background for ECS 236, but not all that is covered in 235 is essential. No other courses constitute a significant overlap.

Summary of Course Content
I. Introduction: what is security, policies, risk analysis, humans and procedural/operational security; principles of secure design

II. Foundations: access control matrix, Harrison-Ruzzo-Ullman result, Take-Grant Protection Model, other models

III. Policies and precision; policy languages

IV. Confidentiality policies: Bell-LaPadula, System Z

V. Integrity policies: Biba, Lipners access control matrix model, Clark-Wilson

VI. Hybrid policies: Chinese Wall, Clinical Information Systems Security, Role-based access control

VII. Non-interference and non-deducibility

VIII. Information flow and the confinement problem

IX. Theory of malicious logic: computer viruses, computer worms

Paper/Project:

Paper surveying a topic in computer security in depth (expected length 20 pages) or a project exploring some aspect of the foundations of computer security. These may be individual or group efforts.

Illustrative Reading
M. Bishop, Computer Security: Art and Science, Addison-Wesley 2003 ; various papers

Potential Course Overlap
This course does not overlap with any other course. ECS 153, which mentions one result and gives a very high-level view of some of the models, does not discuss the details of those results, their proofs, or the underlying principles presented in this course, and focuses instead on applications.

Summary of Course Content
1. Introduction: goals of computer security, threat model, principles.

2. Access control: access control lists, capabilities, confinement.

3. Software security: common software vulnerabilities, static analysis, secure coding practices.

4. Mobile code security: Java security architecture, proof-carrying code.

5. Network security: vulnerabilities in the Internet, firewalls, intrusion detection.

6. Cryptography: symmetric key cryptography, public key cryptography, cryptographic protocols, authentication.

7. Malware: propagation, detection, prevention.

8. Anonymity: anonymous routing, servers, and cash.

9. E-voting.

Project:

Each student team is expected to do original research in computer security.

Illustrative Reading
Instructor's notes and research papers

Potential Course Overlap
This is an introductory graduate computer security course, focusing on the application aspect of computer security. This course has little overlap with other courses.