TCOM 501 - Networking-Theory and Fundamentals

Institution:

University of Pennsylvania

Subject:

Description:

Prerequisite(s): ESE 530 or STAT 530 or equivalent. Stochastic processes are introduced as drivers of queues to provide an analytical platform for the analysis of delays in networks models. Topics covered are selected from: Delay models in the network layer; the Poisson process; renewal processes, rewards, and the renewal theorem; Little's law; Markov chains; semi-Markov processes; Markov processes; ergodicity, limit laws and stationary distributions; M/M/1, M/M/m, M/M/m/m queues; alternating renewal processes and fluid flow models; M/G/1, G/M/1, G/G/1 queues; the Pollaczek-Khinchin formulae; priority classes; timereversibility; networks of queues; Jackson networks.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.upenn.edu

Phone Number:

(215) 898-5000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.