Difference between revisions of "Syllabus"

From CSE538 Online Wiki
Jump to navigation Jump to search
 
(788 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
==Syllabus & (tentative) Schedule==
+
=='''Syllabus & Schedule for CSE 5308 (Fall 2026)'''==
 +
 
 +
<span style="color: red; text-decoration:blink;">'''THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT THE SEMESTER. PLEASE CHECK IT REGULARLY'''</span>
  
 
===Schedule at-a-glance===
 
===Schedule at-a-glance===
  
−
'''Legend'''
+
'''Class times and location''': Monday & Wednesday, 4:00pm-5:20pm in McKelvey Hall 1020.
 +
 
 +
'''Legend: HOMEWORKS:  Due date (by start of class); QUIZZES: Date and class when they will be held <!--they become available (due date is 72 hours later)-->'''
 
{| class="wikitable" style="text-align: center; color: black; border-style: solid; border-width: 2px"
 
{| class="wikitable" style="text-align: center; color: black; border-style: solid; border-width: 2px"
−
! Lab
+
! Quiz
−
! Quizz
+
! Hmwk
 
! Exam
 
! Exam
 
! No class
 
! No class
Line 13: Line 17:
 
| style="background-color: SkyBlue;"|<br>  
 
| style="background-color: SkyBlue;"|<br>  
 
| style="background-color: yellow;"|<br>
 
| style="background-color: yellow;"|<br>
−
| style="background-color: red;"|<br>
+
| style="background-color: red;"|<br>  
 
|}
 
|}
 +
ear regression, design and analysis of experiments, estimation, hypothesis testing. Examples are ta
  
 
{| class="wikitable" style="text-align: center; color: black; border-style: solid; border-width: 2px"
 
{| class="wikitable" style="text-align: center; color: black; border-style: solid; border-width: 2px"
 
!
 
!
−
! Tu.
+
! Mo.
−
! Th.
+
! We.
−
! Tu.
+
! Mo.
−
! Th.
+
! We.
−
! Tu.
+
! Mo.
−
! Th.
+
! We.
−
! Tu.
+
! Mo.
−
! Th.
+
! We.
−
! Tu.
+
! Mo.
−
! Th.
+
! We.
 
|-
 
|-
 
! style="text-align:left;"| August
 
! style="text-align:left;"| August
−
| 26 || 28
+
| 24 || 26 || 31
 
|-
 
|-
 
! style="text-align:left;"| September
 
! style="text-align:left;"| September
−
| style="background-color: SkyBlue;"| 2 || 4
+
| ||style="background-color: SkyBlue;"| 2 (H1) ||style="background-color: red;"| 7 ||style="background-color: SpringGreen;"| 9 (Q1) || 14 || 16 ||style="background-color: SkyBlue;"| 21 (H2) ||style="background-color: SpringGreen;"| 23 (Q2) || 28 || 30
−
| style="background-color: SpringGreen;"|9 || 11 ||style="background-color: SkyBlue;"| 16 || 18 || 23 ||style="background-color: SpringGreen;"| 25 || 30
 
 
|-
 
|-
 
! style="text-align:left;"| October
 
! style="text-align:left;"| October
−
|   ||style="background-color: SkyBlue;"| 2 || 7 || 9 ||style="background-color: yellow;"| 14 || 16 ||style="background-color: SpringGreen;"| 21 || 23 ||style="background-color: SkyBlue;"| 28 || 30
+
|style="background-color: red;"| 5 ||style="background-color: SkyBlue;"| 7 (H3) ||style="background-color: SpringGreen;"| 12 (Q3)  || 14 || 19 || 21 ||style="background-color: SkyBlue;"| 26 (H4) ||style="background-color: SpringGreen;"| 28 (Q4)
 
|-
 
|-
 
! style="text-align:left;"| November
 
! style="text-align:left;"| November
−
|style="background-color: SpringGreen;"| 4 || 6 || 11||style="background-color: SkyBlue;"| 13 || 18 || 20 ||style="background-color: SpringGreen;"| 25 ||style="background-color: Red;"| 27
+
| 2 || 4 || 9 ||style="background-color: SkyBlue;"| 11 (H5) ||style="background-color: SpringGreen;"| 16 (Q5) || 18 || 23 ||style="background-color: Red;"| 25 || 30
 
|-
 
|-
 
! style="text-align:left;"| December
 
! style="text-align:left;"| December
−
|style="background-color: SkyBlue;"| 2 || 4
+
| ||style="background-color: SkyBlue;"| 2 (H6) || 7 ||  ||colspan="3"" style="background-color: yellow; text-align:center;"| '''Friday 11'''
−
|}
+
|-
 +
| || ||style="background-color: SpringGreen;"| 2 (Q6)
 +
|}  
 +
 
 +
<!--'''&dagger;''' Common due date for homework (at the beginning of class) and quiz (during the last 30mins of class)-->
 +
 
 +
<!--<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> -->
  
−
'''FINAL EXAM: Wednesday December 17, 2014, 3:30-5:30pm in TBA.'''
+
===<!--<span style="color: red">-->Zoom access of live lectures WHEN OFFERED (see [[Main Page#zoom|Zoom & Video Access]]) will be through [https://wustl.instructure.com/courses/180915/external_tools/1199 Canvas]<!--</span>-->===
  
 
===Detailed Schedule & Syllabus===
 
===Detailed Schedule & Syllabus===
 +
 +
'''NOTE''':  This schedule in '''TENTATIVE''', and may change depending on the speed at which we cover different topics. Changes to the schedule will be reflected as quickly as possible on this page.
 +
 +
=='''August'''==
 
{|class="wikitable"
 
{|class="wikitable"
−
! style="text-align:left;"| Date
+
! style="text-align:left;"| Unit
 +
! Date
 
! Scope  
 
! Scope  
−
! Reading Assignments
+
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 
! Notes & slides
 
! Notes & slides
−
! Review Questions
+
(If any)
−
! Labs/Quizzes
+
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 8/26 || A brief overview of the Internet, its components, and performance aspects || Chapter 1, RFC 1958<br/> FYI: RFC 3439 (especially Section 5)||[[Media:lec1.pdf | Lecture 1]] || NA || NA
+
| U0 || 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/28 || Network applications & the web || Chapter 1, Sections 2.1, 2.2<br/> FYI: RFC 2616 ||[[Media:lec2.pdf | Lecture 2]] || Review Questions for lecture 2 ([[Media:rq2.pdf | pdf]], [[Media:rq2.docx | docx]])||
+
| U1 || 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://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit Practice Problems for U1] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] ||
 
|-
 
|-
−
|style="background-color: SkyBlue;"| 9/2 || The Domain Name System (DNS) || Section 2.5<br/> FYI: RFC 1034, RFC 1035, [http://www.experts-exchange.com/Networking/Protocols/DNS/A_10297-DNS-Glue-WHAT-and-WHY.html A useful discussion of the need for and use of GLUE records] ||[[Media:lec3.pdf | Lecture 3]]  || Review Questions for lecture 3 ([[Media:rq3.pdf | pdf]], [[Media:rq3.docx | docx]])||style="background-color: SkyBlue;"|[[Media:q1.pdf| Quizz 1]] and [[Media:q1sol.pdf | solution]]
+
| U1 || 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 & 4] ||
 +
|}
 +
 
 +
=='''September'''==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Unit
 +
! Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 9/4 || Transport layer overview and socket programming (mostly UDP, but we'll quickly cover TCP as well) || Sections 2.7.1, 3.1-3.3<br/> FYI: [http://docs.oracle.com/javase/tutorial/networking/sockets/index.html Java sockets tutorial], [http://ftp.itb.ac.id/pub/ISO-IMAGES/linux/filenya-putu-shinoda/bukulinux/TCPIPSocketInJava.pdf TCP/IP Socket in Java (book)] || [[Media:lec4.pdf | Lecture 4]] || Review Questions for lecture 4 ([[Media:rq4.pdf | pdf]], [[Media:rq4.docx | docx]]) ||
+
| U2 || 9/2 || 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://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit Web caching as a DTMC in U2 Practice Problems] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style="background-color: SkyBlue;"|[https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1]
 
|-
 
|-
−
|style="background-color: SpringGreen;"| 9/9 || File transfer application (FTP) and email application (SMTP) || Sections 2.3 & 2.4<br/> FYI: RFC 959, RFC 2821, [http://slacksite.com/other/ftp.html A discussion of the difference between active and passive FTP] || [[Media:lec5.pdf | Lecture 5]] || Review Questions for lecture 5 ([[Media:rq5.pdf | pdf]], [[Media:rq5.docx | docx]]) ||style="background-color: SpringGreen;"| [[Media:Lab1.pdf | Lab 1]] and [[Media:lab1sol.pdf | solution]]
+
|style="background-color: Red;"| ||style="background-color: Red;"| 9/7 ||colspan="5" style="background-color: Red; text-align:center;"| NO CLASS - LABOR DAY
 
|-
 
|-
−
| 9/11 || Other useful Internet protocols & mechanisms:  ICMP, DHCP, NATs || Section 4.4 (pp. 345-355)<br/> FYI: RFC 792, RFC 2131, RFC 2131, RFC 2663 || Lecture 6 [[Media:lec6_portrait.pdf | (portrait)]], [[Media:lec6_landscape.pdf | (landscape)]] || Review Questions for lecture 6 ([[Media:rq6.pdf | pdf]], [[Media:rq6.docx | docx]]) ||
+
| U2 || 9/9 || 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]<br/> and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples] <br/> <span style="color:#FF0000">'''Quiz 1 during last 30mins of the lecture'''</span>|| [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style="background-color: SpringGreen;"| '''Quiz 1 during last 30mins of the lecture'''
 
|-
 
|-
−
|style="background-color: SkyBlue;"| 9/16 || P2P applications || Section 2.6 || Lecture 7 [[Media:lec7_portrait.pdf | (portrait)]], [[Media:lec7_landscape.pdf | (landscape)]] || Review Questions for lecture 7 ([[Media:rq7.pdf | pdf]], [[Media:rq7.docx | docx]]) ||style="background-color: SkyBlue;"|Quizz 2 and [[Media:q2sol.pdf | solution]]
+
| U2 || 9/14 || 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/18 || DHTs || Section 2.6 || Lecture 7 [[Media:lec7_portrait.pdf | (portrait)]], [[Media:lec7_landscape.pdf | (landscape)]] || Review Questions for lecture 7 ([[Media:rq7.pdf | pdf]], [[Media:rq7.docx | docx]]) ||
+
| U2 || 9/16 || 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://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit ''z''-transform solution for Geom/Geom/1 queue (last problem of U2 on Canvas)] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] ||
 
|-
 
|-
−
| 9/23 || Principles of reliable data transport || Section 3.4 || Lecture 8 [[Media:lec8_portrait.pdf | (portrait)]], [[Media:lec8_landscape.pdf | (landscape)]] || Review Questions for lecture 8 ([[Media:rq8.pdf | pdf]], [[Media:rq8.docx | docx]]) ||
+
| Open/U3 || 9/21 || '''U2 Recap''' session ('''~45mins''') <br/><br/> Start on Exponential distribution & Poisson process ('''~35mins''') || U2 material <br/><br/> Chapter 11 || [https://drive.google.com/file/d/1-sXzwvrUJvF6KQ9JgOUkpxjg-vaUdXNV/view?usp=sharing Review U2] <br/><br/> [https://drive.google.com/file/d/1N_FjkEftjkBNqMCpMKAJ-VgpU1awAjNH/edit?usp=sharing Start on Exponential & Poisson Distributions] || [https://drive.google.com/file/d/1FJATtG_Y4VWPi39Htad0m19mcFUylU1W/view?usp=sharing Preview Problems 9] ||style="background-color: SkyBlue;"|[https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2]
 
|-
 
|-
−
|style="background-color: SpringGreen;"| 9/25 || A closer look at TCP || Sections 3.5, 2.7.2 || Lecture 9 [[Media:lec9_portrait.pdf | (portrait)]], [[Media:lec9_landscape.pdf | (landscape)]] || Review Questions for lecture 9 ([[Media:rq9.pdf | pdf]], [[Media:rq9.docx | docx]]) ||style="background-color: SpringGreen;"| [[Media:Lab2.pdf | Lab 2]]
+
| U3|| 9/23 || Finish exponential distribution & Poisson process|| Chapter 11 || [https://drive.google.com/file/d/1N_FjkEftjkBNqMCpMKAJ-VgpU1awAjNH/edit?usp=sharing Finish Exponential & Poisson Distributions] (including material on PASTA) <br/> <span style="color:#FF0000">'''Quiz 2 during last 30mins of the lecture'''</span>|| ||style="background-color: SpringGreen;"| '''Quiz 2 during last 30mins of the lecture'''
 
|-
 
|-
−
| 9/30 || TCP flow and congestion control || Sections 3.6, 3.7<br/> FYI: RFC 5681, RFC 6582 || Lecture 10 [[Media:lec10_portrait.pdf | (portrait)]], [[Media:lec10_landscape.pdf | (landscape)]] || Review Questions for lecture 10 ([[Media:rq10.pdf | pdf]], [[Media:rq10.docx | docx]]) ||
+
| U3 || 9/28 ||Introduction to continuous time Markov chains (CTMC),  M/M/1 queue (review of PASTA theorem) || Chapters 12 & 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] and [https://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit some related problems (Chapter 13 problems in U3)]] || [https://drive.google.com/file/d/1temAdHNjumrKtWOhsyhaOZWO5P1KMgRv/view?usp=sharing Preview Problems 10] ||
 
|-
 
|-
−
|style="background-color: SkyBlue;"| 10/2 || IPv4 protocol and Internet routers (IP addresses & subnets, router architecture) || Sections 4.1-4.3, 4.4 (up to p. 345)<br/> FYI: RFC 1812 || || ||style="background-color: SkyBlue;"| Quizz 3
+
| U3 || 9/30 || 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 Continuous Time Markov Chains] || [https://drive.google.com/file/d/1V2DdMTX-VmHPxh6-OeSO5d-MSa2xOXPS/view?usp=sharing/view?usp=sharing Preview Problems 11] ||
 +
|}
 +
 
 +
=='''October'''==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Unit
 +
! Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 +
|-
 +
|style="background-color: Red;"|  ||style="background-color: Red;"| 10/5 ||colspan="5" style="background-color: Red; text-align:center;"| NO CLASS - FALL BREAK <!-- '''U3 Recap''' to be held during regular class time <br> See [https://drive.google.com/file/d/1r_5mffYrRuS5N9CoLuvMiP1m1Eqz7hY6/view?usp=sharing Review Material] and [https://docs.google.com/presentation/d/10rEQfc1KTVkH8tsq2HWAt4KmVNy_eCW5/edit?usp=sharing&ouid=112223552596975457559&rtpof=true&sd=true Review Slides]-->
 +
|-
 +
| U3 / Review|| 10/7 || Applications to system provisioning <br/><br/> '''U3 Recap''' session ('''~45mins''') || 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)<br/><br/> U3 material|| [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing System Provisioning] <br/><br/> [https://drive.google.com/file/d/1r_5mffYrRuS5N9CoLuvMiP1m1Eqz7hY6/view?usp=sharing U3 Review]|| [https://drive.google.com/file/d/1jQt6-jZc0svZO9novgNrq4rK6-069Rel/view?usp=sharing Preview Problems 12] ||style="background-color: SkyBlue;"|[https://drive.google.com/file/d/10i5NK79xaba7xrR1kl2GlOfw1Gj8j2o_/view?usp=sharing HWK #3]
 +
<!--|-
 +
| colspan="6" | ||style="background-color: yellow;"| '''Quiz 3 during last 30mins of lecture'''-->
 +
|-
 +
| U4 || 10/12 ||Revisiting time reversibility and applications to network of queues  || Chapter 16 || [https://docs.google.com/presentation/d/1DXLlnpSgZCy57VoLDsV7krLpj_ev6Dfu/view?usp=sharing Burke Theorem, Reversibility, and Basic Networks of Queues] <br> <span style="color:#FF0000">'''Quiz 3 during last 30mins of the lecture'''</span>  || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13] ||style="background-color: SpringGreen;"| '''Quiz 3 during last 30mins of the lecture'''
 +
|-
 +
| U4 || 10/14 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://docs.google.com/presentation/d/1DXLlnpSgZCy57VoLDsV7krLpj_ev6Dfu/view?usp=sharing Jackson Networks of Queues] <br/> and [https://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit Chapter 17 problem (1st problem in U4)] || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview problems 14]  ||
 +
|-
 +
| U4 || 10/19 || Classed Jackson networks + Mean Value Analysis || Chapters 18 & 19 || [https://docs.google.com/presentation/d/1DXLlnpSgZCy57VoLDsV7krLpj_ev6Dfu/view?usp=sharing Classed Networks of Queues & Mean Value Analysis] <br/> and [https://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit Chapter 18 problem (2nd problem in U4)] || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview Problems 15] ||
 
|-
 
|-
−
| 10/7 || Routing (shortest path) algorithms || Section 4.5 || || ||
+
| Open || 10/21 || '''U4 Recap''' session ('''45 mins''')<br/><br/> Start on introduction to Matrix-Analytic techniques and phase-type distributions ('''35mins''')||U4 material <br/><br/><br/> Chapter 21 || [https://drive.google.com/file/d/1Nh7sTlNtEV5fHZnQYYJOHT7nWarSZfJd/view?usp=sharing U4 Review] <br/><br/> [https://docs.google.com/presentation/d/1vhr49YMs0f6VKwbxcPpPktiFoadph-Ia/view?usp=sharing Matrix Analytic Techniques]<br/> See [https://drive.google.com/file/d/1V9MbkCkJrzcdvoWZb83t70k7ya2i8l4k/view?usp=sharing Notes on analysis of M/E2/1 queue]|| [https://drive.google.com/file/d/19SH01rOjvV1izpVkaG-xD0jWot6NInCU/view?usp=sharing Preview Problems 16]  ||  
 
|-
 
|-
−
| 10/9 || Review session || - || - || - || -
+
| U5 || 10/26 || Finish introduction to Matrix-Analytic techniques and phase-type distributions || Chapter 21 || [https://docs.google.com/presentation/d/1vhr49YMs0f6VKwbxcPpPktiFoadph-Ia/view?usp=sharing Matrix Analytic Techniques]<br/> See [https://drive.google.com/file/d/1V9MbkCkJrzcdvoWZb83t70k7ya2i8l4k/view?usp=sharing Notes on analysis of M/E2/1 queue] || ||style="background-color: SkyBlue;"| [https://drive.google.com/file/d/1bAWQ8ge6oFyXWyQmbdl9AkyQ297VLcIF/view?usp=sharing HWK #4]
 
|-
 
|-
−
|style="background-color: yellow;"| 10/14 ||style="background-color: yellow;"| '''IN CLASS MIDTERM''' ||style="background-color: yellow;"| ||style="background-color: yellow;"| ||style="background-color: yellow;"| ||style="background-color: yellow;"|
+
| U5 || 10/28 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Processor Sharing Queues] || [https://drive.google.com/file/d/1xk1aBP_OvY7-PPkWCzz8CiUs0OK-7mQG/view?usp=sharing Preview Problems 17]  <br/> <span style="color:#FF0000">'''Quiz 4 during last 30mins of the lecture'''</span> ||style="background-color: SpringGreen;"| '''Quiz 4 during last 30mins of the lecture'''
 +
|}
 +
 
 +
=='''November'''==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Unit
 +
! Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 10/16 || Intra-domain rouging protocols, i.e., OSPF, IS-IS, EIGRP || Sections 4.6.1-2, [http://ccrg.soe.ucsc.edu/publications/interop94.pdf EIGRP paper]<br/> FYI: RFC 2328, RFC 1195 || || ||
+
| U5 || 11/2 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing M/G/1 Queue & Renewal Reward Theory] <br/> and [https://wustl.instructure.com/courses/155101/pages/practice-problems-by-unit Chapter 23 problems (1st problems in U5a)] || [https://drive.google.com/file/d/1t0xEehTn1H0vcJ-4aTderT8ScBSFyWyv/view?usp=sharing Preview Problems 18] ||  
 
|-
 
|-
−
|style="background-color: SpringGreen;"| 10/21 || Intra-domain rouging protocols, i.e., OSPF, IS-IS, EIGRP (contd.) || Sections 4.6.1-2, [http://ccrg.soe.ucsc.edu/publications/interop94.pdf EIGRP paper]<br/> FYI: RFC 2328, RFC 1195 || || ||style="background-color: SpringGreen;"| Lab 3
+
| U5 || 11/4 || A brief foray into task/server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Task/Server Assignment Policies] || [https://drive.google.com/file/d/14WecX4jpQg1-m2r7s0VOlvskzDJAsmwc/view?usp=sharing Preview Problems 19] ||  
 
|-
 
|-
−
| 10/23 || Inter-domain routing (BGP) || Section 4.6.3<br/> FYI: RFC 4271, Avi Freedman BGP tutorials ([http://freedman.net/bgbgp.ppt BGP1] and [http://freedman.net/bgp102.ppt BGP2]) || || ||
+
| Open/U5 || 11/9 || '''U5 Recap 1''' session  ('''45mins''')<br/><br/> Start on review of transforms and M/G/1 transform analysis ('''35mins''') || U5 material covered so far <br/><br/>  Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/1G94azwDoxEAIyZhUEuf4RIGGhvDfaxz-/view?usp=sharing U5a Review] <br/><br/>[https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Transform Analysis]<br/> - [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Useful Transform Relationships & Key Results] <br/> - [https://drive.google.com/file/d/1m93Jf9U95wCzMPpPl6N2WC2pHnB1-1QI/view?usp=sharing Finite M/G/1 Queue] || ||
 
|-
 
|-
−
|style="background-color: SkyBlue;"| 10/28 || Multicast routing || Section 4.7<br/> FYI: RFC 2236 (Sections 1-3), RFC 3376 (Sections 1-6), RFC 4601 (Sections 1-3), RFC 4607 (Sections 1-6) || || ||style="background-color: SkyBlue;"| Quizz 4
+
| U5 || 11/11 || Finish review of transforms and M/G/1 transform analysis || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Transform Analysis]<br/> - [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Useful Transform Relationships & Key Results] <br/> - [https://drive.google.com/file/d/1m93Jf9U95wCzMPpPl6N2WC2pHnB1-1QI/view?usp=sharing Finite M/G/1 Queue]  || [https://drive.google.com/file/d/1S1fZ7bzl-o78DQkdX0tMxkVUi-Y-JXOi/view?usp=sharing Preview Problems 20] ||style="background-color: SkyBlue;"| [https://drive.google.com/file/d/1hEBI-XPovZLOIWTuqaJNn2rVwSSaepjV/view?usp=sharing HWK #5]
 
|-
 
|-
−
| 10/30 || Link layer & Ethernet || Section 5.1-5.6, [http://en.wikipedia.org/wiki/Spanning_Tree_Protocol Spanning Tree Protocol]<br/> FYI: RFC 826 || || ||
+
| U5 || 11/16 || 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 M/G/1 Busy Period & Power Optimization] <br/> and [https://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit Chapter 27 problems (2nd bullet problems in U5a)] <br/> <span style="color:#FF0000">'''Quiz 5 during last 30mins of the lecture'''</span> || [https://drive.google.com/file/d/1GFA5hAAEp5jB1u-QVRIIxOP0WEfRDENr/view?usp=sharing Preview Problems 21] ||style="background-color: SpringGreen;"| '''Quiz 5 during last 30mins of the lecture'''
 
|-
 
|-
−
|style="background-color: SpringGreen;"| 11/4 || Link layer & Ethernet (contd.) || Section 5.1-5.6, [http://en.wikipedia.org/wiki/Spanning_Tree_Protocol Spanning Tree Protocol]<br/> FYI: RFC 826 || || ||style="background-color: SpringGreen;"| Lab 4
+
| U5 || 11/18 || Non-preemptive scheduling policies for M/G/1/ queue || Read Chapter 28 reviewing key metrics, Chapter 29 and Chapter 31 (they are small chapters) ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Scheduling Non-Preemptive Policies] <!-- <br/> and [https://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit LCFS problem] -->  || [https://drive.google.com/file/d/1UeWHltFZQnZbLNQskeBHAOUq7Cl-SiI-/view?usp=sharing Preview Problems 22]||
 
|-
 
|-
−
| 11/6 || Wireless & WiFi || Sections 6.1-6.3 || || ||
+
| U5 || 11/23 || Non-Size-Based Preemptive scheduling policies for M/G/1 queue || Chapter 30 ||[https://drive.google.com/file/d/1Af2GKXJB83TV_DduVbjk_PXajM8pQPns/edit?usp=share_link&ouid=112223552596975457559&rtpof=true&sd=true Non-Size-Based Preemptive Scheduling Policies] <br/> and [https://wustl.instructure.com/courses/180915/pages/practice-problems-by-unit Problem 30.5 (3rd problem in U5b)] || [https://drive.google.com/file/d/15U9XpFDi7HiAqiMqt_9yR4d_eS1IRh8V/view?usp=sharing Preview Problems 23] ||
 
|-
 
|-
−
| 11/11 || Cellular networks & mobility || Sections 6.4-6.8 || || ||
+
|style="background-color: Red;"| ||style="background-color: Red;"| 11/25 ||colspan="5" style="background-color: Red; text-align:center;"| NO CLASS - THANKSGIVING BREAK
 
|-
 
|-
−
|style="background-color: SkyBlue;"| 11/13 || IPv6 || Section 4.4.4<br/> FYI: RFC 2460 || || ||style="background-color: SkyBlue;"| Quizz 5
+
| U5 || 11/30 || Size-Based Preemptive scheduling policies for M/G/1 queue || Chapters 32 & 33 || [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Size-Based Preemptive Policies] || [https://drive.google.com/file/d/1F5vGHtWsgLSL-a13EylJYfHN2ZCVCCk8/view?usp=sharing Preview Problems 24] ||
 +
|}
 +
 
 +
=='''December'''==
 +
{|class="wikitable"
 +
! style="text-align:left;"| Unit
 +
! Date
 +
! Scope
 +
! Material & Reading Assignments
 +
(To Be Read Ahead of Class)
 +
! Notes & slides
 +
(If any)
 +
! Preview Problems
 +
! Quizzes & Homeworks
 
|-
 
|-
−
| 11/18 || Security - A cryptography primer || Sections 8.1-8.3 || || ||
+
|Open || 12/2 ||  '''U5 Recap 2''' session || U5 material covered from Quiz 5 onward ||[https://drive.google.com/file/d/1JCAe1HkLJnPe5DrNQgETVOph6YbLr8GU/view?usp=sharing U5b Review] || ||style="background-color: SkyBlue;"| [https://drive.google.com/file/d/16dGgSm9I1iYLSSdzB1RYMsNW_pXg2xyB/view?usp=sharing HWK #6]
 
|-
 
|-
−
| 11/20 || Security protocols || Sections 8.4-8.8 || || ||
+
|colspan="4" | ||<span style="color:#FF0000">'''Quiz 6 during last 30mins of the lecture'''</span> || ||style="background-color: SpringGreen;"| '''Quiz 6 during last 30mins of lecture'''
 
|-
 
|-
−
|style="background-color: SpringGreen;"| 11/25 || Attacks and defense systems ||
+
| Open || 12/7 || '''Overall Recap''' session || All course material || || ||
−
* 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]
 
−
|| || ||style="background-color: SpringGreen;"| Lab 5
 
 
|-
 
|-
−
|style="background-color: Red;"| 11/27 ||style="background-color: Red;"| '''NO CLASS - THANKSGIVING''' ||style="background-color: Red;"| ||style="background-color: Red;"| ||style="background-color: Red;"| ||style="background-color: Red;"|
+
|style="background-color: yellow;"| '''EXAM''' ||style="background-color: yellow;"| 12/11 ||colspan="5" style="background-color: yellow; text-align:center"| '''Exam at TBD time'''
 +
<!--|-
 +
| || 12/4 || '''Last Quiz''' || colspan="3" | Available on Thursday 12/4 at 5:30pm, due three days later  ||style="background-color: yellow;"| Quiz 6 
 
|-
 
|-
−
|style="background-color: SkyBlue;"| 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]] ||  
−
* 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]  
 
−
|| || ||style="background-color: SkyBlue;"| Quizz 6
 
 
|-
 
|-
−
| 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 22:29, 20 October 2026

Syllabus & Schedule for CSE 5308 (Fall 2026)

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

Schedule at-a-glance

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

Legend: HOMEWORKS: Due date (by start of class); QUIZZES: Date and class when they will be held

Quiz Hmwk Exam No class




ear regression, design and analysis of experiments, estimation, hypothesis testing. Examples are ta

Mo. We. Mo. We. Mo. We. Mo. We. Mo. We.
August 24 26 31
September 2 (H1) 7 9 (Q1) 14 16 21 (H2) 23 (Q2) 28 30
October 5 7 (H3) 12 (Q3) 14 19 21 26 (H4) 28 (Q4)
November 2 4 9 11 (H5) 16 (Q5) 18 23 25 30
December 2 (H6) 7 Friday 11
2 (Q6)


Zoom access of live lectures WHEN OFFERED (see Zoom & Video Access) will be through Canvas

Detailed Schedule & Syllabus

NOTE: This schedule in TENTATIVE, and may change depending on the speed at which we cover different topics. Changes to the schedule will be reflected as quickly as possible on this page.

August

Unit Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
U0 8/24 Course overview, logistics, (motivating) examples and terminology Chapters 1 & 2 Notes 0
Intro & Nomenclature
Preview Problems 1
U1 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 for U1 Preview Problems 2
U1 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 & 4

September

Unit Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
U2 9/2 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 in U2 Practice Problems
Preview Problems 5] HWK #1
9/7 NO CLASS - LABOR DAY
U2 9/9 Infinite DTMCs and some simple applications Chapter 8 (Sections 8.8 to 8.10) Discrete Time Markov Chains
and DTMC Examples
Quiz 1 during last 30mins of the lecture
Preview Problems 6 Quiz 1 during last 30mins of the lecture
U2 9/14 Ergodicity, balance equations, and time reversibility for DTMCs Chapter 9 Ergodicity and more Preview Problems 7
U2 9/16 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 z-transform solution for Geom/Geom/1 queue (last problem of U2 on Canvas)
Preview Problems 8
Open/U3 9/21 U2 Recap session (~45mins)

Start on Exponential distribution & Poisson process (~35mins)
U2 material

Chapter 11
Review U2

Start on Exponential & Poisson Distributions
Preview Problems 9 HWK #2
U3 9/23 Finish exponential distribution & Poisson process Chapter 11 Finish Exponential & Poisson Distributions (including material on PASTA)
Quiz 2 during last 30mins of the lecture
Quiz 2 during last 30mins of the lecture
U3 9/28 Introduction to continuous time Markov chains (CTMC), M/M/1 queue (review of PASTA theorem) Chapters 12 & 13 Continuous Time Markov Chains and some related problems (Chapter 13 problems in U3)] Preview Problems 10
U3 9/30 M/M/k/k (Erlang-B formula) and M/M/k queueing systems Chapter 14 Continuous Time Markov Chains Preview Problems 11

October

Unit Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
10/5 NO CLASS - FALL BREAK
U3 / Review 10/7 Applications to system provisioning

U3 Recap session (~45mins)
Chapter 15 + Sections 8.11 & 8.12 of Zukerman's book (Hayward approximation and Equivalent Random Theory)

U3 material
System Provisioning

U3 Review
Preview Problems 12 HWK #3
U4 10/12 Revisiting time reversibility and applications to network of queues Chapter 16 Burke Theorem, Reversibility, and Basic Networks of Queues
Quiz 3 during last 30mins of the lecture
Preview Problems 13 Quiz 3 during last 30mins of the lecture
U4 10/14 Jackson networks (of queues) and product form distribution Chapter 17 Jackson Networks of Queues
and Chapter 17 problem (1st problem in U4)
Preview problems 14
U4 10/19 Classed Jackson networks + Mean Value Analysis Chapters 18 & 19 Classed Networks of Queues & Mean Value Analysis
and Chapter 18 problem (2nd problem in U4)
Preview Problems 15
Open 10/21 U4 Recap session (45 mins)

Start on introduction to Matrix-Analytic techniques and phase-type distributions (35mins)
U4 material


Chapter 21
U4 Review

Matrix Analytic Techniques
See Notes on analysis of M/E2/1 queue
Preview Problems 16
U5 10/26 Finish introduction to Matrix-Analytic techniques and phase-type distributions Chapter 21 Matrix Analytic Techniques
See Notes on analysis of M/E2/1 queue
HWK #4
U5 10/28 Processor sharing queues Chapter 22 Processor Sharing Queues Preview Problems 17
Quiz 4 during last 30mins of the lecture
Quiz 4 during last 30mins of the lecture

November

Unit Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
U5 11/2 The M/G/1 queue and Renewal-Reward theorem Chapter 23 M/G/1 Queue & Renewal Reward Theory
and Chapter 23 problems (1st problems in U5a)
Preview Problems 18
U5 11/4 A brief foray into task/server assignment policies Chapter 24 Task/Server Assignment Policies Preview Problems 19
Open/U5 11/9 U5 Recap 1 session (45mins)

Start on review of transforms and M/G/1 transform analysis (35mins)
U5 material covered so far

Chapter 25 and Chapter 26 (Section 1)
U5a Review

Transform Analysis
- Useful Transform Relationships & Key Results
- Finite M/G/1 Queue
U5 11/11 Finish review of transforms and M/G/1 transform analysis Chapter 25 and Chapter 26 (Section 1) Transform Analysis
- Useful Transform Relationships & Key Results
- Finite M/G/1 Queue
Preview Problems 20 HWK #5
U5 11/16 M/G/1 queue and application to power optimization Chapter 26 (Section 2) and Chapter 27 M/G/1 Busy Period & Power Optimization
and Chapter 27 problems (2nd bullet problems in U5a)
Quiz 5 during last 30mins of the lecture
Preview Problems 21 Quiz 5 during last 30mins of the lecture
U5 11/18 Non-preemptive scheduling policies for M/G/1/ queue Read Chapter 28 reviewing key metrics, Chapter 29 and Chapter 31 (they are small chapters) Scheduling Non-Preemptive Policies Preview Problems 22
U5 11/23 Non-Size-Based Preemptive scheduling policies for M/G/1 queue Chapter 30 Non-Size-Based Preemptive Scheduling Policies
and Problem 30.5 (3rd problem in U5b)
Preview Problems 23
11/25 NO CLASS - THANKSGIVING BREAK
U5 11/30 Size-Based Preemptive scheduling policies for M/G/1 queue Chapters 32 & 33 Size-Based Preemptive Policies Preview Problems 24

December

Unit Date Scope Material & Reading Assignments

(To Be Read Ahead of Class)

Notes & slides

(If any)

Preview Problems Quizzes & Homeworks
Open 12/2 U5 Recap 2 session U5 material covered from Quiz 5 onward U5b Review HWK #6
Quiz 6 during last 30mins of the lecture Quiz 6 during last 30mins of lecture
Open 12/7 Overall Recap session All course material
EXAM 12/11 Exam at TBD time