Varsha Apte
ABSTRACT
This paper presents experiences over thirteen years of teaching a queuing systems-based performance analysis course. We discuss how a 'mathematics first' approach resulted in students not retaining the intuitive concepts of queueing theory, which prompted us to redesign a course which would emphasize the 'common sense' principles of queuing theory as long-term takeaways. We present a sequence of syllabus topics that starts with developing and arriving at a host of queuing systems based insights and 'formulae' without going into the mathematics at all. Our key insight is that in practice, only asymptotic values - at both low and high load - are critical to (a) understand capacities of systems being studied and (2) basic sanity checking of performance measurement experiments. We also present two assignments (one measurement, and one simulation) that we now give, that help in reinforcing the practical applicability of queuing systems to modern server systems. While we do not have formal studies, anecdotally, we have reason to believe that this re-design has helped students retain for the long term, the most essential results of queuing systems, even if they do not study this subject further.
- H. Akimaru and K. Kawashima. Teletraffic: theory and applications. Telecommunication networks and computer systems. Springer-Verlag, 1993.Google Scholar
- V. Apte. Performance analysis of computer systems and networks. Lecture Notes for CS 681, CSE Department, IIT Bombay.Google Scholar
- D. Bertsekas and R. Gallager. Data Networks (2Nd Ed.). Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1992. Google ScholarDigital Library
- M. Harchol-Balter. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, New York, NY, USA, 1st edition, 2013. Google ScholarDigital Library
- D. A. Menasce, V. A. Almeida, L. W. Dowdy, and L. D owdy. Performance by design: computer capacity planning by example. Prentice Hall Professional, 2004. Google ScholarDigital Library
- K. S. Trivedi. Probability & Statistics with reliability, queuing and computer science applications. John Wiley & Sons, 2008.Google ScholarDigital Library
Index Terms
- "What Did I learn In Performance Analysis last year?": Teaching Queuing Theory for Long-term Retention
Recommendations
A discrete-time Markov-modulated queuing system with batched arrivals
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov-modulated process which belongs to the class of discrete batched Markovian arrival processes. The server ...
Analysis of a last come first served queueing system with customer abandonment
Motivated by manufacturing and service applications, we consider a single class multi-server queueing system working under the LCFS discipline of service. After entering the queue, a customer will wait a random length of time for service to begin. If ...
An Upper Bound Solution for Homogeneous Fork/Join Queuing Systems
In this paper, we use dynamic-bubblesort technology [4] to analyze general first-in-first-out K-queue homogenous fork/join queuing (HFJ) systems for any K \ge 2. Jobs arrive with a mean rate \lambda and a general arrival distribution. Upon arrival, a ...
Comments