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):

7150 (v.7) Statistical Methods 102 or any previous version
AND
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:

10100 Mathematical Sciences (Narrow Grouping)

HECS Band (if applicable):

2

Extent to which this unit or thesis
utilises online information:

Not Online

Result Type:

Grade/Mark

Availability

Year Location Period Internal Area External Central External
2004 Bentley Campus Semester 2 Y    
Area
External
refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research.
Central
External
refers to external course/units run through the Curtin Bentley-based Distance Education Area