13106 (v.2) Queuing Theory and Applications 401

Area:	Department of Mathematics and Statistics
Credits:	25.0
Contact Hours:	3.0

The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline.

Lecture:	2 x 1 Hours Weekly
Tutorial:	1 x 1 Hours Weekly
Prerequisite(s):	12743 (v.2) Mathematics 278 or any previous version

Syllabus:	Classification of queuing models including applications of computer communication network and local area network. Stochastic process, exponential distribution, Poisson process and their properties. Markov chains, queuing models, Markovian decision processes and their applications.

To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement.

Field of Education:	010101 Mathematics
Funding Cluster:	04 - Mathematics, Statistics
SOLT (Online) Definitions*:	Not Online *Extent to which this unit or thesis utilises online information
Result Type:	Grade/Mark
Availability
Availability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information.

Area: