Difference between revisions of "Syllabus"

From CSE538 Wiki
Jump to navigation Jump to search
 
(463 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
==Syllabus==
+
==Syllabus & (tentative) Schedule==
−
{|
+
 
 +
<span style="color: red; text-decoration:blink;">'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY'''</span>
 +
 
 +
===Schedule at-a-glance===
 +
 
 +
'''Class times and location''': Monday & Wednesday, 4:00pm-5:20pm in TBD.
 +
 
 +
'''Legend: date (quizzes & exams) and due date (homeworks)'''
 +
{| class="wikitable" style="text-align: center; color: black; border-style: solid; border-width: 2px"
 +
! Hmwk
 +
! Quizz
 +
! Exam
 +
! No class
 +
|-
 +
| style="background-color: SpringGreen;"|<br>
 +
| style="background-color: SkyBlue;"|<br>
 +
| style="background-color: yellow;"|<br>
 +
| style="background-color: red;"|<br>
 +
|}
 +
 
 +
{| class="wikitable" style="text-align: center; color: black; border-style: solid; border-width: 2px"
 +
!
 +
! Mo.
 +
! We.
 +
! Mo.
 +
! We.
 +
! Mo.
 +
! We.
 +
! Mo.
 +
! We.
 +
! Mo.
 +
! We.
 +
|-
 +
! style="text-align:left;"| August
 +
| 24 || 26 || 31
 +
|-
 +
! style="text-align:left;"| September
 +
|  || 2 ||style="background-color: Red;"| 7 ||style="background-color: SkyBlue;"| 9 ||style="background-color: SpringGreen;"| 14|| 16 || 21 || 23 ||style="background-color: SpringGreen;"| 28 || 30
 +
|-
 +
! style="text-align:left;"| October
 +
|style="background-color: SkyBlue;"| 5 || 7 ||style="background-color: Red;"| 12||style="background-color: SpringGreen;"| 14 ||style="background-color: yellow;"| 19 || 21 || 26 || 28
 +
|-
 +
! style="text-align:left;"| November
 +
|style="background-color: SpringGreen;"| 2 || 4 ||style="background-color: SkyBlue;"| 9 || 11 ||style="background-color: SpringGreen;"| 16 || 18 || 23 ||style="background-color: Red;"| 25 ||style="background-color: SkyBlue;"| 30
 +
|-
 +
! style="text-align:left;"| December
 +
|  ||style="background-color: SpringGreen;"| 2 ||  ||  ||  ||  ||style="background-color: yellow;"| 11
 +
|}
 +
 
 +
<span style="color: red; text-decoration:blink;">
 +
'''EXAM 1: Monday October 19, 2020, in class''' <br>
 +
'''EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in <u>TBD</u>'''
 +
</span>
 +
 
 +
===Detailed Schedule & Syllabus===
 +
 
 +
'''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.
 +
 
 +
==August==
 +
{|class="wikitable"
 
! style="text-align:left;"| Date
 
! style="text-align:left;"| Date
 
! Scope  
 
! Scope  
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 
! Notes & slides
 
! Notes & slides
−
! Reading Assignments
+
(If any)
−
! Review Questions
+
! Preview Problems
−
! Labs/Quizzes
+
! Quizzes & Homeworks
 
|-
 
|-
−
| 8/26 || A brief overview of the Internet, its components, and performance aspects || || Chapter 1, RFC 1958, RFC 3439 || NA || NA
+
| 8/24 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 & 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]<br/>[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro & Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] ||
 +
|-
 +
| 8/26 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 & 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] ||
 +
|-
 +
| 8/31 || An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions || Chapters 6 & 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little & Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3]
 +
|}
 +
 
 +
==September==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 8/28 || Network applications & the web || || Chapter 1, Sections 2.1, 2.2, RFC 2616 || ||  
+
| 9/2 || An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions || Chapters 6 & 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little & Operational Laws]  ||
 
|-
 
|-
−
| 9/2 || The Domain Name System (DNS) || || Section 2.5, RFC 1034, RFC 1035 || ||
+
|style="background-color: Red;"| 9/7 ||style="background-color: Red;"| '''LABOR DAY''' ||style="background-color: Red;"| '''NO CLASS''' ||style="background-color: Red;"| ||style="background-color: Red;"| ||style="background-color: Red;"|
 
|-
 
|-
−
| 9/4 || Transport layer overview and socket programming (UDP) || || Sections 3.1-3.3, 2.7.1, [http://docs.oracle.com/javase/tutorial/networking/sockets/index.html Java sockets tutorial] || ||
+
|style="background-color: SkyBlue;"| 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]<br/> and [https://drive.google.com/file/d/1HMzr4qbRTKy42DZ5UmIjo5vNF0dAr1AQ/view?usp=sharing "Web caching as a DTMC"] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style="background-color: SkyBlue;"| Quiz 1
 
|-
 
|-
−
| 9/9 || File transfer application (FTP) and email application (SMTP) || || Sections 2.3 & 2.4, RFC 959, RFC 2821 || ||
+
|style="background-color: SpringGreen;"| 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="background-color: SpringGreen;"| [https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1]
 
|-
 
|-
−
| 9/11 || Other useful Internet protocols & mechanisms:  ICMP, DHCP, NATs || || Section 4.4 (pp. 345-355), RFC 792, RFC 2131, RFC 2663, RFC 2131 || ||  
+
| 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]
 
|-
 
|-
−
| 9/16 || P2P applications || || Section 2.6 || ||
+
| 9/21 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) & 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]<br/> and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples]<br/> 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] ||
 
|-
 
|-
−
| 9/18 || Principles of reliable data transport || || Section 3.4 || ||
+
| 9/23 || Exponential distribution & Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Exponential & Poisson Distributions] (except the material on PASTA) || [[https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||
 
|-
 
|-
−
| 9/23 || A closer look at TCP || || Sections 3.5, 2.7.2 || ||
+
|style="background-color: SpringGreen;"| 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="background-color: SpringGreen;"| [https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]
 
|-
 
|-
−
| 9/25 || TCP flow and congestion control || || Sections 3.6, 3.7, RFC 5681, RFC 6582 || ||
+
| 9/30 || M/M/1 queue & 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 & 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] ||  
 +
|}
 +
 
 +
==October==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 9/30 || IPv4 protocol and Internet routers (IP addresses & subnets, router architecture) || || Sections 4.1-4.3, 4.4 (up to p. 345), RFC 1812 || ||
+
|style="background-color: SkyBlue;"| 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="background-color: SkyBlue;"| Quiz 2
 
|-
 
|-
−
| 10/2 || Routing (shortest path) algorithms || || Section 4.5 || ||
+
| 10/7 || Applications to system provisioning || Chapter 15 + Sections 8.11 & 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]  ||
 
|-
 
|-
−
| 10/7 || Intra-domain rouging protocols (OSPF, IS-IS, EIGRP) || || Sections 4.6.1-2, RFC 2328, RFC 1195, [http://ccrg.soe.ucsc.edu/publications/interop94.pdf EIGRP paper] || ||
+
|style="background-color: red;"| 10/12 || style="background-color: red;"| '''FALL BREAK''' ||style="background-color: red;"| '''NO CLASS''' ||style="background-color: red;"| ||style="background-color: red;"| ||style="background-color: red;"|
 
|-
 
|-
−
| 10/9 || Review session || || || ||
+
|style="background-color: SpringGreen;"| 10/14 || Review session || Check the [[Exams | Exams & quizzes]] page for past exams || It is your responsibility to come-up with questions to ask || ||style="background-color: SpringGreen;"| [https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3]
 
|-
 
|-
−
| 10/14 || '''IN CLASS MIDTERM''' || || || ||
+
|style="background-color: yellow;"| 10/19 || style="background-color: yellow;"| '''IN CLASS EXAM 1''' ||style="background-color: yellow;"| Exam 1 covers everything from the first lecture up to this point ||style="background-color: yellow;"| ||style="background-color: yellow;"| ||style="background-color: yellow;"|
 
|-
 
|-
−
| 10/16 || Inter-domain routing (BGP) || || Section 4.6.3, RFC 4271, Avi Freedman BGP tutorials ([http://freedman.net/bgbgp.ppt BGP1] and [http://freedman.net/bgp102.ppt BGP2]) || ||
+
| 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] ||
 
|-
 
|-
−
| 10/21 || Multicast routing || || Section 4.7, RFC 2236 (Sections 1-3), RFC 3376 (Sections 1-6), RFC 4601 (Sections 1-3), RFC 4607 (Sections 1-6) || ||
+
| 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] <br/> 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]  ||
 
|-
 
|-
−
| 10/23 || Link layer & Ethernet || || Section 5.1-5.6, [http://en.wikipedia.org/wiki/Spanning_Tree_Protocol Spanning Tree Protocol], RFC 826 || ||
+
| 10/28 || Classed Jackson networks || Chapter 18 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11] <br/> 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] ||
 +
|}
 +
 
 +
==November==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 10/28 || Link layer & Ethernet || || Section 5.1-5.6, [http://en.wikipedia.org/wiki/Spanning_Tree_Protocol Spanning Tree Protocol], RFC 826 || ||
+
|style="background-color: SpringGreen;"| 11/02 || Closed Jackson networks & 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="background-color: SpringGreen;"| [https://drive.google.com/file/d/1bAWQ8ge6oFyXWyQmbdl9AkyQ297VLcIF/view?usp=sharingHWK HWK#4]
 
|-
 
|-
−
| 10/30 || Wireless & WiFi || || Sections 6.1-6.3 || ||  
+
| 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]] ||
 
|-
 
|-
−
| 11/4 || Cellular networks & mobility || || Sections 6.4-6.8 || ||
+
|style="background-color: SkyBlue;"| 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="background-color: SkyBlue;"| Quiz 3
 
|-
 
|-
−
| 11/6 || IPv6 || || Section 4.4.4, RFC 2460 || ||
+
| 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] <!-- <br/> and [[Media:Lecture21.pdf | Lecture 21 problems]] --> || [[Media:review21.pdf | Preview Problems 20]] ||  
 
|-
 
|-
−
| 11/11
+
|style="background-color: SpringGreen;"| 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="background-color: SpringGreen;"| [[Media:hwk5.pdf |HWK #5]]
 
|-
 
|-
−
| 11/13 || Security - A cryptography primer || || Sections 8.1-8.3 || ||
+
| 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]<br/> and [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis] || [[Media:review23.pdf | Preview Problems 22]] ||
 
|-
 
|-
−
| 11/18 || Security protocols || || Sections 8.4-8.8 || ||
+
| 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]] ||
 
|-
 
|-
−
| 11/20 || Attacks and defense systems || ||
+
|style="background-color: Red;"| 11/25 ||style="background-color: Red;"| '''NO CLASS - THANKSGIVING BREAK''' ||style="background-color: Red;"| ||style="background-color: Red;"| ||style="background-color: Red;"| ||style="background-color: Red;"|
−
* Section 8.9
 
−
* Overview: [http://pages.arbornetworks.com/rs/arbor/images/WISR2014.pdf Arbor Networks worldwide infrastructure security report (2014)]
 
−
* DoS & DDoS:
 
−
** Attacks: [http://cseweb.ucsd.edu/~savage/papers/Tocs06.pdf Inferring Internet Denial-of-Service Activity], RFC 4948, [http://staff.washington.edu/dittrich/misc/ddos/ Distributed Denial of Service (DDoS) Attacks/tools]]
 
−
** Defenses:  RFC 2827 (BCP 38), RFC 3704 (BCP 84), RFC 5635, [https://www.nanog.org/meetings/nanog28/presentations/sink.pdf Sink Holes (NANOG presentation)], [https://www.nanog.org/meetings/nanog30/presentations/morrow.pdf Customer-Triggered Real-Time Blackholes (NANOG presentation)]
 
−
* DNS (Attacks & Defenses): RFC 3833, RFC 4778
 
−
* Routing
 
−
** Attacks: [http://tools.ietf.org/html/draft-ietf-rpsec-bgpattack-00 An Attack Tree for the Border Gateway Protocol], RFC 4272, [http://www.renesys.com/wp-content/uploads/2013/05/blackhat-09.pdf Defending against BGP man-in-the-middle attacks]
 
−
** Defenses: RFC 5082, [http://www.renesys.com/wp-content/uploads/2013/05/blackhat-09.pdf Defending against BGP man-in-the-middle attacks], [https://datatracker.ietf.org/doc/draft-ietf-sidr-bgpsec-overview/ An overview of BGPSEC] || ||
 
 
|-
 
|-
−
| 11/25 || Attacks and defense systems (contd.) || || || ||
+
|style="background-color: SkyBlue;"| 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="background-color: SkyBlue;"| Quiz 4
 +
|}
 +
 
 +
==December==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 11/27 || '''NO CLASS - THANKSGIVING'''
+
|style="background-color: SpringGreen;"| 12/02 || Preemptive, non-size-based scheduling policies || Chapter 30 & Section 32.2 ||[https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19] || [[Media:review26.pdf | Preview 26 Problems]] ||style="background-color: SpringGreen;"| [[Media:hwk6.pdf |HWK #6]]
 
|-
 
|-
−
| 12/2 || Attacks and defense systems (contd.) || || || ||
+
| 12/08 || Preemptive size-based scheduling policies || Chapter 32 (Sections 32.3 and onward) & Chapter 33 || [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20]] || [[Media:review27.pdf | Preview 27 problems]] ||  
 
|-
 
|-
−
| 12/4 || Review session || || || ||
+
|style="background-color: yellow;"| 12/20 || style="background-color: yellow;"| '''EXAM 2''' ||style="background-color: yellow;"| '''(6:00-8:00pm in TBD)'''||style="background-color: yellow;"| ||style="background-color: yellow;"| ||style="background-color: yellow;"|
 
|}
 
|}

Latest revision as of 00:32, 16 June 2020

Syllabus & (tentative) Schedule

THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT SEMESTER. PLEASE CHECK IT REGULARLY

Schedule at-a-glance

Class times and location: Monday & Wednesday, 4:00pm-5:20pm in TBD.

Legend: date (quizzes & exams) and due date (homeworks)

Hmwk Quizz Exam No class




Mo. We. Mo. We. Mo. We. Mo. We. Mo. We.
August 24 26 31
September 2 7 9 14 16 21 23 28 30
October 5 7 12 14 19 21 26 28
November 2 4 9 11 16 18 23 25 30
December 2 11

EXAM 1: Monday October 19, 2020, in class
EXAM 2: Tuesday December 11, 2020, 6:00-7:20pm in TBD

Detailed Schedule & Syllabus

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.

August

Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
8/24 Course overview, logistics, (motivating) examples and terminology Chapters 1 & 2 Notes 0
Intro & Nomenclature		 Preview Problems 1
8/26 A brief review of probability topics, both basic and slightly more advanced, which are needed in the course Chapters 3 & 5 Probability Refresher and Practice Problems Preview Problems 2
8/31 An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions Chapters 6 & 7 Little & Operational Laws Preview Problems 3

September

Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
9/2 An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions Chapters 6 & 7 Little & Operational Laws
9/7 LABOR DAY NO CLASS
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) Discrete Time Markov Chains
and "Web caching as a DTMC"		 Preview Problems 5] Quiz 1
9/14 Infinite DTMCs and some simple applications Chapter 8 (Sections 8.8 to 8.10) Discrete Time Markov Chains Preview Problems 6 HWK #1
9/16 Ergodicity, balance equations, and time reversibility for DTMCs Chapter 9 Ergodicity and more Preview Problems 7
9/21 Review of z-transforms and applications to DTMCs Chapter 25 (the parts about z-transforms) & Chapter 10 (mostly Section 10.3, though the others are of independent interest) z-transforms
and DTMC Examples
and z-transform solution for Geom/Geom/1 queue		 Preview Problems 8
9/23 Exponential distribution & Poisson process Chapter 11 Exponential & Poisson Distributions (except the material on PASTA) [Preview Problems 9
9/28 Introduction to continuous time Markov chains (CTMC) Chapter 12 Continuous Time Markov Chains Preview Problems 10 HWK #2
9/30 M/M/1 queue & PASTA theorem Chapter 13 Continuous Time Markov Chains plus Exponential & Poisson Distributions (for PASTA), and and some related problems] Preview Problems 11

October

Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
10/5 M/M/k/k (Erlang-B formula) and M/M/k queueing systems Chapter 14 Slides 9 Preview Problems 12 Quiz 2
10/7 Applications to system provisioning Chapter 15 + Sections 8.11 & 8.12 of Zukerman's book (Hayward approximation and Equivalent Random Theory) Slides 10 Preview Problems 13
10/12 FALL BREAK NO CLASS
10/14 Review session Check the Exams & quizzes page for past exams It is your responsibility to come-up with questions to ask HWK #3
10/19 IN CLASS EXAM 1 Exam 1 covers everything from the first lecture up to this point
10/21 Revisiting time reversibility and applications to network of queues Chapter 16 Slides 11 Preview Problems 14
10/26 Jackson networks (of queues) and product form distribution Chapter 17 Slides 11
and Lecture 15 problem		 Preview problems 15
10/28 Classed Jackson networks Chapter 18 Slides 11
and Lecture 16 problem		 Preview Problems 16

November

Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
11/02 Closed Jackson networks & mean value analysis (MVA) Chapter 19 Slides 11 Preview Problems 17 HWK#4
11/04 A quick introduction to Matrix-Analytic techniques and phase-type distributions Chapter 21 Slides 12 Preview Problems 18
11/9 Processor sharing queues Chapter 22 Slides 13 Preview Problems 19 Quiz 3
11/11 The M/G/1 queue and Renewal-Reward theorem Chapter 23 Slides 14 Preview Problems 20
11/16 A brief foray into server assignment policies Chapter 24 Slides 15 Preview Problems 21 HWK #5
11/18 Transform analysis of M/G/1 queue (and review of transforms) Chapter 25 and Chapter 26 (Section 1) Slides 16
and Slides 16bis		 Preview Problems 22
11/23 M/G/1 queue and application to power optimization Chapter 26 (Section 2) and Chapter 27 Slides 17 Preview Problems 23
11/25 NO CLASS - THANKSGIVING BREAK
11/30 M/G/1 queue with non-preemptive scheduling priorities Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 Slides 18 Preview Problems 24 Quiz 4

December

Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
12/02 Preemptive, non-size-based scheduling policies Chapter 30 & Section 32.2 Slides 19 Preview 26 Problems HWK #6
12/08 Preemptive size-based scheduling policies Chapter 32 (Sections 32.3 and onward) & Chapter 33 Slides 20] Preview 27 problems
12/20 EXAM 2 (6:00-8:00pm in TBD)
Retrieved from "http://classes.engineering.wustl.edu/cse538/index.php?title=Syllabus&oldid=1766"