Updates on the campus response to coronavirus (COVID-19)

ECE Course Syllabus

ECE6608 Course Syllabus


Performance Analysis of Communications Networks (3-0-3)

ECE 6601 and ECE 6607


Catalog Description
Fundamental concepts of queueing systems, and applications of queueing theory to the performance evaluation of computer networks

Bertsekas & Gallager, Data Networks (2nd edition), Prentice Hall, 1992. ISBN 9780132009164 (required)

Topical Outline

Basic Queueing Models
-Little's Law
-System Utilization

Review of Random Processes
-General Overview
-Types of Discrete State Space Processes
-Markov Processes (Chains) (Discrete Time)
-Continuous Time Markov Chains

Birth-Death Queueing Systems
-Birth-Death Processes
-Special Cases of Birth Death Processes
-M/M/1 Queueing System

-M/M/m (The m-server case)
-Erlang-C Formula
-M/M/1/K (Finite Sotrage)
-M/M/m/m (m-Server Loss Systems)
-Erlang-B Formula
-M/M/1/-/M (Finite Customer Population-Single Server)
-M/M/inf/-/M (Finite Customer Population)
M/M/m/K/M (Finite Population, m-server Case)

Networks of Queues
-Two-Node Tandem Networks
-General Queueing Networks

M/G/1 Queueing Systems
-Overview of Solution Techniques
-Method of Imbedded Markov Chains
-Pollaczek-Khinchine Formula
-Mean Residual Time in M/G/1 Systems

Performance Analysis of Random Access Networks
-Fixed Assignment Access Methods (FDMA, TDMA)
-Time Random Multiple Access (TRMA) (Aloha; Slotted Aloha)
-Carrier Sense Multiple Access (CSMA) Protocols
-CSMA/CD Protocol

Performance Analysis of Controlled Access Networks (Token Ring)
-Basic Protocol
-Delay Analysis

Performance Analysis of Wide Area Networks (Arpanet; Internet)

Performance Analysis of Personal Communication Systems (PCS)

Performance Analysis of ATM Networks
-Overview of ATM Networks
-Basic Performance Analysis Studies (On/Off Models, MMPP, End-to-End