Aims/Description: This module considers the performance of computer networks from a statistical aspect, using queuing theory. It is shown that the performance of a computer network depends heavily on the traffic flow in the network, and different models of traffic and queues are used. These include single-server queues, multiple server queues, and the concept of blocking is discussed. Although the analysis is entirely statistical, all the relevant background is provided in the lectures, such that the course is entirely self-contained. Problem sheets are provided in order to assist you with the course material. You should be aware that there are limited places available on this module.
Restrictions on availability: The course requires basic probability theory and knowledge of arithmetic and geometric progressions. This knowledge is basic and it is covered in all undergraduate engineering and physics degrees.
Notes: This unit forms part of an accredited degree programme
Information on the department responsible for this unit (Computer Science):
URLs used in these pages are subject to year-on-year change. For this reason we recommend that you do not bookmark these pages or set them as favourites.
Teaching methods and assessment displayed on this page are indicative for 2021-22. Students will be informed by the academic department of any changes made necessary by the ongoing pandemic.