Registry

Module Specifications

Archived Version 2015 - 2016

Module Title	Data Network Protocol Analysis & Simulation
Module Code	EE509
School	School of Electronic Engineering
Online Module Resources
Module Co-ordinator	Dr Jennifer McManis	Office Number	S330
NFQ level	9	Credit Rating	7.5
Pre-requisite	None
Co-requisite	None
Compatibles	None
Incompatibles	None

Description

The ability to predict how a data communications network will perform in terms of delay, throughput or packet loss is an important aspect of the engineering practice of computer and telecommunications network design. Given the complexity of operation of communications protocols, coupled with the randomness of data traffic transported by a network, gaining a reliable estimate of system performance requires careful analysis with appropriate modelling techniques. The aim of this module is to firstly review the operating principles of data communications protocols and then to develop the basic theory and practice required for evaluating the performance of communications systems and data networks, using discrete-state mathematical and computer simulation modelling methods.

Learning Outcomes

1. apply the basic analytic methods of probability and queueing theory to calculate the performance characteristics of a range of communications systems, including circuit switches, packet switches, optical WDM switches and polling and random access networks,
2. design and implement a disrcete-event computer simulation model for performance evaluation of a data communications network and be able to analyse the simulation output using statistical methods,
3. apply modelling methods to basic communication systems to determine the required system resources (e.g. communications channel bit rate) necessary to achieve a desired level of performance,
4. compare the achievable accuracy of the results from simulation models to that of analytic models that employ approximations to achieve a tractable solution,
5. determine the fundamental effects of different traffic types on system performance.

*Type*	*Hours*	*Description*
Workload	Full-time hours per semester
Lecture	36	No Description
Assignment Completion	40	For the simulation assignment you will write your own basic discrete event simulator. Java is the supported language, but it is possible to complete the assignment in another language such as C or C++.
Directed learning	3	No Description
Independent Study	109	No Description
Total Workload: 188

All module information is indicative and subject to change. For further information,students are advised to refer to the University's Marks and Standards and Programme Specific Regulations at: http://www.dcu.ie/registry/examinations/index.shtml

Indicative Content and Learning Activities

Review of Data Network Protocols and Introduction to Performance Evaluation
Network layer functions and an intrduction to circuit and packet switching, link layer protocols, IP, routing, TCP, and application protocols. Future network trends. Motivation for the use of analysis and simulation methods: performance measures, resource allocation/dimensioning, deployment costs.

Mathematical Fundamentals for Performance Analysis
Probability spaces, probability functions, random variables, moments and moment generating functions, probability laws, stochastic processes, renewal processes, Poisson process, Markov processes and discrete-time and continuous-time Markov chains and application examples, Birth-Death processes.

Discrete-Event Stochastic Simulation Methods
Introduction to simulation modelling methodologies, random variates, pseudo-random number generators, non-uniform variates: inverse transform sampling and rejection sampling, event-lists, event scheduling and implementation, simulation validation, confidence intervals, and analysis of results.

Queueing Analysis Methods
Performance measures and objectives, Kendall's notation, Little's law, Markovian queueing systems, M/M/1, M/M/infinity, M/M/n, M/M/1/K, M/M/m/m, priority queues, the M/G/1 and M/D/1 queue. Product-Form Queueing networks. Application to communications sytems performance analysis.

Analysis of Loss Systems
Erlang-B and numerical solutions, overflow analysis, Equivalent Random Theory, optical switching application example.

Analysis of Medium Access Protocols
LAN/MAN random access and polling networks, Aloha and slotted Aloha, CSMA/CD and ethernet.

Traffic Characteristics
Non-Markovian traffic, Interrupted Poisson Process, long-tailed traffic, effective bandwidth.

Introduction to Network Dimensioning and Optimisation
Basic graph theory, network flow and capacity problems, resource allocation and optimisation.

Assessment Breakdown
Continuous Assessment	25%	Examination Weight	75%

Type	Description	% of total	Assessment Date
Course Work Breakdown

Reassessment Requirement
Resit arrangements are explained by the following categories; 1 = A resit is available for all components of the module 2 = No resit is available for 100% continuous assessment module 3 = No resit is available for the continuous assessment component
Unavailable

Indicative Reading List

Robert Cooper: 1981, Introduction to Queueing Theory, 2, North Holland (Elsevier),
Harry Perros: 0, Computer Simulation Techniques--The Definitive Introduction, http://www4.ncsu.edu/~hp/books.html,
Joseph Hammond and Peter O'Reilly: 1986, Performance Analysis of Local Computer Networks, Addison-Wesley,
Giovanni Giambene: 2005, Queing Theory and Telecommunications: Networks and Applications, Springer Science+Business Media Ink.,

Other Resources

None

Programme or List of Programmes

GCES	Grad Cert. in Electronic Systems
GCTC	Grad Cert. in Telecommunications Eng.
GDE	Graduate Diploma in Electronic Systems
GTC	Grad Dip in Telecommunications Eng
MEN	MEng in Electronic Systems
MEQ	Masters Engineering Qualifier Course
MTC	MEng in Telecommunications Engineering

Archives: