<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://classes.engineering.wustl.edu/cse538/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Guerin</id>
	<title>CSE538 Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="http://classes.engineering.wustl.edu/cse538/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Guerin"/>
	<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Special:Contributions/Guerin"/>
	<updated>2026-11-22T01:03:07Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.34.4</generator>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1794</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1794"/>
		<updated>2021-08-17T16:09:35Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;color: red;font-size:200%&amp;quot;&amp;gt;'''NOTE THAT THIS IS NOT THE WIKI FOR THE FALL 2021 EDITION OF THE COURSE, WHICH IS ACCESSIBLE [https://classes.engineering.wustl.edu/cse538-online HERE].'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  That work did not go anywhere as it was caught by the Internet tsunami (to which I also contributed to some extent by co-authoring a few RFCs such as RFC 2212, RFC 2676, RFC 2697, RFC 2698, RFC 2753), but on the modeling front it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** '''Office hours''' 4 times a week on zoom for 45mins slots): &lt;br /&gt;
*** Tuesday 8:00-8:45am &amp;amp; Thursday 8:00-8:45am: [[zoom|zoom info]]&lt;br /&gt;
*** Tuesday 3:00-3:45pm &amp;amp; Thursday 3:00-3:45pm: [[zoom|zoom info]]&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1793</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1793"/>
		<updated>2021-08-17T16:08:32Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red;&amp;quot;&amp;gt;'''NOTE THAT THIS IS NOT THE WIKI FOR THE FALL 2021 EDITION OF THE COURSE, WHICH IS ACCESSIBLE [https://classes.engineering.wustl.edu/cse538-online HERE].'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  That work did not go anywhere as it was caught by the Internet tsunami (to which I also contributed to some extent by co-authoring a few RFCs such as RFC 2212, RFC 2676, RFC 2697, RFC 2698, RFC 2753), but on the modeling front it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** '''Office hours''' 4 times a week on zoom for 45mins slots): &lt;br /&gt;
*** Tuesday 8:00-8:45am &amp;amp; Thursday 8:00-8:45am: [[zoom|zoom info]]&lt;br /&gt;
*** Tuesday 3:00-3:45pm &amp;amp; Thursday 3:00-3:45pm: [[zoom|zoom info]]&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1792</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1792"/>
		<updated>2020-08-04T22:09:51Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red;&amp;quot;&amp;gt;'''NOTE THAT THIS IS NOT THE WIKI FOR THE FALL 2020 EDITION OF THE COURSE, WHICH IS ACCESSIBLE [https://classes.engineering.wustl.edu/cse538-online HERE].'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  That work did not go anywhere as it was caught by the Internet tsunami (to which I also contributed to some extent by co-authoring a few RFCs such as RFC 2212, RFC 2676, RFC 2697, RFC 2698, RFC 2753), but on the modeling front it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** '''Office hours''' 4 times a week on zoom for 45mins slots): &lt;br /&gt;
*** Tuesday 8:00-8:45am &amp;amp; Thursday 8:00-8:45am: [[zoom|zoom info]]&lt;br /&gt;
*** Tuesday 3:00-3:45pm &amp;amp; Thursday 3:00-3:45pm: [[zoom|zoom info]]&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=MediaWiki:Sidebar&amp;diff=1791</id>
		<title>MediaWiki:Sidebar</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=MediaWiki:Sidebar&amp;diff=1791"/>
		<updated>2020-07-23T20:27:02Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
* CSE 538&lt;br /&gt;
** main|Course overview &amp;amp; logistics&lt;br /&gt;
** format|Course structure&lt;br /&gt;
** syllabus|Syllabus &amp;amp; (tentative) schedule&lt;br /&gt;
** slides|Slides&lt;br /&gt;
** online|Docs &amp;amp; online resources&lt;br /&gt;
** homeworks|Homeworks &amp;amp; preview problems&lt;br /&gt;
** exams|Exams &amp;amp; quizzes&lt;br /&gt;
** piazza|Piazza course page&lt;br /&gt;
** CV|Canvas course page&lt;br /&gt;
*** Grades|Grades on Canvas&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
** helppage|help&lt;br /&gt;
* SEARCH&lt;br /&gt;
* TOOLBOX&lt;br /&gt;
* LANGUAGES&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1790</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1790"/>
		<updated>2020-07-17T16:22:24Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Logistics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  That work did not go anywhere as it was caught by the Internet tsunami (to which I also contributed to some extent by co-authoring a few RFCs such as RFC 2212, RFC 2676, RFC 2697, RFC 2698, RFC 2753), but on the modeling front it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** '''Office hours''' 4 times a week on zoom for 45mins slots): &lt;br /&gt;
*** Tuesday 8:00-8:45am &amp;amp; Thursday 8:00-8:45am: [[zoom|zoom info]]&lt;br /&gt;
*** Tuesday 3:00-3:45pm &amp;amp; Thursday 3:00-3:45pm: [[zoom|zoom info]]&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1789</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1789"/>
		<updated>2020-07-17T16:21:24Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
      Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;       &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&amp;lt;br/&amp;gt;&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&amp;lt;br/&amp;gt;&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)                        99751500739@zoomcrc.com&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)                    &lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          162.255.36.11 (US East)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          213.19.144.110 (EMEA)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            103.122.166.55 (Australia)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 997 5150 0739                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 604442                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu                      207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 997 5150 0739&lt;br /&gt;
                                                                               Password: 604442&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
----------------------------------&lt;br /&gt;
&lt;br /&gt;
&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
      Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;       &lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&amp;lt;br/&amp;gt;&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&amp;lt;br/&amp;gt;&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)                         97377887885@zoomcrc.com&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           162.255.36.11 (US East)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           213.19.144.110 (EMEA)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          103.122.166.55 (Australia)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 973 7788 7885                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 461063                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW                     207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 973 7788 7885&lt;br /&gt;
                                                                               Password: 461063&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1788</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1788"/>
		<updated>2020-07-17T16:20:28Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;       &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&amp;lt;br/&amp;gt;&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&amp;lt;br/&amp;gt;&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)                        99751500739@zoomcrc.com&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)                    &lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          162.255.36.11 (US East)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          213.19.144.110 (EMEA)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            103.122.166.55 (Australia)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 997 5150 0739                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 604442                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu                      207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 997 5150 0739&lt;br /&gt;
                                                                               Password: 604442&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
----------------------------------&lt;br /&gt;
&lt;br /&gt;
&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;       &lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&amp;lt;br/&amp;gt;&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&amp;lt;br/&amp;gt;&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)                         97377887885@zoomcrc.com&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           162.255.36.11 (US East)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           213.19.144.110 (EMEA)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          103.122.166.55 (Australia)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 973 7788 7885                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 461063                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW                     207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 973 7788 7885&lt;br /&gt;
                                                                               Password: 461063&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1787</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1787"/>
		<updated>2020-07-17T16:18:16Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;       &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&amp;lt;br/&amp;gt;&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&amp;lt;br/&amp;gt;&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)                        99751500739@zoomcrc.com&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)                    &lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          162.255.36.11 (US East)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          213.19.144.110 (EMEA)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            103.122.166.55 (Australia)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 997 5150 0739                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 604442                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu                      207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 997 5150 0739&lt;br /&gt;
                                                                               Password: 604442&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)                         97377887885@zoomcrc.com&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           162.255.36.11 (US East)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           213.19.144.110 (EMEA)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          103.122.166.55 (Australia)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 973 7788 7885                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 461063                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW                     207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 973 7788 7885&lt;br /&gt;
                                                                               Password: 461063&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1786</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1786"/>
		<updated>2020-07-17T16:15:14Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)                        99751500739@zoomcrc.com&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)                    &lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          162.255.36.11 (US East)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          213.19.144.110 (EMEA)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            103.122.166.55 (Australia)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 997 5150 0739                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 604442                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu                      207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 997 5150 0739&lt;br /&gt;
                                                                               Password: 604442&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)                         97377887885@zoomcrc.com&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           162.255.36.11 (US East)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           213.19.144.110 (EMEA)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          103.122.166.55 (Australia)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 973 7788 7885                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 461063                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW                     207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 973 7788 7885&lt;br /&gt;
                                                                               Password: 461063&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1785</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1785"/>
		<updated>2020-07-17T16:13:52Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;u&amp;gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&amp;lt;/u&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)                        99751500739@zoomcrc.com&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)                    &lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          162.255.36.11 (US East)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          213.19.144.110 (EMEA)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            103.122.166.55 (Australia)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 997 5150 0739                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 604442                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu                      207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 997 5150 0739&lt;br /&gt;
                                                                               Password: 604442&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)                         97377887885@zoomcrc.com&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           162.255.36.11 (US East)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           213.19.144.110 (EMEA)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          103.122.166.55 (Australia)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 973 7788 7885                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 461063                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW                     207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 973 7788 7885&lt;br /&gt;
                                                                               Password: 461063&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1784</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1784"/>
		<updated>2020-07-17T16:12:18Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)                        99751500739@zoomcrc.com&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)                    &lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          162.255.36.11 (US East)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          213.19.144.110 (EMEA)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            103.122.166.55 (Australia)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 997 5150 0739                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 604442                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu                      207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 997 5150 0739&lt;br /&gt;
                                                                               Password: 604442&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
&lt;br /&gt;
One tap mobile                                                                 Join by SIP&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)                         97377887885@zoomcrc.com&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
                                                                               Join by H.323&lt;br /&gt;
Dial by your location                                                          162.255.37.11 (US West)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)                                           162.255.36.11 (US East)&lt;br /&gt;
        +1 646 876 9923 US (New York)                                          115.114.131.7 (India Mumbai)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)                                        115.114.115.7 (India Hyderabad)&lt;br /&gt;
        +1 346 248 7799 US (Houston)                                           213.19.144.110 (EMEA)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)                                          103.122.166.55 (Australia)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)                                            209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
Meeting ID: 973 7788 7885                                                      64.211.144.160 (Brazil)&lt;br /&gt;
Password: 461063                                                               69.174.57.160 (Canada)&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW                     207.226.132.110 (Japan)&lt;br /&gt;
                                                                               Meeting ID: 973 7788 7885&lt;br /&gt;
                                                                               Password: 461063&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1783</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1783"/>
		<updated>2020-07-17T16:02:31Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
One tap mobile&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)&lt;br /&gt;
&lt;br /&gt;
Dial by your location&lt;br /&gt;
        +1 646 876 9923 US (New York)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)&lt;br /&gt;
        +1 346 248 7799 US (Houston)&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 604442&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu&lt;br /&gt;
&lt;br /&gt;
Join by SIP&lt;br /&gt;
99751500739@zoomcrc.com&lt;br /&gt;
&lt;br /&gt;
Join by H.323&lt;br /&gt;
162.255.37.11 (US West)&lt;br /&gt;
162.255.36.11 (US East)&lt;br /&gt;
115.114.131.7 (India Mumbai)&lt;br /&gt;
115.114.115.7 (India Hyderabad)&lt;br /&gt;
213.19.144.110 (EMEA)&lt;br /&gt;
103.122.166.55 (Australia)&lt;br /&gt;
209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
64.211.144.160 (Brazil)&lt;br /&gt;
69.174.57.160 (Canada)&lt;br /&gt;
207.226.132.110 (Japan)&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 604442&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        &lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
One tap mobile&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
&lt;br /&gt;
Dial by your location&lt;br /&gt;
        +1 312 626 6799 US (Chicago)&lt;br /&gt;
        +1 646 876 9923 US (New York)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)&lt;br /&gt;
        +1 346 248 7799 US (Houston)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW&lt;br /&gt;
&lt;br /&gt;
Join by SIP&lt;br /&gt;
97377887885@zoomcrc.com&lt;br /&gt;
&lt;br /&gt;
Join by H.323&lt;br /&gt;
162.255.37.11 (US West)&lt;br /&gt;
162.255.36.11 (US East)&lt;br /&gt;
115.114.131.7 (India Mumbai)&lt;br /&gt;
115.114.115.7 (India Hyderabad)&lt;br /&gt;
213.19.144.110 (EMEA)&lt;br /&gt;
103.122.166.55 (Australia)&lt;br /&gt;
209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
64.211.144.160 (Brazil)&lt;br /&gt;
69.174.57.160 (Canada)&lt;br /&gt;
207.226.132.110 (Japan)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1782</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1782"/>
		<updated>2020-07-17T16:00:58Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems&lt;br /&gt;
Time: Sep 15, 2020 08:00 AM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        Sep 15, 2020 08:00 AM&lt;br /&gt;
        Sep 17, 2020 08:00 AM&lt;br /&gt;
        Sep 22, 2020 08:00 AM&lt;br /&gt;
        Sep 24, 2020 08:00 AM&lt;br /&gt;
        Sep 29, 2020 08:00 AM&lt;br /&gt;
        Oct 1, 2020 08:00 AM&lt;br /&gt;
        Oct 6, 2020 08:00 AM&lt;br /&gt;
        Oct 8, 2020 08:00 AM&lt;br /&gt;
        Oct 13, 2020 08:00 AM&lt;br /&gt;
        Oct 15, 2020 08:00 AM&lt;br /&gt;
        Oct 20, 2020 08:00 AM&lt;br /&gt;
        Oct 22, 2020 08:00 AM&lt;br /&gt;
        Oct 27, 2020 08:00 AM&lt;br /&gt;
        Oct 29, 2020 08:00 AM&lt;br /&gt;
        Nov 3, 2020 08:00 AM&lt;br /&gt;
        Nov 5, 2020 08:00 AM&lt;br /&gt;
        Nov 10, 2020 08:00 AM&lt;br /&gt;
        Nov 12, 2020 08:00 AM&lt;br /&gt;
        Nov 17, 2020 08:00 AM&lt;br /&gt;
        Nov 19, 2020 08:00 AM&lt;br /&gt;
        Nov 24, 2020 08:00 AM&lt;br /&gt;
        Nov 26, 2020 08:00 AM&lt;br /&gt;
        Dec 1, 2020 08:00 AM&lt;br /&gt;
        Dec 3, 2020 08:00 AM&lt;br /&gt;
        Dec 8, 2020 08:00 AM&lt;br /&gt;
        Dec 10, 2020 08:00 AM&lt;br /&gt;
        Dec 15, 2020 08:00 AM&lt;br /&gt;
        Dec 17, 2020 08:00 AM&lt;br /&gt;
        Dec 22, 2020 08:00 AM&lt;br /&gt;
        Dec 24, 2020 08:00 AM&lt;br /&gt;
        Dec 29, 2020 08:00 AM&lt;br /&gt;
        Dec 31, 2020 08:00 AM&lt;br /&gt;
        Jan 5, 2021 08:00 AM&lt;br /&gt;
        Jan 7, 2021 08:00 AM&lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJ0qcuitrjstGd3NRqx30BUlSIJIasv6MKcV/ics?icsToken=98tyKuChqT4rH9SVtxqORox5B4_4d-_ziGJajacOsi30G3MDQDb6BctoG7NsBo79&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/99751500739?pwd=QmR5d2M2Snd2V3N0V0JLancrZTJOUT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 1l659y&lt;br /&gt;
One tap mobile&lt;br /&gt;
+16468769923,,99751500739#,,,,0#,,604442# US (New York)&lt;br /&gt;
+13017158592,,99751500739#,,,,0#,,604442# US (Germantown)&lt;br /&gt;
&lt;br /&gt;
Dial by your location&lt;br /&gt;
        +1 646 876 9923 US (New York)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)&lt;br /&gt;
        +1 312 626 6799 US (Chicago)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)&lt;br /&gt;
        +1 346 248 7799 US (Houston)&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 604442&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/aJxfKy4Zu&lt;br /&gt;
&lt;br /&gt;
Join by SIP&lt;br /&gt;
99751500739@zoomcrc.com&lt;br /&gt;
&lt;br /&gt;
Join by H.323&lt;br /&gt;
162.255.37.11 (US West)&lt;br /&gt;
162.255.36.11 (US East)&lt;br /&gt;
115.114.131.7 (India Mumbai)&lt;br /&gt;
115.114.115.7 (India Hyderabad)&lt;br /&gt;
213.19.144.110 (EMEA)&lt;br /&gt;
103.122.166.55 (Australia)&lt;br /&gt;
209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
64.211.144.160 (Brazil)&lt;br /&gt;
69.174.57.160 (Canada)&lt;br /&gt;
207.226.132.110 (Japan)&lt;br /&gt;
Meeting ID: 997 5150 0739&lt;br /&gt;
Password: 604442&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        Sep 15, 2020 03:00 PM&lt;br /&gt;
        Sep 17, 2020 03:00 PM&lt;br /&gt;
        Sep 22, 2020 03:00 PM&lt;br /&gt;
        Sep 24, 2020 03:00 PM&lt;br /&gt;
        Sep 29, 2020 03:00 PM&lt;br /&gt;
        Oct 1, 2020 03:00 PM&lt;br /&gt;
        Oct 6, 2020 03:00 PM&lt;br /&gt;
        Oct 8, 2020 03:00 PM&lt;br /&gt;
        Oct 13, 2020 03:00 PM&lt;br /&gt;
        Oct 15, 2020 03:00 PM&lt;br /&gt;
        Oct 20, 2020 03:00 PM&lt;br /&gt;
        Oct 22, 2020 03:00 PM&lt;br /&gt;
        Oct 27, 2020 03:00 PM&lt;br /&gt;
        Oct 29, 2020 03:00 PM&lt;br /&gt;
        Nov 3, 2020 03:00 PM&lt;br /&gt;
        Nov 5, 2020 03:00 PM&lt;br /&gt;
        Nov 10, 2020 03:00 PM&lt;br /&gt;
        Nov 12, 2020 03:00 PM&lt;br /&gt;
        Nov 17, 2020 03:00 PM&lt;br /&gt;
        Nov 19, 2020 03:00 PM&lt;br /&gt;
        Nov 24, 2020 03:00 PM&lt;br /&gt;
        Nov 26, 2020 03:00 PM&lt;br /&gt;
        Dec 1, 2020 03:00 PM&lt;br /&gt;
        Dec 3, 2020 03:00 PM&lt;br /&gt;
        Dec 8, 2020 03:00 PM&lt;br /&gt;
        Dec 10, 2020 03:00 PM&lt;br /&gt;
        Dec 15, 2020 03:00 PM&lt;br /&gt;
        Dec 17, 2020 03:00 PM&lt;br /&gt;
        Dec 22, 2020 03:00 PM&lt;br /&gt;
        Dec 24, 2020 03:00 PM&lt;br /&gt;
        Dec 29, 2020 03:00 PM&lt;br /&gt;
        Dec 31, 2020 03:00 PM&lt;br /&gt;
        Jan 5, 2021 03:00 PM&lt;br /&gt;
        Jan 7, 2021 03:00 PM&lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
One tap mobile&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
&lt;br /&gt;
Dial by your location&lt;br /&gt;
        +1 312 626 6799 US (Chicago)&lt;br /&gt;
        +1 646 876 9923 US (New York)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)&lt;br /&gt;
        +1 346 248 7799 US (Houston)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW&lt;br /&gt;
&lt;br /&gt;
Join by SIP&lt;br /&gt;
97377887885@zoomcrc.com&lt;br /&gt;
&lt;br /&gt;
Join by H.323&lt;br /&gt;
162.255.37.11 (US West)&lt;br /&gt;
162.255.36.11 (US East)&lt;br /&gt;
115.114.131.7 (India Mumbai)&lt;br /&gt;
115.114.115.7 (India Hyderabad)&lt;br /&gt;
213.19.144.110 (EMEA)&lt;br /&gt;
103.122.166.55 (Australia)&lt;br /&gt;
209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
64.211.144.160 (Brazil)&lt;br /&gt;
69.174.57.160 (Canada)&lt;br /&gt;
207.226.132.110 (Japan)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1781</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1781"/>
		<updated>2020-07-17T15:49:35Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        Sep 15, 2020 03:00 PM&lt;br /&gt;
        Sep 17, 2020 03:00 PM&lt;br /&gt;
        Sep 22, 2020 03:00 PM&lt;br /&gt;
        Sep 24, 2020 03:00 PM&lt;br /&gt;
        Sep 29, 2020 03:00 PM&lt;br /&gt;
        Oct 1, 2020 03:00 PM&lt;br /&gt;
        Oct 6, 2020 03:00 PM&lt;br /&gt;
        Oct 8, 2020 03:00 PM&lt;br /&gt;
        Oct 13, 2020 03:00 PM&lt;br /&gt;
        Oct 15, 2020 03:00 PM&lt;br /&gt;
        Oct 20, 2020 03:00 PM&lt;br /&gt;
        Oct 22, 2020 03:00 PM&lt;br /&gt;
        Oct 27, 2020 03:00 PM&lt;br /&gt;
        Oct 29, 2020 03:00 PM&lt;br /&gt;
        Nov 3, 2020 03:00 PM&lt;br /&gt;
        Nov 5, 2020 03:00 PM&lt;br /&gt;
        Nov 10, 2020 03:00 PM&lt;br /&gt;
        Nov 12, 2020 03:00 PM&lt;br /&gt;
        Nov 17, 2020 03:00 PM&lt;br /&gt;
        Nov 19, 2020 03:00 PM&lt;br /&gt;
        Nov 24, 2020 03:00 PM&lt;br /&gt;
        Nov 26, 2020 03:00 PM&lt;br /&gt;
        Dec 1, 2020 03:00 PM&lt;br /&gt;
        Dec 3, 2020 03:00 PM&lt;br /&gt;
        Dec 8, 2020 03:00 PM&lt;br /&gt;
        Dec 10, 2020 03:00 PM&lt;br /&gt;
        Dec 15, 2020 03:00 PM&lt;br /&gt;
        Dec 17, 2020 03:00 PM&lt;br /&gt;
        Dec 22, 2020 03:00 PM&lt;br /&gt;
        Dec 24, 2020 03:00 PM&lt;br /&gt;
        Dec 29, 2020 03:00 PM&lt;br /&gt;
        Dec 31, 2020 03:00 PM&lt;br /&gt;
        Jan 5, 2021 03:00 PM&lt;br /&gt;
        Jan 7, 2021 03:00 PM&lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
One tap mobile&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
&lt;br /&gt;
Dial by your location&lt;br /&gt;
        +1 312 626 6799 US (Chicago)&lt;br /&gt;
        +1 646 876 9923 US (New York)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)&lt;br /&gt;
        +1 346 248 7799 US (Houston)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW&lt;br /&gt;
&lt;br /&gt;
Join by SIP&lt;br /&gt;
97377887885@zoomcrc.com&lt;br /&gt;
&lt;br /&gt;
Join by H.323&lt;br /&gt;
162.255.37.11 (US West)&lt;br /&gt;
162.255.36.11 (US East)&lt;br /&gt;
115.114.131.7 (India Mumbai)&lt;br /&gt;
115.114.115.7 (India Hyderabad)&lt;br /&gt;
213.19.144.110 (EMEA)&lt;br /&gt;
103.122.166.55 (Australia)&lt;br /&gt;
209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
64.211.144.160 (Brazil)&lt;br /&gt;
69.174.57.160 (Canada)&lt;br /&gt;
207.226.132.110 (Japan)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1780</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1780"/>
		<updated>2020-07-17T15:48:38Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
&lt;br /&gt;
'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        Sep 15, 2020 03:00 PM&lt;br /&gt;
        Sep 17, 2020 03:00 PM&lt;br /&gt;
        Sep 22, 2020 03:00 PM&lt;br /&gt;
        Sep 24, 2020 03:00 PM&lt;br /&gt;
        Sep 29, 2020 03:00 PM&lt;br /&gt;
        Oct 1, 2020 03:00 PM&lt;br /&gt;
        Oct 6, 2020 03:00 PM&lt;br /&gt;
        Oct 8, 2020 03:00 PM&lt;br /&gt;
        Oct 13, 2020 03:00 PM&lt;br /&gt;
        Oct 15, 2020 03:00 PM&lt;br /&gt;
        Oct 20, 2020 03:00 PM&lt;br /&gt;
        Oct 22, 2020 03:00 PM&lt;br /&gt;
        Oct 27, 2020 03:00 PM&lt;br /&gt;
        Oct 29, 2020 03:00 PM&lt;br /&gt;
        Nov 3, 2020 03:00 PM&lt;br /&gt;
        Nov 5, 2020 03:00 PM&lt;br /&gt;
        Nov 10, 2020 03:00 PM&lt;br /&gt;
        Nov 12, 2020 03:00 PM&lt;br /&gt;
        Nov 17, 2020 03:00 PM&lt;br /&gt;
        Nov 19, 2020 03:00 PM&lt;br /&gt;
        Nov 24, 2020 03:00 PM&lt;br /&gt;
        Nov 26, 2020 03:00 PM&lt;br /&gt;
        Dec 1, 2020 03:00 PM&lt;br /&gt;
        Dec 3, 2020 03:00 PM&lt;br /&gt;
        Dec 8, 2020 03:00 PM&lt;br /&gt;
        Dec 10, 2020 03:00 PM&lt;br /&gt;
        Dec 15, 2020 03:00 PM&lt;br /&gt;
        Dec 17, 2020 03:00 PM&lt;br /&gt;
        Dec 22, 2020 03:00 PM&lt;br /&gt;
        Dec 24, 2020 03:00 PM&lt;br /&gt;
        Dec 29, 2020 03:00 PM&lt;br /&gt;
        Dec 31, 2020 03:00 PM&lt;br /&gt;
        Jan 5, 2021 03:00 PM&lt;br /&gt;
        Jan 7, 2021 03:00 PM&lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
One tap mobile&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
&lt;br /&gt;
Dial by your location&lt;br /&gt;
        +1 312 626 6799 US (Chicago)&lt;br /&gt;
        +1 646 876 9923 US (New York)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)&lt;br /&gt;
        +1 346 248 7799 US (Houston)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW&lt;br /&gt;
&lt;br /&gt;
Join by SIP&lt;br /&gt;
97377887885@zoomcrc.com&lt;br /&gt;
&lt;br /&gt;
Join by H.323&lt;br /&gt;
162.255.37.11 (US West)&lt;br /&gt;
162.255.36.11 (US East)&lt;br /&gt;
115.114.131.7 (India Mumbai)&lt;br /&gt;
115.114.115.7 (India Hyderabad)&lt;br /&gt;
213.19.144.110 (EMEA)&lt;br /&gt;
103.122.166.55 (Australia)&lt;br /&gt;
209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
64.211.144.160 (Brazil)&lt;br /&gt;
69.174.57.160 (Canada)&lt;br /&gt;
207.226.132.110 (Japan)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1779</id>
		<title>Zoom</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Zoom&amp;diff=1779"/>
		<updated>2020-07-17T15:47:16Z</updated>

		<summary type="html">&lt;p&gt;Guerin: Created page with &amp;quot;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''  &amp;lt;blockquote&amp;gt;  &amp;lt;/blockquote&amp;gt;  '''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''  &amp;lt;blockquot...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Tuesday &amp;amp; Thursday AM Office Hours: 8:00-8:45am Central Time'''&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
'''Tuesday &amp;amp; Thursday PM Office Hours: 3:00-3:45pm Central Time'''&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&lt;br /&gt;
Roch Guerin is inviting you to a scheduled Zoom meeting.&lt;br /&gt;
&lt;br /&gt;
Topic: FL2020.E81.CSE.538T.01 - Modeling and Performance Evaluation of Computer Systems (office hours)&lt;br /&gt;
Time: Sep 15, 2020 03:00 PM Central Time (US and Canada)&lt;br /&gt;
        Every week on Tue, Thu, until Jan 7, 2021, 34 occurrence(s)&lt;br /&gt;
        Sep 15, 2020 03:00 PM&lt;br /&gt;
        Sep 17, 2020 03:00 PM&lt;br /&gt;
        Sep 22, 2020 03:00 PM&lt;br /&gt;
        Sep 24, 2020 03:00 PM&lt;br /&gt;
        Sep 29, 2020 03:00 PM&lt;br /&gt;
        Oct 1, 2020 03:00 PM&lt;br /&gt;
        Oct 6, 2020 03:00 PM&lt;br /&gt;
        Oct 8, 2020 03:00 PM&lt;br /&gt;
        Oct 13, 2020 03:00 PM&lt;br /&gt;
        Oct 15, 2020 03:00 PM&lt;br /&gt;
        Oct 20, 2020 03:00 PM&lt;br /&gt;
        Oct 22, 2020 03:00 PM&lt;br /&gt;
        Oct 27, 2020 03:00 PM&lt;br /&gt;
        Oct 29, 2020 03:00 PM&lt;br /&gt;
        Nov 3, 2020 03:00 PM&lt;br /&gt;
        Nov 5, 2020 03:00 PM&lt;br /&gt;
        Nov 10, 2020 03:00 PM&lt;br /&gt;
        Nov 12, 2020 03:00 PM&lt;br /&gt;
        Nov 17, 2020 03:00 PM&lt;br /&gt;
        Nov 19, 2020 03:00 PM&lt;br /&gt;
        Nov 24, 2020 03:00 PM&lt;br /&gt;
        Nov 26, 2020 03:00 PM&lt;br /&gt;
        Dec 1, 2020 03:00 PM&lt;br /&gt;
        Dec 3, 2020 03:00 PM&lt;br /&gt;
        Dec 8, 2020 03:00 PM&lt;br /&gt;
        Dec 10, 2020 03:00 PM&lt;br /&gt;
        Dec 15, 2020 03:00 PM&lt;br /&gt;
        Dec 17, 2020 03:00 PM&lt;br /&gt;
        Dec 22, 2020 03:00 PM&lt;br /&gt;
        Dec 24, 2020 03:00 PM&lt;br /&gt;
        Dec 29, 2020 03:00 PM&lt;br /&gt;
        Dec 31, 2020 03:00 PM&lt;br /&gt;
        Jan 5, 2021 03:00 PM&lt;br /&gt;
        Jan 7, 2021 03:00 PM&lt;br /&gt;
Please download and import the following iCalendar (.ics) files to your calendar system.&lt;br /&gt;
Weekly: https://wustl.zoom.us/meeting/tJMucO6gpjwiEtGny3vPbZhCAQkozuIWHNwh/ics?icsToken=98tyKuCvrTwtEtySuBGCRowEA4_CKPzxiGZHj7d6kga2FRBRWAvVF9NJPahqOe_4&lt;br /&gt;
&lt;br /&gt;
Join Zoom Meeting&lt;br /&gt;
https://wustl.zoom.us/j/97377887885?pwd=WW93Z3NTZml3NTI5S2dEVnJ0c0ZjQT09&lt;br /&gt;
&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 2u087o&lt;br /&gt;
One tap mobile&lt;br /&gt;
+13126266799,,97377887885#,,,,0#,,461063# US (Chicago)&lt;br /&gt;
+16468769923,,97377887885#,,,,0#,,461063# US (New York)&lt;br /&gt;
&lt;br /&gt;
Dial by your location&lt;br /&gt;
        +1 312 626 6799 US (Chicago)&lt;br /&gt;
        +1 646 876 9923 US (New York)&lt;br /&gt;
        +1 301 715 8592 US (Germantown)&lt;br /&gt;
        +1 346 248 7799 US (Houston)&lt;br /&gt;
        +1 669 900 6833 US (San Jose)&lt;br /&gt;
        +1 253 215 8782 US (Tacoma)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
Find your local number: https://wustl.zoom.us/u/acaZH9rtpW&lt;br /&gt;
&lt;br /&gt;
Join by SIP&lt;br /&gt;
97377887885@zoomcrc.com&lt;br /&gt;
&lt;br /&gt;
Join by H.323&lt;br /&gt;
162.255.37.11 (US West)&lt;br /&gt;
162.255.36.11 (US East)&lt;br /&gt;
115.114.131.7 (India Mumbai)&lt;br /&gt;
115.114.115.7 (India Hyderabad)&lt;br /&gt;
213.19.144.110 (EMEA)&lt;br /&gt;
103.122.166.55 (Australia)&lt;br /&gt;
209.9.211.110 (Hong Kong SAR)&lt;br /&gt;
64.211.144.160 (Brazil)&lt;br /&gt;
69.174.57.160 (Canada)&lt;br /&gt;
207.226.132.110 (Japan)&lt;br /&gt;
Meeting ID: 973 7788 7885&lt;br /&gt;
Password: 461063&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/blockquote&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1778</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1778"/>
		<updated>2020-07-17T15:44:46Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Logistics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  That work did not go anywhere as it was caught by the Internet tsunami (to which I also contributed to some extent by co-authoring a few RFCs such as RFC 2212, RFC 2676, RFC 2697, RFC 2698, RFC 2753), but on the modeling front it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours 4 times a week on zoom for 45mins slots): &lt;br /&gt;
*** Tuesday 8:00-8:45am &amp;amp; Thursday 8:00-8:45am: [[zoom|zoom info]]&lt;br /&gt;
*** Tuesday 3:00-3:45pm &amp;amp; Thursday 3:00-3:45pm: [[zoom|zoom info]]&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1777</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1777"/>
		<updated>2020-07-17T15:42:44Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Logistics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  That work did not go anywhere as it was caught by the Internet tsunami (to which I also contributed to some extent by co-authoring a few RFCs such as RFC 2212, RFC 2676, RFC 2697, RFC 2698, RFC 2753), but on the modeling front it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours 4 times a week on zoom for 45mins slots): &lt;br /&gt;
*** Tuesday 8:00-8:45am &amp;amp; Thursday 8:00-8:45am: [https://classes.engineering.wustl.edu/cse538/zoom zoom info]&lt;br /&gt;
*** Tuesday 3:00-3:45pm &amp;amp; Thursday 3:00-3:45pm: [https://classes.engineering.wustl.edu/cse538/zoom zoom info]&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1776</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1776"/>
		<updated>2020-07-06T23:45:28Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Instructor's Background */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  That work did not go anywhere as it was caught by the Internet tsunami (to which I also contributed to some extent by co-authoring a few RFCs such as RFC 2212, RFC 2676, RFC 2697, RFC 2698, RFC 2753), but on the modeling front it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1775</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1775"/>
		<updated>2020-07-06T12:58:57Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Course Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher'' on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  On the modeling front, it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1774</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1774"/>
		<updated>2020-07-06T12:58:33Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Course Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326. &amp;lt;br/&amp;gt; '''Note''':  This is a graduate course, and so while we will go through a brief ''refresher// on probability and transform methods, neither is meant to replace having taken a course on those topics. &lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  On the modeling front, it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1773</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1773"/>
		<updated>2020-07-06T12:56:24Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326&lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  On the modeling front, it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
For more information see the [https://www.cse.wustl.edu/~guerin/background.html Background section] of my [https://www.cse.wustl.edu/~guerin/ webpage].&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1772</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1772"/>
		<updated>2020-07-06T12:16:26Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326&lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Instructor's Background'''==&lt;br /&gt;
The bulk of my career has been spent developing and applying algorithmic and performance modeling solutions to problems in computer networking.&lt;br /&gt;
&lt;br /&gt;
I spent about 12 years at IBM Research T.J. Watson developing what at the time were viewed as &amp;quot;next generation&amp;quot; networking solutions.  Some of that work led to various quality-of-service enhancement to routers made by IBM, and to the development of what was supposed to be IBM's advanced packet switching network architecture called Networking BroadBand Services (NBBS).  On the modeling front, it gave rise to the concept or equivalent or effective bandwidth that predicts how much bandwidth a variable rate connection needs to meet a certain performance level.  I left IBM to join the University of Pennsylvania where I continued working on various networking problems, extending into the area of routing, traffic engineering, multimedia applications, etc., anything that had to do with improving performance over packet networks.  I also became interested in questions of network economics and technology adoption in systems with positive and negative externalities, and this led to a separate branch of investigations that still continues to this day.  Finally, I joined WashU in 2013 where besides continuing investigations related to network economics, I have explored performance questions in cloud systems with a focus on improving efficiency and enabling real-time guarantees, e.g., how to make the cloud useful to systems with tight latency requirements.&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1771</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1771"/>
		<updated>2020-07-05T17:25:04Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Why Should I Take This Course? (or What Should I Expect to Learn from It?) */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326&lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are commonly in the form of order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1770</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1770"/>
		<updated>2020-07-05T17:24:03Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Why Should I take This Course? (or What Should I Expect to Learn from It?) */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326&lt;br /&gt;
&lt;br /&gt;
==='''Why Should I Take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are usually in the form of various order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1769</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1769"/>
		<updated>2020-07-05T17:23:46Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Why Should I take This Course? (or What Should I Expect to Lear from It?) */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326&lt;br /&gt;
&lt;br /&gt;
==='''Why Should I take This Course?''' (or What Should I Expect to Learn from It?)===&lt;br /&gt;
The course is about creating and solving models that allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are usually in the form of various order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1768</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Main_Page&amp;diff=1768"/>
		<updated>2020-07-05T17:23:24Z</updated>

		<summary type="html">&lt;p&gt;Guerin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span style=&amp;quot;font-size:150%&amp;quot;&amp;gt;&amp;lt;strong&amp;gt;CSE 538 (Modeling and Performance Evaluation of Computer Systems)&amp;lt;/strong&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- &amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THIS WIKI IS FREQUENTLY UPDATED, SO INFORMATION IS SUBJECT TO CHANGE AND MAYBE TEMPORARILY INACCURATE AND/OR INCOMPLETE.'''&amp;lt;/span&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=='''Course Description'''==&lt;br /&gt;
Modern computing systems consist of multiple interconnected components, which all influence performance. The focus of this course is on developing modeling tools aimed at understanding how to design and provision such systems to meet certain performance or efficiency targets, and the trade-offs involved. The course covers Markov chains and their applications to simple queues, and proceeds to explore more complex systems including server farms and how to optimize their performance through scheduling and task assignment policies. The course includes a brief review of the necessary probability and mathematical concepts. Prerequisite: ESE 326&lt;br /&gt;
&lt;br /&gt;
==='''Why Should I take This Course?''' (or What Should I Expect to Lear from It?)===&lt;br /&gt;
The course is about creating and solving models that can allow you to evaluate the performance of different computer systems (though the techniques are general and applicable to a wide range of other systems).&lt;br /&gt;
&lt;br /&gt;
A model has usually three components: (1) How work arrives to the system, (2) the structure of the system (can jobs wait for service and how many, in which order are they served, etc.), and (3) a characterization of the amount of work each job brings. Performance metrics of interest are usually in the form of various order statistics of quantities such as ''waiting time, system time (waiting + service), throughput (number of jobs processed per unit of time), loss probability (odds that a job is turned away because of a full system), etc.''&lt;br /&gt;
&lt;br /&gt;
The course will equip you with a set of tools for choosing the proper representations for each of those three components, and will show you how to combine and apply them in a number of standard system configurations associated with common computer systems.  Through those examples, you will not only learn how to apply those tools, but also how to interpret the results they produce.&lt;br /&gt;
&lt;br /&gt;
=='''Links'''==&lt;br /&gt;
* [https://piazza.com/wustl/fall2020/cse538t/home Piazza course page]: Please use it for all Q&amp;amp;A related to the class.  ('''Note''':  You need to [http://piazza.com/wustl/fall2020/cse538t sign-up] before being able to access the site).&lt;br /&gt;
* [https://wustl.instructure.com/courses/47391/ Canvas Site]:  Used '''only''' for posting grades.&lt;br /&gt;
--------------&lt;br /&gt;
&lt;br /&gt;
=='''Announcements'''==&lt;br /&gt;
&lt;br /&gt;
ALL ANNOUNCEMENTS ARE POSTED ON THE [https://piazza.com/wustl/fall2020/cse538/home PIAZZA COURSE PAGE]&lt;br /&gt;
&lt;br /&gt;
=='''Textbook(s)'''==&lt;br /&gt;
M. Harchol-Balter, ''&amp;quot;Performance Modeling and Design of Computer Systems.&amp;quot;'' Cambridge University Press (2013), ISBN: 978-1-107-02750-3&lt;br /&gt;
&lt;br /&gt;
=='''Logistics'''==&lt;br /&gt;
* '''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
** First class is on Monday August 24, 2020, and last class is on Wednesday December 2nd, 2020.&lt;br /&gt;
* '''Class grading''':  Review problems 5%; Homeworks 25%, Quizzes 20%; Exam 1 25%; Exam2 25%&lt;br /&gt;
* '''Instructor''':  Roch Guerin, Jolley 304C, email: guerin@wustl.edu&lt;br /&gt;
** Office hours: Tuesday 3:00-4:00pm &amp;amp; Thursday 3:00-4:00pm in Jolley 304C&lt;br /&gt;
* '''TAs and office hours:'''  TBD, if any&lt;br /&gt;
&lt;br /&gt;
* '''Late policy''':  Homeworks and review problems are expected to be turned in '''at the start of class''' on their due date.  There will be ''no exception'' and ''no partial credit''.  On an ''exceptional basis,'' if you are unable to make it to class, you can turn in your homework in the CSE department office (Jolley 304).  Give your assignment to one of the department staff, and ask them to sign and timestamp it.  The timestamp must precede the start time of the class.&lt;br /&gt;
&lt;br /&gt;
* '''Asking questions''':  You can obviously ask face-to-face questions during any of the office hours, but the other and possibly better means to get your questions answered is to use the [https://piazza.com/wustl/fall2020/cse538t/home Piazza site] setup for the course (you will need to register to be able to access it).  The TA (if any) and I will monitor the site and do our best to answer questions in a timely manner.  Posting questions on Piazza has the advantage that questions and answers are available to all students, and it is often the case that if you have a question, other students have a similar one.  Because of that, neither the TA nor I will respond to email questions.  So please use the Piazza site as much as you can and don't hesitate to ask as many questions as you need to; '''there is no such thing as a dumb question.'''&lt;br /&gt;
&lt;br /&gt;
* '''Exam 1'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Monday October 19, 2020, in class.'''&lt;br /&gt;
* '''Exam 2'''&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;: Wednesday December 11, 2020, 7:20-8:00pm in '''TBD'''.&lt;br /&gt;
* '''ACADEMIC INTEGRITY''':  Please make sure you are familiar with [http://wustl.edu/policies/undergraduate-academic-integrity.html Washington University Academic Integrity Policy], as it will be strictly applied.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;sup&amp;gt;'''*'''&amp;lt;/sup&amp;gt; EXCEPT FOR PROPERLY DOCUMENTED MEDICAL OR FAMILY EMERGENCY REASONS, THERE WILL BE '''NO''' MAKE-UP TIMES FOR EXAMS OR QUIZZES.  YOU NEED TO ARRANGE OTHER ACTIVITIES SO AS TO AVOID CONFLICTS.&lt;br /&gt;
&lt;br /&gt;
=='''University Policies &amp;amp; Resources on Sexual Assault, Bias, and Mental Health'''==&lt;br /&gt;
&lt;br /&gt;
==='''Accommodating Special Requirements'''===&lt;br /&gt;
Washington University is committed to providing accommodations and/or services to students with documented disabilities. Students who are seeking support for a disability or a suspected disability should contact Disability Resources at 935-4153. Disability Resources is responsible for approving all disability-related accommodations for WU students, and students are responsible for providing faculty members with formal documentation of their approved accommodations at least two weeks prior to using those accommodations. I will accept Disability Resources VISA forms by email and personal delivery. If you have already been approved for accommodations, please provide me with a copy of your VISA within the first two weeks of the semester.&lt;br /&gt;
&lt;br /&gt;
==='''Accommodations based upon sexual assault'''===&lt;br /&gt;
The University is committed to offering reasonable academic accommodations to students who are victims of sexual assault.  Students are eligible for accommodation regardless of whether they seek criminal or disciplinary action.  Depending on the specific nature of the allegation, such measures may include but are not limited to: implementation of a no-contact order, course/classroom assignment changes, and other academic support services and accommodations.  If you need to request such accommodations, please direct your request to Kim Webb (kim_webb@wustl.edu), Director of the [https://rsvpcenter.wustl.edu/ Relationship and Sexual Violence Prevention Center].  Ms. Webb is a confidential resource; however, requests for accommodations will be shared with the appropriate University administration and faculty.  The University will maintain as confidential any accommodations or protective measures provided to an individual student so long as it does not impair the ability to provide such measures.&lt;br /&gt;
&lt;br /&gt;
If a student comes to me to discuss or disclose an instance of sexual assault, sex discrimination, sexual harassment, dating violence, domestic violence or stalking, or if I otherwise observe or become aware of such an allegation, I will keep the information as private as I can, but as a faculty member of Washington University, I am required to immediately report it to my Dean or directly to Ms. Jessica Kennedy, the University’s Title IX Director.  If you would like to speak with directly Ms. Kennedy directly, she can be reached at (314) 935-3118, jwkennedy@wustl.edu, or by visiting the [https://titleix.wustl.edu/ Title IX office] in Umrath Hall.  Additionally, you can report incidents or complaints to the Office of Student Conduct and Community Standards or by contacting WUPD at (314) 935-5555 or your local law enforcement agency. See: [https://titleix.wustl.edu/ Title IX].&lt;br /&gt;
&lt;br /&gt;
You can also speak confidentially and learn more about available resources at the Relationship and Sexual Violence Prevention Center by calling (314) 935-8761 or visiting the 4th floor of Seigle Hall.  See: [https://rsvpcenter.wustl.edu/ RSVP Center].&lt;br /&gt;
&lt;br /&gt;
==='''Bias Reporting'''===&lt;br /&gt;
The University has a process through which students, faculty, staff and community members who have experienced or witnessed incidents of bias, prejudice or discrimination against a student can report their experiences to the University’s Bias Report and Support System (BRSS) team.  See: [http://brss.wustl.edu brss.wustl.edu]&lt;br /&gt;
&lt;br /&gt;
==='''Mental Health'''===&lt;br /&gt;
Mental Health Services’ professional staff members work with students to resolve personal and interpersonal difficulties, many of which can affect the academic experience. These include conflicts with or worry about friends or family, concerns about eating or drinking patterns, and feelings of anxiety and depression.  See: [http://shs.wustl.edu/MentalHealth shs.wustl.edu/MentalHealth]&lt;br /&gt;
&lt;br /&gt;
==='''Center for Diversity and Inclusion (CDI)'''===&lt;br /&gt;
The Center of Diversity and Inclusion (CDI) supports and advocates for undergraduate, graduate, and professional school students from underrepresented and/or marginalized populations, creates collaborative partnerships with campus and community partners, and promotes dialogue and social change.  One of the CDI's strategic priorities is to cultivate and foster a supportive campus climate for students of all backgrounds, cultures and identities.&lt;br /&gt;
See: diversityinclusion.wustl.edu/&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1767</id>
		<title>Homeworks</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1767"/>
		<updated>2020-06-16T00:35:30Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* PREVIEW PROBLEMS */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== ASSIGNED HOMEWORKS ==&lt;br /&gt;
&lt;br /&gt;
* Due 9/14/2020: [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing Homework No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1Z3aIhtKtZ_twpgoCwupeBD-xI2huV3N9/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 9/28/2020: [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing Homework No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1RvUHv-OuA21RSzhW6OXmfQwzmEaW2yBX/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 10/14/2020: [[Media:hwk3.pdf | Homework No. 3]] &amp;lt;!-- and [[Media:hwk3_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/02/2020: [[Media:hwk4.pdf | Homework No. 4]] &amp;lt;!-- and [[Media:hwk4_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/16/2020: [[Media:hwk5.pdf | Homework No. 5]] &amp;lt;!-- and [[Media:hwk5_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 12/02/2020: [[Media:hwk6.pdf | Homework No. 6]] &amp;lt;!-- and [[Media:hwk6_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== PREVIEW PROBLEMS ==&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview problems No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1qUsgFPSxOL_emnVKsIC2Ef0R3bFnevLA/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview problems No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1clKKjoAea8yMC3VRUnzH6Y96xTcOBVnV/view?usp=sharing Solution]  --&amp;gt; plus [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Lecture 2 problems &amp;amp; solution]&lt;br /&gt;
* [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview problems No. 3] &amp;lt;!-- and [https://drive.google.com/file/d/14L4Vl3DuSRYbvau1knmITGmq9k9GDF9E/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview problems No. 5]] &amp;lt;!-- and [https://drive.google.com/file/d/17uVBKa76VdRJmOl8xChbfyU9Vga0YC9v/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview problems No. 6] &amp;lt;!-- and [https://drive.google.com/file/d/1bNacCQda5-ttaQJEjWAr-GJP7Fbv_ZYj/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview problems No. 7] &amp;lt;!-- and [https://drive.google.com/file/d/1Li68waK-SAeHn6VCjoqcGuuXuqQCC8rZ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview problems No. 8] &amp;lt;!-- and [https://drive.google.com/file/d/10czF7oMBFnBf-9kaok5AwNACFwQbfvWJ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview problems No. 9] &amp;lt;!-- and [[https://drive.google.com/file/d/1SsP4qX4JLmEFpWcw3-Cmy4r2vv6tk5rO/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview problems No. 10] &amp;lt;!-- and [https://drive.google.com/file/d/1ytgVED_tvSX2ICCgRqL90DR70UN20Jvl/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview problems No. 11] &amp;lt;!-- and [https://drive.google.com/file/d/1i5tmzZyyaSRQlv4Y9CGq54thmL3KA2nk/view?usp=sharing Solution] --&amp;gt; &lt;br /&gt;
* [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview problems No. 12] &amp;lt;!-- and [https://drive.google.com/file/d/1CK3La4-QQjPuff1ZGKbcf81wtij9hxQL/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview problems No. 13] &amp;lt;!-- and [https://drive.google.com/file/d/1HvLEnecy2zZVCvEg24tTUN5PqVELQk6H/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview problems No. 14] &amp;lt;!-- and [https://drive.google.com/file/d/1tld6Qt1nQMrU9o82dBdSZNvCv-JfZAgy/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems No. 15] &amp;lt;!-- and [https://drive.google.com/file/d/1CpqTQIfQylu1yLrO1wmuT2iWz-zgyI8L/view?usp=sharing Solution] --&amp;gt; plus [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing Lecture 15 problem &amp;amp; solution]&lt;br /&gt;
* [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview problems No. 16] &amp;lt;!-- and [https://drive.google.com/file/d/1xQhIzvaG8dJEeUFkIUxrtJ1qd77_Yreo/view?usp=sharing Solution] --&amp;gt; plus [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem &amp;amp; solution]&lt;br /&gt;
* [https://drive.google.com/file/d/1ceYdAISfu2UFFcEUkV1DNwbAqLhYD4Zp/view?usp=sharing Preview problems No. 17] &amp;lt;!-- and [https://drive.google.com/file/d/19aBq1s3WiBq-ZvFnz9Z3Uw1zfN7EDRYn/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Media:review18.pdf | Preview problems No. 18]] &amp;lt;!-- and [[Media:review18_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review19.pdf | Preview problems No. 19]] &amp;lt;!-- and [[Media:review19_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review20.pdf | Preview problems No. 20]] &amp;lt;!-- and [[Media:review20_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review21.pdf | Preview problems No. 21]] &amp;lt;!-- and [[Media:review21_sol.pdf | Solution]]; [[Media:Lecture21.pdf | Lecture 21 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review22.pdf | Preview problems No. 22]] &amp;lt;!-- and [[Media:review22_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review23.pdf | Preview problems No. 23]]  &amp;lt;!-- and [[Media:review23_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review24.pdf | Preview problems No. 24]] &amp;lt;!-- and [[Media:review24_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review25.pdf | Preview problems No. 25]] &amp;lt;!-- and [[Media:review25_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review26.pdf | Preview problems No. 26]] &amp;lt;!-- and [[Media:review26_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review27.pdf | Preview problems No. 27]] &amp;lt;!-- and [[Media:review27_sol.pdf | Solution]] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1766</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1766"/>
		<updated>2020-06-16T00:32:59Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing Lecture 15 problem] || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem] || [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview Problems 16] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [https://drive.google.com/file/d/1ceYdAISfu2UFFcEUkV1DNwbAqLhYD4Zp/view?usp=sharing Preview Problems 17]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1bAWQ8ge6oFyXWyQmbdl9AkyQ297VLcIF/view?usp=sharingHWK HWK#4] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview Problems 18]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview Problems 19]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview Problems 20]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview Problems 21]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview Problems 22]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview Problems 23]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview Problems 24]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1765</id>
		<title>Homeworks</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1765"/>
		<updated>2020-06-16T00:32:32Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* PREVIEW PROBLEMS */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== ASSIGNED HOMEWORKS ==&lt;br /&gt;
&lt;br /&gt;
* Due 9/14/2020: [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing Homework No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1Z3aIhtKtZ_twpgoCwupeBD-xI2huV3N9/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 9/28/2020: [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing Homework No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1RvUHv-OuA21RSzhW6OXmfQwzmEaW2yBX/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 10/14/2020: [[Media:hwk3.pdf | Homework No. 3]] &amp;lt;!-- and [[Media:hwk3_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/02/2020: [[Media:hwk4.pdf | Homework No. 4]] &amp;lt;!-- and [[Media:hwk4_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/16/2020: [[Media:hwk5.pdf | Homework No. 5]] &amp;lt;!-- and [[Media:hwk5_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 12/02/2020: [[Media:hwk6.pdf | Homework No. 6]] &amp;lt;!-- and [[Media:hwk6_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== PREVIEW PROBLEMS ==&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview problems No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1qUsgFPSxOL_emnVKsIC2Ef0R3bFnevLA/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview problems No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1clKKjoAea8yMC3VRUnzH6Y96xTcOBVnV/view?usp=sharing Solution]; [[Media:Lec2.pdf | Lecture 2 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview problems No. 3] &amp;lt;!-- and [https://drive.google.com/file/d/14L4Vl3DuSRYbvau1knmITGmq9k9GDF9E/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview problems No. 5]] &amp;lt;!-- and [https://drive.google.com/file/d/17uVBKa76VdRJmOl8xChbfyU9Vga0YC9v/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview problems No. 6] &amp;lt;!-- and [https://drive.google.com/file/d/1bNacCQda5-ttaQJEjWAr-GJP7Fbv_ZYj/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview problems No. 7] &amp;lt;!-- and [https://drive.google.com/file/d/1Li68waK-SAeHn6VCjoqcGuuXuqQCC8rZ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview problems No. 8] &amp;lt;!-- and [https://drive.google.com/file/d/10czF7oMBFnBf-9kaok5AwNACFwQbfvWJ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview problems No. 9] &amp;lt;!-- and [[https://drive.google.com/file/d/1SsP4qX4JLmEFpWcw3-Cmy4r2vv6tk5rO/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview problems No. 10] &amp;lt;!-- and [https://drive.google.com/file/d/1ytgVED_tvSX2ICCgRqL90DR70UN20Jvl/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview problems No. 11] &amp;lt;!-- and [https://drive.google.com/file/d/1i5tmzZyyaSRQlv4Y9CGq54thmL3KA2nk/view?usp=sharing Solution] --&amp;gt; &lt;br /&gt;
* [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview problems No. 12] &amp;lt;!-- and [https://drive.google.com/file/d/1CK3La4-QQjPuff1ZGKbcf81wtij9hxQL/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview problems No. 13] &amp;lt;!-- and [https://drive.google.com/file/d/1HvLEnecy2zZVCvEg24tTUN5PqVELQk6H/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview problems No. 14] &amp;lt;!-- and [https://drive.google.com/file/d/1tld6Qt1nQMrU9o82dBdSZNvCv-JfZAgy/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems No. 15] &amp;lt;!-- and [https://drive.google.com/file/d/1CpqTQIfQylu1yLrO1wmuT2iWz-zgyI8L/view?usp=sharing Solution] --&amp;gt; plus [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing Lecture 15 problem &amp;amp; solution]&lt;br /&gt;
* [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview problems No. 16] &amp;lt;!-- and [https://drive.google.com/file/d/1xQhIzvaG8dJEeUFkIUxrtJ1qd77_Yreo/view?usp=sharing Solution] --&amp;gt; plus [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem &amp;amp; solution]&lt;br /&gt;
* [https://drive.google.com/file/d/1ceYdAISfu2UFFcEUkV1DNwbAqLhYD4Zp/view?usp=sharing Preview problems No. 17] &amp;lt;!-- and [https://drive.google.com/file/d/19aBq1s3WiBq-ZvFnz9Z3Uw1zfN7EDRYn/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Media:review18.pdf | Preview problems No. 18]] &amp;lt;!-- and [[Media:review18_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review19.pdf | Preview problems No. 19]] &amp;lt;!-- and [[Media:review19_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review20.pdf | Preview problems No. 20]] &amp;lt;!-- and [[Media:review20_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review21.pdf | Preview problems No. 21]] &amp;lt;!-- and [[Media:review21_sol.pdf | Solution]]; [[Media:Lecture21.pdf | Lecture 21 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review22.pdf | Preview problems No. 22]] &amp;lt;!-- and [[Media:review22_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review23.pdf | Preview problems No. 23]]  &amp;lt;!-- and [[Media:review23_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review24.pdf | Preview problems No. 24]] &amp;lt;!-- and [[Media:review24_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review25.pdf | Preview problems No. 25]] &amp;lt;!-- and [[Media:review25_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review26.pdf | Preview problems No. 26]] &amp;lt;!-- and [[Media:review26_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review27.pdf | Preview problems No. 27]] &amp;lt;!-- and [[Media:review27_sol.pdf | Solution]] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1764</id>
		<title>Homeworks</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1764"/>
		<updated>2020-06-16T00:25:04Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* PREVIEW PROBLEMS */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== ASSIGNED HOMEWORKS ==&lt;br /&gt;
&lt;br /&gt;
* Due 9/14/2020: [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing Homework No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1Z3aIhtKtZ_twpgoCwupeBD-xI2huV3N9/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 9/28/2020: [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing Homework No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1RvUHv-OuA21RSzhW6OXmfQwzmEaW2yBX/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 10/14/2020: [[Media:hwk3.pdf | Homework No. 3]] &amp;lt;!-- and [[Media:hwk3_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/02/2020: [[Media:hwk4.pdf | Homework No. 4]] &amp;lt;!-- and [[Media:hwk4_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/16/2020: [[Media:hwk5.pdf | Homework No. 5]] &amp;lt;!-- and [[Media:hwk5_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 12/02/2020: [[Media:hwk6.pdf | Homework No. 6]] &amp;lt;!-- and [[Media:hwk6_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== PREVIEW PROBLEMS ==&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview problems No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1qUsgFPSxOL_emnVKsIC2Ef0R3bFnevLA/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview problems No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1clKKjoAea8yMC3VRUnzH6Y96xTcOBVnV/view?usp=sharing Solution]; [[Media:Lec2.pdf | Lecture 2 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview problems No. 3] &amp;lt;!-- and [https://drive.google.com/file/d/14L4Vl3DuSRYbvau1knmITGmq9k9GDF9E/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview problems No. 5]] &amp;lt;!-- and [https://drive.google.com/file/d/17uVBKa76VdRJmOl8xChbfyU9Vga0YC9v/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview problems No. 6] &amp;lt;!-- and [https://drive.google.com/file/d/1bNacCQda5-ttaQJEjWAr-GJP7Fbv_ZYj/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview problems No. 7] &amp;lt;!-- and [https://drive.google.com/file/d/1Li68waK-SAeHn6VCjoqcGuuXuqQCC8rZ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview problems No. 8] &amp;lt;!-- and [https://drive.google.com/file/d/10czF7oMBFnBf-9kaok5AwNACFwQbfvWJ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview problems No. 9] &amp;lt;!-- and [[https://drive.google.com/file/d/1SsP4qX4JLmEFpWcw3-Cmy4r2vv6tk5rO/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview problems No. 10] &amp;lt;!-- and [https://drive.google.com/file/d/1ytgVED_tvSX2ICCgRqL90DR70UN20Jvl/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview problems No. 11] &amp;lt;!-- and [https://drive.google.com/file/d/1i5tmzZyyaSRQlv4Y9CGq54thmL3KA2nk/view?usp=sharing Solution] --&amp;gt; &lt;br /&gt;
* [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview problems No. 12] &amp;lt;!-- and [https://drive.google.com/file/d/1CK3La4-QQjPuff1ZGKbcf81wtij9hxQL/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview problems No. 13] &amp;lt;!-- and [https://drive.google.com/file/d/1HvLEnecy2zZVCvEg24tTUN5PqVELQk6H/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview problems No. 14] &amp;lt;!-- and [https://drive.google.com/file/d/1tld6Qt1nQMrU9o82dBdSZNvCv-JfZAgy/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems No. 15] &amp;lt;!-- and [https://drive.google.com/file/d/1CpqTQIfQylu1yLrO1wmuT2iWz-zgyI8L/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview problems No. 16] &amp;lt;!-- and [https://drive.google.com/file/d/1xQhIzvaG8dJEeUFkIUxrtJ1qd77_Yreo/view?usp=sharing Solution]; [[Media:Lecture16.pdf | Lecture 16 problem &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1ceYdAISfu2UFFcEUkV1DNwbAqLhYD4Zp/view?usp=sharing Preview problems No. 17] &amp;lt;!-- and [https://drive.google.com/file/d/19aBq1s3WiBq-ZvFnz9Z3Uw1zfN7EDRYn/view?usp=sharing Solution]; [[Media:Lecture17.pdf | Lecture 17 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Media:review18.pdf | Preview problems No. 18]] &amp;lt;!-- and [[Media:review18_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review19.pdf | Preview problems No. 19]] &amp;lt;!-- and [[Media:review19_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review20.pdf | Preview problems No. 20]] &amp;lt;!-- and [[Media:review20_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review21.pdf | Preview problems No. 21]] &amp;lt;!-- and [[Media:review21_sol.pdf | Solution]]; [[Media:Lecture21.pdf | Lecture 21 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review22.pdf | Preview problems No. 22]] &amp;lt;!-- and [[Media:review22_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review23.pdf | Preview problems No. 23]]  &amp;lt;!-- and [[Media:review23_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review24.pdf | Preview problems No. 24]] &amp;lt;!-- and [[Media:review24_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review25.pdf | Preview problems No. 25]] &amp;lt;!-- and [[Media:review25_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review26.pdf | Preview problems No. 26]] &amp;lt;!-- and [[Media:review26_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review27.pdf | Preview problems No. 27]] &amp;lt;!-- and [[Media:review27_sol.pdf | Solution]] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1763</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1763"/>
		<updated>2020-06-16T00:16:54Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* November */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing| Lecture 15 problem] --&amp;gt; || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem] --&amp;gt; || [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview Problems 16] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [https://drive.google.com/file/d/1ceYdAISfu2UFFcEUkV1DNwbAqLhYD4Zp/view?usp=sharing Preview Problems 17]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1bAWQ8ge6oFyXWyQmbdl9AkyQ297VLcIF/view?usp=sharingHWK HWK#4] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview Problems 18]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview Problems 19]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview Problems 20]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview Problems 21]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview Problems 22]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview Problems 23]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview Problems 24]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1762</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1762"/>
		<updated>2020-06-16T00:15:09Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* November */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing| Lecture 15 problem] --&amp;gt; || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem] --&amp;gt; || [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview Problems 16] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [https://drive.google.com/file/d/1ceYdAISfu2UFFcEUkV1DNwbAqLhYD4Zp/view?usp=sharing Preview Problems 17]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1bAWQ8ge6oFyXWyQmbdl9AkyQ297VLcIF/view?usp=sharingHWK #4] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview Problems 18]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview Problems 19]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview Problems 20]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview Problems 21]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview Problems 22]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview Problems 23]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview Problems 24]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1761</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1761"/>
		<updated>2020-06-16T00:09:12Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* November */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing| Lecture 15 problem] --&amp;gt; || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem] --&amp;gt; || [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview Problems 16] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [https://drive.google.com/file/d/19aBq1s3WiBq-ZvFnz9Z3Uw1zfN7EDRYn/view?usp=sharing Preview Problems 17]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview Problems 18]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview Problems 19]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview Problems 20]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview Problems 21]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview Problems 22]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview Problems 23]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview Problems 24]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1760</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1760"/>
		<updated>2020-06-16T00:00:44Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* November */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing| Lecture 15 problem] --&amp;gt; || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem] --&amp;gt; || [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview Problems 16] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview Problems 17]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview Problems 18]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview Problems 19]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview Problems 20]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview Problems 21]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview Problems 22]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview Problems 23]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview Problems 24]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1759</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1759"/>
		<updated>2020-06-15T23:53:52Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1W40JYIADtnsI-2kbY64C86B720qUgs6S/view?usp=sharing| Lecture 15 problem] --&amp;gt; || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/135wRzpv3wMw___GFalDnHAdcL817Nr6z/view?usp=sharing Lecture 16 problem] --&amp;gt; || [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview Problems 16] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1758</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1758"/>
		<updated>2020-06-15T23:35:37Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [https://drive.google.com/file/d/1wtndSvld_XTvbay4G82R7mbOJ5aBgbuq/view?usp=sharing Preview Problems 16] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1757</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1757"/>
		<updated>2020-06-15T23:27:12Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview Problems 14]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems 15]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview Problems 16]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1756</id>
		<title>Homeworks</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1756"/>
		<updated>2020-06-15T22:55:50Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* PREVIEW PROBLEMS */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== ASSIGNED HOMEWORKS ==&lt;br /&gt;
&lt;br /&gt;
* Due 9/14/2020: [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing Homework No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1Z3aIhtKtZ_twpgoCwupeBD-xI2huV3N9/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 9/28/2020: [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing Homework No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1RvUHv-OuA21RSzhW6OXmfQwzmEaW2yBX/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 10/14/2020: [[Media:hwk3.pdf | Homework No. 3]] &amp;lt;!-- and [[Media:hwk3_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/02/2020: [[Media:hwk4.pdf | Homework No. 4]] &amp;lt;!-- and [[Media:hwk4_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/16/2020: [[Media:hwk5.pdf | Homework No. 5]] &amp;lt;!-- and [[Media:hwk5_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 12/02/2020: [[Media:hwk6.pdf | Homework No. 6]] &amp;lt;!-- and [[Media:hwk6_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== PREVIEW PROBLEMS ==&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview problems No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1qUsgFPSxOL_emnVKsIC2Ef0R3bFnevLA/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview problems No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1clKKjoAea8yMC3VRUnzH6Y96xTcOBVnV/view?usp=sharing Solution]; [[Media:Lec2.pdf | Lecture 2 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview problems No. 3] &amp;lt;!-- and [https://drive.google.com/file/d/14L4Vl3DuSRYbvau1knmITGmq9k9GDF9E/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview problems No. 5]] &amp;lt;!-- and [https://drive.google.com/file/d/17uVBKa76VdRJmOl8xChbfyU9Vga0YC9v/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview problems No. 6] &amp;lt;!-- and [https://drive.google.com/file/d/1bNacCQda5-ttaQJEjWAr-GJP7Fbv_ZYj/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview problems No. 7] &amp;lt;!-- and [https://drive.google.com/file/d/1Li68waK-SAeHn6VCjoqcGuuXuqQCC8rZ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview problems No. 8] &amp;lt;!-- and [https://drive.google.com/file/d/10czF7oMBFnBf-9kaok5AwNACFwQbfvWJ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview problems No. 9] &amp;lt;!-- and [[https://drive.google.com/file/d/1SsP4qX4JLmEFpWcw3-Cmy4r2vv6tk5rO/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview problems No. 10] &amp;lt;!-- and [https://drive.google.com/file/d/1ytgVED_tvSX2ICCgRqL90DR70UN20Jvl/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview problems No. 11] &amp;lt;!-- and [https://drive.google.com/file/d/1i5tmzZyyaSRQlv4Y9CGq54thmL3KA2nk/view?usp=sharing Solution] --&amp;gt; &lt;br /&gt;
* [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview problems No. 12] &amp;lt;!-- and [https://drive.google.com/file/d/1CK3La4-QQjPuff1ZGKbcf81wtij9hxQL/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview problems No. 13] &amp;lt;!-- and [https://drive.google.com/file/d/1HvLEnecy2zZVCvEg24tTUN5PqVELQk6H/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview problems No. 14] &amp;lt;!-- and [https://drive.google.com/file/d/1tld6Qt1nQMrU9o82dBdSZNvCv-JfZAgy/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview problems No. 15] &amp;lt;!-- and [https://drive.google.com/file/d/1CpqTQIfQylu1yLrO1wmuT2iWz-zgyI8L/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Media:review16.pdf | Preview problems No. 16]] &amp;lt;!-- and [[Media:review16_sol.pdf | Solution]]; [[Media:Lecture16.pdf | Lecture 16 problem &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review17.pdf | Preview problems No. 17]] &amp;lt;!-- and [[Media:review17_sol.pdf | Solution]]; [[Media:Lecture17.pdf | Lecture 17 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review18.pdf | Preview problems No. 18]] &amp;lt;!-- and [[Media:review18_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review19.pdf | Preview problems No. 19]] &amp;lt;!-- and [[Media:review19_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review20.pdf | Preview problems No. 20]] &amp;lt;!-- and [[Media:review20_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review21.pdf | Preview problems No. 21]] &amp;lt;!-- and [[Media:review21_sol.pdf | Solution]]; [[Media:Lecture21.pdf | Lecture 21 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review22.pdf | Preview problems No. 22]] &amp;lt;!-- and [[Media:review22_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review23.pdf | Preview problems No. 23]]  &amp;lt;!-- and [[Media:review23_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review24.pdf | Preview problems No. 24]] &amp;lt;!-- and [[Media:review24_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review25.pdf | Preview problems No. 25]] &amp;lt;!-- and [[Media:review25_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review26.pdf | Preview problems No. 26]] &amp;lt;!-- and [[Media:review26_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review27.pdf | Preview problems No. 27]] &amp;lt;!-- and [[Media:review27_sol.pdf | Solution]] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1755</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1755"/>
		<updated>2020-04-20T18:32:59Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview 14 Problems]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [[Media:review16.pdf | Preview 15 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview 17 Problems]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1754</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1754"/>
		<updated>2020-04-20T15:55:01Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview 14 Problems]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [[Media:review16.pdf | Preview 16 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview 17 Problems]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1753</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1753"/>
		<updated>2020-04-20T15:53:50Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [[Media:review15.pdf | Preview 15 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [[Media:review16.pdf | Preview 16 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview 17 Problems]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1752</id>
		<title>Homeworks</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1752"/>
		<updated>2020-04-09T14:01:47Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* PREVIEW PROBLEMS */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== ASSIGNED HOMEWORKS ==&lt;br /&gt;
&lt;br /&gt;
* Due 9/14/2020: [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing Homework No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1Z3aIhtKtZ_twpgoCwupeBD-xI2huV3N9/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 9/28/2020: [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing Homework No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1RvUHv-OuA21RSzhW6OXmfQwzmEaW2yBX/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 10/14/2020: [[Media:hwk3.pdf | Homework No. 3]] &amp;lt;!-- and [[Media:hwk3_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/02/2020: [[Media:hwk4.pdf | Homework No. 4]] &amp;lt;!-- and [[Media:hwk4_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/16/2020: [[Media:hwk5.pdf | Homework No. 5]] &amp;lt;!-- and [[Media:hwk5_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 12/02/2020: [[Media:hwk6.pdf | Homework No. 6]] &amp;lt;!-- and [[Media:hwk6_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== PREVIEW PROBLEMS ==&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview problems No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1qUsgFPSxOL_emnVKsIC2Ef0R3bFnevLA/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview problems No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1clKKjoAea8yMC3VRUnzH6Y96xTcOBVnV/view?usp=sharing Solution]; [[Media:Lec2.pdf | Lecture 2 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview problems No. 3] &amp;lt;!-- and [https://drive.google.com/file/d/14L4Vl3DuSRYbvau1knmITGmq9k9GDF9E/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview problems No. 5]] &amp;lt;!-- and [https://drive.google.com/file/d/17uVBKa76VdRJmOl8xChbfyU9Vga0YC9v/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview problems No. 6] &amp;lt;!-- and [https://drive.google.com/file/d/1bNacCQda5-ttaQJEjWAr-GJP7Fbv_ZYj/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview problems No. 7] &amp;lt;!-- and [https://drive.google.com/file/d/1Li68waK-SAeHn6VCjoqcGuuXuqQCC8rZ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview problems No. 8] &amp;lt;!-- and [https://drive.google.com/file/d/10czF7oMBFnBf-9kaok5AwNACFwQbfvWJ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview problems No. 9] &amp;lt;!-- and [[https://drive.google.com/file/d/1SsP4qX4JLmEFpWcw3-Cmy4r2vv6tk5rO/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview problems No. 10] &amp;lt;!-- and [https://drive.google.com/file/d/1ytgVED_tvSX2ICCgRqL90DR70UN20Jvl/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview problems No. 11] &amp;lt;!-- and [https://drive.google.com/file/d/1i5tmzZyyaSRQlv4Y9CGq54thmL3KA2nk/view?usp=sharing Solution] --&amp;gt; &lt;br /&gt;
* [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview problems No. 12] &amp;lt;!-- and [https://drive.google.com/file/d/1CK3La4-QQjPuff1ZGKbcf81wtij9hxQL/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview problems No. 13] &amp;lt;!-- and [https://drive.google.com/file/d/1HvLEnecy2zZVCvEg24tTUN5PqVELQk6H/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview problems No. 14] &amp;lt;!-- and [https://drive.google.com/file/d/1tld6Qt1nQMrU9o82dBdSZNvCv-JfZAgy/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Media:review15.pdf | Preview problems No. 15]] &amp;lt;!-- and [[Media:review15_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review16.pdf | Preview problems No. 16]] &amp;lt;!-- and [[Media:review16_sol.pdf | Solution]]; [[Media:Lecture16.pdf | Lecture 16 problem &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review17.pdf | Preview problems No. 17]] &amp;lt;!-- and [[Media:review17_sol.pdf | Solution]]; [[Media:Lecture17.pdf | Lecture 17 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review18.pdf | Preview problems No. 18]] &amp;lt;!-- and [[Media:review18_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review19.pdf | Preview problems No. 19]] &amp;lt;!-- and [[Media:review19_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review20.pdf | Preview problems No. 20]] &amp;lt;!-- and [[Media:review20_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review21.pdf | Preview problems No. 21]] &amp;lt;!-- and [[Media:review21_sol.pdf | Solution]]; [[Media:Lecture21.pdf | Lecture 21 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review22.pdf | Preview problems No. 22]] &amp;lt;!-- and [[Media:review22_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review23.pdf | Preview problems No. 23]]  &amp;lt;!-- and [[Media:review23_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review24.pdf | Preview problems No. 24]] &amp;lt;!-- and [[Media:review24_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review25.pdf | Preview problems No. 25]] &amp;lt;!-- and [[Media:review25_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review26.pdf | Preview problems No. 26]] &amp;lt;!-- and [[Media:review26_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review27.pdf | Preview problems No. 27]] &amp;lt;!-- and [[Media:review27_sol.pdf | Solution]] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1751</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1751"/>
		<updated>2020-04-09T13:51:50Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk3.pdf |HWK #3]] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| Exam 1 covers everything from the first lecture up to this point ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [[Media:review15.pdf | Preview 15 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [[Media:review16.pdf | Preview 16 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview 17 Problems]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Exams&amp;diff=1750</id>
		<title>Exams</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Exams&amp;diff=1750"/>
		<updated>2020-04-09T13:50:52Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* Previous Years Exams */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;===Exams &amp;amp; Quizzes===&lt;br /&gt;
&lt;br /&gt;
* '''2020'''&lt;br /&gt;
** TBD&lt;br /&gt;
====Previous Years Exams====&lt;br /&gt;
* '''2016'''&lt;br /&gt;
** [https://drive.google.com/file/d/1NDhUSRRBVpHdNHFLV4P1iEq2u7GoItcp/view?usp=sharing Solution to Quiz 1]&lt;br /&gt;
** [https://drive.google.com/file/d/1RkXAwQHEHkVoJByvLQb8Nnx4K2DNj7_I/view?usp=sharing Solution to Quiz 2]&lt;br /&gt;
** [https://drive.google.com/file/d/1qh2UuSY-VgprbtgYB1TRAHzZmSt8ljZI/view?usp=sharing Solution to Quiz 3]&lt;br /&gt;
** [https://drive.google.com/file/d/1PeFDPMGFL0L4-wKkEzwgNsDD0nED3AA7/view?usp=sharing Solution to Quiz 4]&lt;br /&gt;
** [[Media:midterm_sol_2016.pdf | Solution to exam 2]]&lt;br /&gt;
** [[Media:final_sol_2016.pdf | Solution to exam 2]]&lt;br /&gt;
* '''2015'''&lt;br /&gt;
** [https://drive.google.com/file/d/1pGEIXdKpNx_CvmKKaLGHYiMZCDl8uG_0/view?usp=sharing Solution to Quiz 1]&lt;br /&gt;
** [https://drive.google.com/file/d/1njzVjEWKjfDsZ1Q1-pgsfKrj3oGnMdna/view?usp=sharing Solution to Quiz 2]&lt;br /&gt;
** [https://drive.google.com/file/d/1k5LptzaSNdcj_6WY3mtbWHJ7mxnyjSN8/view?usp=sharing Solution to Quiz 3]&lt;br /&gt;
** [https://drive.google.com/file/d/1vUfb4tVm87GLqSnBPMT9UPa_jujRyWyy/view?usp=sharing Solution to Quiz 4]&lt;br /&gt;
** [[Media:midterm_sol_2015.pdf | Solution to exam 1]]&lt;br /&gt;
** [[Media:Final_sol_2015.pdf | Solution to exam 2]]&lt;br /&gt;
* '''2014'''&lt;br /&gt;
** [https://drive.google.com/file/d/1Wx45qy7ptYa3S0xdWFmOcdl_C79zWSO4/view?usp=sharing Solution to exam 1a]&lt;br /&gt;
** [https://drive.google.com/file/d/12qWJ5iYm1L06Xa4Tl_w4gKC-fwuic2av/view?usp=sharing Solution to exam 1b]&lt;br /&gt;
** [https://drive.google.com/file/d/1PHC9GwKmATtbBiPdL7ljv-gsxhz8prCH/view?usp=sharing Solution to exam 2]&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1749</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1749"/>
		<updated>2020-04-09T13:49:22Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Review session || Check the [[Exams | Exams &amp;amp; quizzes]] page for past exams || It is your responsibility to come-up with questions to ask ||  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk3.pdf |HWK #3]] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [[Media:review15.pdf | Preview 15 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [[Media:review16.pdf | Preview 16 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview 17 Problems]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1748</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1748"/>
		<updated>2020-03-16T16:22:27Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* October */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [[Media:review14.pdf | Preview 14 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk3.pdf |HWK #3]] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [[Media:review15.pdf | Preview 15 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [[Media:review16.pdf | Preview 16 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview 17 Problems]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1747</id>
		<title>Homeworks</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1747"/>
		<updated>2020-03-16T16:22:09Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* PREVIEW PROBLEMS */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== ASSIGNED HOMEWORKS ==&lt;br /&gt;
&lt;br /&gt;
* Due 9/14/2020: [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing Homework No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1Z3aIhtKtZ_twpgoCwupeBD-xI2huV3N9/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 9/28/2020: [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing Homework No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1RvUHv-OuA21RSzhW6OXmfQwzmEaW2yBX/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 10/14/2020: [[Media:hwk3.pdf | Homework No. 3]] &amp;lt;!-- and [[Media:hwk3_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/02/2020: [[Media:hwk4.pdf | Homework No. 4]] &amp;lt;!-- and [[Media:hwk4_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/16/2020: [[Media:hwk5.pdf | Homework No. 5]] &amp;lt;!-- and [[Media:hwk5_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 12/02/2020: [[Media:hwk6.pdf | Homework No. 6]] &amp;lt;!-- and [[Media:hwk6_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== PREVIEW PROBLEMS ==&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview problems No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1qUsgFPSxOL_emnVKsIC2Ef0R3bFnevLA/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview problems No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1clKKjoAea8yMC3VRUnzH6Y96xTcOBVnV/view?usp=sharing Solution]; [[Media:Lec2.pdf | Lecture 2 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview problems No. 3] &amp;lt;!-- and [https://drive.google.com/file/d/14L4Vl3DuSRYbvau1knmITGmq9k9GDF9E/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview problems No. 5]] &amp;lt;!-- and [https://drive.google.com/file/d/17uVBKa76VdRJmOl8xChbfyU9Vga0YC9v/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview problems No. 6] &amp;lt;!-- and [https://drive.google.com/file/d/1bNacCQda5-ttaQJEjWAr-GJP7Fbv_ZYj/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview problems No. 7] &amp;lt;!-- and [https://drive.google.com/file/d/1Li68waK-SAeHn6VCjoqcGuuXuqQCC8rZ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview problems No. 8] &amp;lt;!-- and [https://drive.google.com/file/d/10czF7oMBFnBf-9kaok5AwNACFwQbfvWJ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview problems No. 9] &amp;lt;!-- and [[https://drive.google.com/file/d/1SsP4qX4JLmEFpWcw3-Cmy4r2vv6tk5rO/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview problems No. 10] &amp;lt;!-- and [https://drive.google.com/file/d/1ytgVED_tvSX2ICCgRqL90DR70UN20Jvl/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview problems No. 11] &amp;lt;!-- and [https://drive.google.com/file/d/1i5tmzZyyaSRQlv4Y9CGq54thmL3KA2nk/view?usp=sharing Solution] --&amp;gt; &lt;br /&gt;
* [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview problems No. 12] &amp;lt;!-- and [https://drive.google.com/file/d/1CK3La4-QQjPuff1ZGKbcf81wtij9hxQL/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview problems No. 13] &amp;lt;!-- and [https://drive.google.com/file/d/1HvLEnecy2zZVCvEg24tTUN5PqVELQk6H/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Media:review14.pdf | Preview problems No. 14]] &amp;lt;!-- and [[Media:Review14_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review15.pdf | Preview problems No. 15]] &amp;lt;!-- and [[Media:review15_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review16.pdf | Preview problems No. 16]] &amp;lt;!-- and [[Media:review16_sol.pdf | Solution]]; [[Media:Lecture16.pdf | Lecture 16 problem &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review17.pdf | Preview problems No. 17]] &amp;lt;!-- and [[Media:review17_sol.pdf | Solution]]; [[Media:Lecture17.pdf | Lecture 17 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review18.pdf | Preview problems No. 18]] &amp;lt;!-- and [[Media:review18_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review19.pdf | Preview problems No. 19]] &amp;lt;!-- and [[Media:review19_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review20.pdf | Preview problems No. 20]] &amp;lt;!-- and [[Media:review20_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review21.pdf | Preview problems No. 21]] &amp;lt;!-- and [[Media:review21_sol.pdf | Solution]]; [[Media:Lecture21.pdf | Lecture 21 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review22.pdf | Preview problems No. 22]] &amp;lt;!-- and [[Media:review22_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review23.pdf | Preview problems No. 23]]  &amp;lt;!-- and [[Media:review23_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review24.pdf | Preview problems No. 24]] &amp;lt;!-- and [[Media:review24_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review25.pdf | Preview problems No. 25]] &amp;lt;!-- and [[Media:review25_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review26.pdf | Preview problems No. 26]] &amp;lt;!-- and [[Media:review26_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review27.pdf | Preview problems No. 27]] &amp;lt;!-- and [[Media:review27_sol.pdf | Solution]] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1746</id>
		<title>Homeworks</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Homeworks&amp;diff=1746"/>
		<updated>2020-03-16T16:21:46Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* PREVIEW PROBLEMS */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== ASSIGNED HOMEWORKS ==&lt;br /&gt;
&lt;br /&gt;
* Due 9/14/2020: [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing Homework No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1Z3aIhtKtZ_twpgoCwupeBD-xI2huV3N9/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 9/28/2020: [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing Homework No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1RvUHv-OuA21RSzhW6OXmfQwzmEaW2yBX/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* Due 10/14/2020: [[Media:hwk3.pdf | Homework No. 3]] &amp;lt;!-- and [[Media:hwk3_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/02/2020: [[Media:hwk4.pdf | Homework No. 4]] &amp;lt;!-- and [[Media:hwk4_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 11/16/2020: [[Media:hwk5.pdf | Homework No. 5]] &amp;lt;!-- and [[Media:hwk5_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* Due 12/02/2020: [[Media:hwk6.pdf | Homework No. 6]] &amp;lt;!-- and [[Media:hwk6_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== PREVIEW PROBLEMS ==&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview problems No. 1] &amp;lt;!-- and [https://drive.google.com/file/d/1qUsgFPSxOL_emnVKsIC2Ef0R3bFnevLA/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview problems No. 2] &amp;lt;!-- and [https://drive.google.com/file/d/1clKKjoAea8yMC3VRUnzH6Y96xTcOBVnV/view?usp=sharing Solution]; [[Media:Lec2.pdf | Lecture 2 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview problems No. 3] &amp;lt;!-- and [https://drive.google.com/file/d/14L4Vl3DuSRYbvau1knmITGmq9k9GDF9E/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview problems No. 5]] &amp;lt;!-- and [https://drive.google.com/file/d/17uVBKa76VdRJmOl8xChbfyU9Vga0YC9v/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview problems No. 6] &amp;lt;!-- and [https://drive.google.com/file/d/1bNacCQda5-ttaQJEjWAr-GJP7Fbv_ZYj/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview problems No. 7] &amp;lt;!-- and [https://drive.google.com/file/d/1Li68waK-SAeHn6VCjoqcGuuXuqQCC8rZ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview problems No. 8] &amp;lt;!-- and [https://drive.google.com/file/d/10czF7oMBFnBf-9kaok5AwNACFwQbfvWJ/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview problems No. 9] &amp;lt;!-- and [[https://drive.google.com/file/d/1SsP4qX4JLmEFpWcw3-Cmy4r2vv6tk5rO/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview problems No. 10] &amp;lt;!-- and [https://drive.google.com/file/d/1ytgVED_tvSX2ICCgRqL90DR70UN20Jvl/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview problems No. 11] &amp;lt;!-- and [https://drive.google.com/file/d/1i5tmzZyyaSRQlv4Y9CGq54thmL3KA2nk/view?usp=sharing Solution] --&amp;gt; &lt;br /&gt;
* [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview problems No. 12] &amp;lt;!-- and [https://drive.google.com/file/d/1CK3La4-QQjPuff1ZGKbcf81wtij9hxQL/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview problems No. 13] &amp;lt;!-- and [https://drive.google.com/file/d/1HvLEnecy2zZVCvEg24tTUN5PqVELQk6H/view?usp=sharing Solution] --&amp;gt;&lt;br /&gt;
* [[Media:review14.pdf | Preview problems No. 14]] &amp;lt;!-- and [[Media:Review14_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review15.pdf | Preview problems No. 15]] &amp;lt;!-- and [[Media:review15_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review16.pdf | Preview problems No. 16]] &amp;lt;!-- and [[Media:review16_sol.pdf | Solution]]; [[Media:Lecture16.pdf | Lecture 16 problem &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review17.pdf | Preview problems No. 17]] &amp;lt;!-- and [[Media:review17_sol.pdf | Solution]]; [[Media:Lecture17.pdf | Lecture 17 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review18.pdf | Preview problems No. 18]] &amp;lt;!-- and [[Media:review18_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review19.pdf | Preview problems No. 19]] &amp;lt;!-- and [[Media:review19_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review20.pdf | Preview problems No. 20]] &amp;lt;!-- and [[Media:review20_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review21.pdf | Preview problems No. 21]] &amp;lt;!-- and [[Media:review21_sol.pdf | Solution]]; [[Media:Lecture21.pdf | Lecture 21 problems &amp;amp; solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review22.pdf | Preview problems No. 22]] &amp;lt;!-- and [[Media:review22_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review23.pdf | Preview problems No. 23]]  &amp;lt;!-- and [[Media:review23_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review24.pdf | Preview problems No. 24]] &amp;lt;!-- and [[Media:review24_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review25.pdf | Preview problems No. 25]] &amp;lt;!-- and [[Media:review25_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review26.pdf | Preview problems No. 26]] &amp;lt;!-- and [[Media:review26_sol.pdf | Solution]] --&amp;gt;&lt;br /&gt;
* [[Media:review27.pdf | Preview problems No. 27]] &amp;lt;!-- and [[Media:review27_sol.pdf | Solution]] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
	<entry>
		<id>http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1745</id>
		<title>Syllabus</title>
		<link rel="alternate" type="text/html" href="http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&amp;diff=1745"/>
		<updated>2020-03-16T16:11:16Z</updated>

		<summary type="html">&lt;p&gt;Guerin: /* September */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Syllabus &amp;amp; (tentative) Schedule==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Schedule at-a-glance===&lt;br /&gt;
&lt;br /&gt;
'''Class times and location''': Monday &amp;amp; Wednesday, 4:00pm-5:20pm in TBD.&lt;br /&gt;
&lt;br /&gt;
'''Legend: date (quizzes &amp;amp; exams) and due date (homeworks)'''&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
! Hmwk&lt;br /&gt;
! Quizz&lt;br /&gt;
! Exam&lt;br /&gt;
! No class&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background-color: SpringGreen;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: SkyBlue;&amp;quot;|&amp;lt;br&amp;gt; &lt;br /&gt;
| style=&amp;quot;background-color: yellow;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
| style=&amp;quot;background-color: red;&amp;quot;|&amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; color: black; border-style: solid; border-width: 2px&amp;quot;&lt;br /&gt;
!&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
! Mo.&lt;br /&gt;
! We.&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| August&lt;br /&gt;
| 24 || 26 || 31 &lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| September&lt;br /&gt;
|   || 2 ||style=&amp;quot;background-color: Red;&amp;quot;| 7 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14|| 16 || 21 || 23 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 28 || 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| October&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 5 || 7 ||style=&amp;quot;background-color: Red;&amp;quot;| 12||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 14 ||style=&amp;quot;background-color: yellow;&amp;quot;| 19 || 21 || 26 || 28&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| November&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 || 4 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9 || 11 ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 16 || 18 || 23 ||style=&amp;quot;background-color: Red;&amp;quot;| 25 ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| 30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| December&lt;br /&gt;
|  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| 2 ||   ||   ||  ||  ||style=&amp;quot;background-color: yellow;&amp;quot;| 11&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span style=&amp;quot;color: red; text-decoration:blink;&amp;quot;&amp;gt;&lt;br /&gt;
'''EXAM 1: Monday October 19, 2020, in class''' &amp;lt;br&amp;gt;&lt;br /&gt;
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in &amp;lt;u&amp;gt;TBD&amp;lt;/u&amp;gt;'''&lt;br /&gt;
&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Detailed Schedule &amp;amp; Syllabus===&lt;br /&gt;
&lt;br /&gt;
'''NOTE''':  This schedule in '''TENTATIVE''', and '''LIKELY''' to change as certain topics may end-up being harder or easier than anticipated.  Changes to the schedule will be reflected as quickly as possible on this page.&lt;br /&gt;
&lt;br /&gt;
==August==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 &amp;amp; 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]&amp;lt;br/&amp;gt;[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro &amp;amp; Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || &lt;br /&gt;
|-&lt;br /&gt;
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 &amp;amp; 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://drive.google.com/file/d/1U30FOFGft9Vyx0oZd4h0WSdKqQKdAuYh/view?usp=sharing Practice Problems] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||&lt;br /&gt;
|-&lt;br /&gt;
| 8/31 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==September==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
| 9/2 || An introduction of general principles such as Little's Law and various other &amp;quot;laws&amp;quot; and bounds for closed system, which hold with little or no assumptions || Chapters 6 &amp;amp; 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little &amp;amp; Operational Laws]  ||  &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 9/7 ||style=&amp;quot;background-color: Red;&amp;quot;| '''LABOR DAY''' ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 9/9 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing &amp;quot;Web caching as a DTMC&amp;quot;] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/14 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] &lt;br /&gt;
|-&lt;br /&gt;
| 9/16 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7]&lt;br /&gt;
|-&lt;br /&gt;
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) &amp;amp; Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1zhE-xb7hhrt-DID8egz4oKsunb0w5OaE/view?usp=sharing ''z''-transform solution for Geom/Geom/1 queue] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||&lt;br /&gt;
|-&lt;br /&gt;
| 9/23 || Exponential distribution &amp;amp; Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 9/28 ||Introduction to continuous time Markov chains (CTMC) ||  Chapter 12 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1cdrhRSjIBEabusVVo_a6METRQoGGPyu0/view?usp=sharing Preview Problems 10] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]&lt;br /&gt;
|-&lt;br /&gt;
| 9/30 || M/M/1 queue &amp;amp; PASTA theorem|| Chapter 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential &amp;amp; Poisson Distributions] (for PASTA), and [https://drive.google.com/file/d/13qY3GoFctqYoeJgMYrPSEsocysRIsd0e/view?usp=sharing and some related problems]] || [https://drive.google.com/file/d/1BATI-auNH2hgFc-BA2E09pWMzrVg4r3F/view?usp=sharing Preview Problems 11] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==October==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 10/5 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] || style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 2&lt;br /&gt;
|-&lt;br /&gt;
| 10/7 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9] || [[Media:review13.pdf | Preview 13 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: red;&amp;quot;| 10/12 || style=&amp;quot;background-color: red;&amp;quot;| '''FALL BREAK''' ||style=&amp;quot;background-color: red;&amp;quot;| '''NO CLASS''' ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;| ||style=&amp;quot;background-color: red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 10/14 || Applications to system provisioning || Chapter 15 + Sections 8.11 &amp;amp; 8.12 of [https://drive.google.com/file/d/1uuIWpyiPrdxe4_VzayREQVyTtRFErx29/view?usp=sharing Zukerman's book] (Hayward approximation and Equivalent Random Theory)|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10] || [[Media:review14.pdf | Preview 14 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk3.pdf |HWK #3]] &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 10/19 || style=&amp;quot;background-color: yellow;&amp;quot;| '''IN CLASS EXAM 1''' ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
| 10/21 || Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]  || [[Media:review15.pdf | Preview 15 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/26 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture16.pdf | Lecture 16 problems]] --&amp;gt; || [[Media:review16.pdf | Preview 16 Problems]]  ||&lt;br /&gt;
|-&lt;br /&gt;
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11]&amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture17.pdf | Lecture 17 problems]] --&amp;gt; || [[Media:review17.pdf | Preview 17 Problems]] ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==November==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/02 || Closed Jackson networks &amp;amp; mean value analysis (MVA) || Chapter 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] || [[Media:review18.pdf | Preview 18 Problems]]  ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk4.pdf |HWK #4]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/04 || A quick introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12] || [[Media:review19.pdf | Preview 19 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/9 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13] || [[Media:review20.pdf | Preview 20 Problems]] ||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 3 &lt;br /&gt;
|-&lt;br /&gt;
| 11/11 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14] &amp;lt;!-- &amp;lt;br/&amp;gt; and [[Media:Lecture21.pdf | Lecture 21 problems]] --&amp;gt; || [[Media:review21.pdf | Preview 21 Problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 11/16 || A brief foray into server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15] || [[Media:review22.pdf | Preview 22 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk5.pdf |HWK #5]] &lt;br /&gt;
|-&lt;br /&gt;
| 11/18 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16]&amp;lt;br/&amp;gt; and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview 23 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
| 11/23 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17] || [[Media:review24.pdf | Preview 24 Problems]] ||&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: Red;&amp;quot;| 11/25 ||style=&amp;quot;background-color: Red;&amp;quot;| '''NO CLASS - THANKSGIVING BREAK''' ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;| ||style=&amp;quot;background-color: Red;&amp;quot;|&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SkyBlue;&amp;quot;| 11/30 || M/G/1 queue with non-preemptive scheduling priorities || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18] || [[Media:review25.pdf | Preview 25 Problems]]||style=&amp;quot;background-color: SkyBlue;&amp;quot;| Quiz 4 &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==December==&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Date&lt;br /&gt;
! Scope &lt;br /&gt;
! Material &amp;amp; Reading Assignments&lt;br /&gt;
(To Be Read Ahead of Class)&lt;br /&gt;
! Notes &amp;amp; slides&lt;br /&gt;
(If any)&lt;br /&gt;
! Preview Problems&lt;br /&gt;
! Quizzes &amp;amp; Homeworks&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: SpringGreen;&amp;quot;| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 &amp;amp; Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style=&amp;quot;background-color: SpringGreen;&amp;quot;| [[Media:hwk6.pdf |HWK #6]] &lt;br /&gt;
|-&lt;br /&gt;
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) &amp;amp; Chapter 33 ||  [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] || &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: yellow;&amp;quot;| 12/20 || style=&amp;quot;background-color: yellow;&amp;quot;| '''EXAM 2''' ||style=&amp;quot;background-color: yellow;&amp;quot;| '''(6:00-8:00pm in TBD)'''||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;| ||style=&amp;quot;background-color: yellow;&amp;quot;|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Guerin</name></author>
		
	</entry>
</feed>