Performance Analysis of Communications Networks


CMPE Degree: This course is Not Applicable for the CMPE degree.

EE Degree: This course is Not Applicable for the EE degree.

Lab Hours: 0 supervised lab hours and 0 unsupervised lab hours.

Technical Interest Group(s) / Course Type(s): Telecommunications

Course Coordinator:

Prerequisites: ECE 6601 and ECE 6607

Corequisites: None.

Catalog Description

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


Data Networks

Course Outcomes

Not Applicable

Student Outcomes

In the parentheses for each Student Outcome:
"P" for primary indicates the outcome is a major focus of the entire course.
“M” for moderate indicates the outcome is the focus of at least one component of the course, but not majority of course material.
“LN” for “little to none” indicates that the course does not contribute significantly to this outcome.

1. ( Not Applicable ) An ability to identify, formulate, and solve complex engineering problems by applying principles of engineering, science, and mathematics

2. ( Not Applicable ) An ability to apply engineering design to produce solutions that meet specified needs with consideration of public health, safety, and welfare, as well as global, cultural, social, environmental, and economic factors

3. ( Not Applicable ) An ability to communicate effectively with a range of audiences

4. ( Not Applicable ) An ability to recognize ethical and professional responsibilities in engineering situations and make informed judgments, which must consider the impact of engineering solutions in global, economic, environmental, and societal contexts

5. ( Not Applicable ) An ability to function effectively on a team whose members together provide leadership, create a collaborative and inclusive environment, establish goals, plan tasks, and meet objectives

6. ( Not Applicable ) An ability to develop and conduct appropriate experimentation, analyze and interpret data, and use engineering judgment to draw conclusions

7. ( Not Applicable ) An ability to acquire and apply new knowledge as needed, using appropriate learning strategies.

Strategic Performance Indicators (SPIs)

Not Applicable

Course Objectives

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