307638 (v.1) Networking Theory and Fundamentals 601

Area:

Department of Electrical and Computer Engineering

Contact Hours:

4.0

Credits:

25.0

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

Queueing Systems including - systems of flow, specification and measure, notation and structure, definition and classification of stochastic processes, Little's result, birth-death processes, transform methods, solution of differential-difference equations, 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 queueing systems, M/G/1 queueing systems, Burke's theorem, Jackson's theorem, circuit and packet switching, origin of the PSTN(public switched telephone network). 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, routing constraints.

Availability

Year	Location	Period	Internal	Area External	Central External
2004	Bentley Campus	Semester 1	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

Click here for a printable version of this page

Picture of sun setting over Henderson Court on Curtin's Bentley Campus