Area: | 
	Department of Electrical and Computer Engineering | 
Credits: | 
	25.0 | 
Contact Hours: | 
	4.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: | 
	1 x 3 Hours Weekly | 
Tutorial: | 
	1 x 1 Hours Weekly | 
Co Requisite(s): | 
	11341 (v.4) Stochastic Processes for Telecommunications Systems 601  or any previous version | 
Syllabus: | 
	Selected topics from Queuing systems - Little's result, birth-death processes, continuous-time Markov chains, the M/M/1 queue, multi-server systems M/M/c, M/M/c/c and M/M/8. Finite-source queuing systems. M/G/1 queuing systems, Burke's theorem, Jackson'stheorem. Networking theory - circuit and packet switching, converged networks - real-time traffic versus data traffic, best-effort service in connectionless networks, connection-oriented communications networks, ATM (asynchronous transfer mode) networks, control/management, sharing of resources, indirect store-and-forward deadlock and routing constraints. Parameter estimation and signal detection theory, advanced signal theory, advanced modulation schemes and information theory. | 
| ** 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: |    031305 Computer Engineering | 
Funding Cluster: |    08 - Engineering, Science, Surveying | 
SOLT (Online) Definitions*: |       Supplemental *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. | |