|
Course MQSN: Markovian Queues and Stochastic Networks
Important informationParticipants of this course: please see the lecturer's website. There you may find announcements (including deadlines), lecture notes, additional material, slides, old videos, and exercise sets, among other information.Course descriptionComplex stochastic systems, like communication systems, computer networks and manufacturing systems, may often be modeled as queueing networks with multiple nodes and/or multiple classes. The performance of these systems may be evaluated in terms of queue lengths, sojourn times or blocking probabilities. This course focuses on basic queueing networks for which performance measures can be obtained in closed form. First, the course focuses on a class of networks where the equilibrium distribution has a so-called product-form solution. Topics include the output theorem, reversibility, partial balance, quasi reversibility and product-form. Examples include Jackson networks, Kelly-Whittle networks, BCMP networks, loss networks and processor sharing networks. Second, the course considers the sojourn time distribution in simple networks. Third, computation of performance measures often requires effcient algorithms. To this end, Mean Value Analysis and approximation techniques will be studied.Detailed content
Literature
PrerequisitesThe participants should have followed courses in probability theory, stochastic processes and queueing theory.ExaminationTake home problems.Address of the lecturerProf.dr. R.J. BoucherieStochastic Operations Research; Department of Applied Mathematics; Faculty of Electrical Engineering, Mathematics, and Computer Science; University of Twente P.O. Box 217 NL-7500 AE Enschede Phone: 053-4893432 Email: r.j.boucherie@utwente.nl |