Course10610123820 lectures
Introduction to Computer and Network Performance Analysis using Queuing Systems
Prof. Varsha Apte · IIT Bombay
About
Analyzing the performance of any computer or networked system: such as Web application servers, packet scheduling disciplines, operating system schedulers, cellular telephony networks is an important step in the design and deployment of such systems. Performance of many systems can be measured, but a sound basis in queuing system models is required for two important aspects: 1) to ensure that the performance tests are performance field data is correct, and 2) for predicting the performance of a system in a scenario that cannot be measured. The theory of queues is a mathematical theory that helps model a wide range of computing and networking systems with a common abstraction of a queuing system. In this course, you will learn the most basic results in queuing systems, in an intuitive way, and learn how to apply them to computer and network systems performance. The focus in this short course will be on being able to reason about asymptotic values of performance metrics at high loads and low loads, which is very useful in validating results of performance tests. Practical examples of performance analysis of networked servers (e.g. a Web server), of packet network links, of cellular networks etc, will be provided. A case study of interpreting the load test results of a simple Web Server using the framework of queuing systems will be covered throughout the course.
Intended audience: 4th year undergraduates or post-graduates in Computer Science and Engineering, IT industry professionals engaged in computer applications performance testing and evaluation.
Prerequisites: At least 3rd year UG in CSE Pre-requisite Courses : Operating Systems and Computer Networks.INTENDED AUDIENCE: 4th year undergraduates or post-graduates in Computer Science and Engineering, IT industry professionals engaged in computer applications performance testing and evaluation.
Lectures
Week 1
- Lecture 1.1 - Introduction, why do delays happen, contention for resources
- Lecture 1.2 - Performance metrics and parameters
- Lecture 1.3 - Introducing Queuing Systems
- Lecture 1.4 - Memoryless Distributions
- Lecture 1.5: Operational Laws
Week 2
- Lecture 2.1 - Asymptotic Analysis of G/G/1, G/G/1/K queues
- Lecture 2.2 - Asymptotic Analysis of G/G/c/K queues
- Lecture 2.3 - Little's Law
- Lecture 2.4 - Little’s Law examples and A Case Study of Open Load test on a Web server
- Lecture 2.5 - Some results for M/G/1 queue and Memoryless Arrivals
Week 3
- Lecture 3.1 - Continuing the Case Study of Open Load test on a web server (Response Time)
- Lecture 3.2 - Open queuing networks - tandem queuing network
- Lecture 3.3 - Open queuing networks - general (Jackson) queuing networks
- Lecture 3.4 - Open queuing networks - examples
- Lecture 3.5 - Closed Queuing Systems
Week 4
- Lecture 4.1 - Closed Queuing System (continued)
- Lecture 4.2 - Case study of Closed Load Test on a Web Server
- Lecture 4.3 - General formulation of Jacksonian Closed Queuing Networks
- Lecture 4.4 - Mean Value Analysis for Closed Queuing Networks
- Lecture 4.5 - Mean Value Analysis examples, Case Study of a Load test on a web server, and Closing Remarks.
Syllabus and materials
At NPTEL, as the course publishes them.
Credits and licence
- Institution
- IIT Bombay
- Department
- Computer Science and Engineering
- Teacher
- Prof. Varsha Apte
- Level
- Undergraduate
- Language
- English
- Subjects
- Computer science, Engineering
- Source
- NPTEL
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed