Course Syllabus Course Information Course Number/Section Course Title Term Days & Times Professor Contact Information Professor Email Address Office Location Office Phone Office Hours

CS/CE 6352-001 Performance of Computer Systems and Networks Fall 2014 TuTh 1:00 pm - 2:15 am, ECSS 2.311

Jason Jue jjue@utdallas.edu ECSS 4.408 (972) 882-4429 TuTh 2:15 pm - 3:15 pm, or by appointment

Course Pre-requisites, Co-requisites, and/or Other Restrictions A first course on probability theory. Course Description Overview of case studies. Brief review of probability theory. Queueing models and physical origin of random variables used in queueing models. Various important cases of the M/M/m/N queueing system. Little's law. The M/G/1 queueing system. Discrete time queueing systems. Simulation of queueing systems. Product form solutions of open and closed queueing networks. Convolution algorithms and Mean Value Analysis for closed queueing networks. Student Learning Objectives/Outcomes Ability to understand and apply M/M/1 queueing models Ability to understand and apply Little’s result for FIFO and non-FIFO queues Ability to understand and apply continuous parameter Markov chains and state dependent queueing models Ability to understand and apply M/G/1 queueing models Ability to understand and apply discrete parameter Markov chains and discrete-time queueing models Ability to understand and apply continuous-time open queueing network models Ability to understand and apply continuous-time closed queueing network models Application of the above concepts in computers and computer networks Required Textbooks and Materials Thomas G. Robertazzi, Computer Networks and Systems: Queueing Theory and Performance Evaluation, Third Edition, Springer-Verlag, 2000. Suggested Course Materials Trivedi, Probability & Statistics with Reliability, Queueing and Computer Science Applications,