📄 syllabus.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0050)http://www.stanford.edu/class/ee384x/syllabus.html -->
<HTML><HEAD><TITLE>EE384X - Winter 2004 - Syllabus</TITLE><!-- saved from url=(0037)http://www/class/ee384x/syllabus.html --><!-- saved from url=(0050)http://www.stanford.edu/class/ee384x/syllabus.html -->
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="MSHTML 6.00.2600.0" name=GENERATOR></HEAD>
<BODY style="COLOR: rgb(0,0,0); BACKGROUND-COLOR: rgb(255,255,255)">
<CENTER>
<H1>EE384X - Winter 2004 - Timetable and Handouts<BR></H1></CENTER>
<CENTER>
<TABLE style="WIDTH: 100%" cellSpacing=0 cols=10 cellPadding=5 border=1>
<TBODY>
<TR align=middle bgColor=#cccccc>
<TH style="VERTICAL-ALIGN: middle; TEXT-ALIGN: center">
<CENTER><B><FONT size=+1>Lec. #</FONT></B></CENTER></TH>
<TH vAlign=center align=left>
<CENTER><B><FONT size=+1>Lecture<BR>Date</FONT></B></CENTER></TH>
<TH colSpan=2><FONT size=+1>Lecture Topic</FONT></TH>
<TH>
<CENTER><B><FONT size=+1>Teacher</FONT></B></CENTER></TH>
<TH>
<CENTER><B><FONT size=+1>Handouts</FONT></B></CENTER></TH>
<TH>
<CENTER><B><FONT size=+1>Reading <SPAN style="COLOR: rgb(204,0,0)">Before
</SPAN>Class</FONT></B></CENTER></TH>
<TH>
<CENTER><B><FONT size=+1>Problem Set</FONT></B></CENTER></TH>
<TH align=middle>Discussion Section</TH></TR>
<TR>
<TD>1 </TD>
<TD>Jan. 6<BR></TD>
<TD rowSpan=2>
<CENTER><B>Introduction</B></CENTER></TD>
<TD vAlign=top>Introduction to class and logistics.</TD>
<TD>McKeown</TD>
<TD>#1 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H01_EE384x.ppt">ppt</A>
<A
href="http://www.stanford.edu/class/ee384x/Handouts/H01_EE384x.pdf">pdf</A><BR></TD>
<TD><BR></TD>
<TD rowSpan=4><BR>Homework 1<BR><BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw1.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw1.ps">ps</A><BR><BR><SPAN
style="COLOR: rgb(255,0,0)">Due 4pm Tuesday Jan 20<SPAN
style="COLOR: rgb(0,0,0)"><BR><BR><A
href="http://www.stanford.edu/class/ee384x/Homework1/">Help on
SIM</A><BR></SPAN></SPAN></TD>
<TD rowSpan=2>Basic Probability Theory (Abtin)<BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/lec1_final.ppt">ppt</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/lec1_final.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/lec1_final6.pdf">pdf6</A><BR></TD></TR>
<TR>
<TD>2</TD>
<TD>Jan 8<BR></TD>
<TD vAlign=top>Overview of Packet Switches and their evolution</TD>
<TD>McKeown</TD>
<TD><BR></TD>
<TD><BR></TD></TR>
<TR>
<TD>3</TD>
<TD>Jan. 13</TD>
<TD rowSpan=10>
<CENTER><B>PART-I: Output- Queued Switches </B></CENTER></TD>
<TD vAlign=top>What is output queueing? M/D/1 model, Good properties:
minimize expected delay, work-conservation, ability to control bw and
delay.</TD>
<TD>McKeown </TD>
<TD>#2 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H02_EE384x.ppt">ppt</A>
<A
href="http://www.stanford.edu/class/ee384x/Handouts/H02_EE384x.pdf">pdf</A>
<BR></TD>
<TD><BR></TD>
<TD style="VERTICAL-ALIGN: middle" rowSpan=2>Discrete Time Markov Chains
(Rui)<BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/rev3_v4.ppt">ppt</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/rev3_v4.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/rev3_v4_6.pdf">pdf6</A></TD></TR>
<TR>
<TD>4<BR></TD>
<TD>Jan. 15<BR></TD>
<TD style="VERTICAL-ALIGN: top" rowSpan=2>Output link scheduling:
fairness, weighted fairness, FQ and WFQ, providing delay guarantees,
leaky-bucket constraints, Parekh/Gallager results, GPS, DRR
approximation.</TD>
<TD>McKeown </TD>
<TD><BR></TD>
<TD><BR></TD></TR>
<TR>
<TD>5<BR></TD>
<TD>Jan. 20</TD>
<TD>McKeown </TD>
<TD>#3 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H03_EE384x.ppt">ppt</A>
<A
href="http://www.stanford.edu/class/ee384x/Handouts/H03_EE384x.pdf">pdf</A><BR></TD>
<TD>Paper 1<BR></TD>
<TD rowSpan=4>Homework 2<BR><BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw2.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw2.ps">ps</A><BR><BR><SPAN
style="COLOR: rgb(255,0,0)">Due 4pm Monday Feb 2</SPAN></TD>
<TD style="VERTICAL-ALIGN: middle" rowSpan=2>Poisson Processes
(Abtin)<BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/lec2_final.ppt">ppt</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/lec2_final.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/lec2_final6.pdf">pdf6</A><BR></TD></TR>
<TR>
<TD>6<BR></TD>
<TD>Jan. 22</TD>
<TD style="VERTICAL-ALIGN: top" rowSpan=4>Practical difficulties: memory
bandwidth and capacity scaling. Some approaches: <BR>-Definition of
Emulation <BR>-Parallel packet buffers as standalone shared memory, with
design example. <BR>-Routers with a single stage of buffering and
constraint sets, PSM, DSM. <BR>-PPS, versions 1 and 2. <BR>-Output link
scheduling in DSM. <BR></TD>
<TD>McKeown </TD>
<TD><BR></TD>
<TD>Paper 2<BR>Paper 3<BR></TD></TR>
<TR>
<TD>7<BR></TD>
<TD>Jan. 27</TD>
<TD>McKeown </TD>
<TD>#4 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H04_packetBuffers.ppt">ppt</A>
<A
href="http://www.stanford.edu/class/ee384x/Handouts/H04_packetBuffers.pdf">pdf</A><BR></TD>
<TD><BR></TD>
<TD style="VERTICAL-ALIGN: middle" rowSpan=2>Continuous Time Markov Chains
and Basic Queueing Theory (Rui)<BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/rev4_v4.ppt">ppt</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/rev4_v4.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/rev4_v4_6.pdf">pdf6</A><BR></TD></TR>
<TR>
<TD>8 </TD>
<TD>Jan. 29 </TD>
<TD>McKeown </TD>
<TD>#5 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H05_PIFO.ppt">ppt</A>
<A
href="http://www.stanford.edu/class/ee384x/Handouts/H05_PIFO.pdf">pdf</A>
</TD>
<TD><BR></TD></TR>
<TR>
<TD>9</TD>
<TD>Feb. 3</TD>
<TD>McKeown</TD>
<TD><BR></TD>
<TD>Paper 4<BR></TD>
<TD rowSpan=4>Homework 3<BR><BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw3.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw3.ps">ps</A><BR><BR><SPAN
style="COLOR: rgb(255,0,0)">Due 4pm Friday Feb 13<SPAN
style="COLOR: rgb(0,0,0)"><BR><BR><A
href="http://www.stanford.edu/class/ee384x/hw3.html">common
mistakes</A><BR></SPAN></SPAN></TD>
<TD><BR></TD></TR>
<TR>
<TD>10 </TD>
<TD>Feb. 5 </TD>
<TD style="VERTICAL-ALIGN: top">CIOQ switches, stable marriage
matchings<BR></TD>
<TD>Prabhakar </TD>
<TD>#6 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H06.pdf">pdf</A> <A
href="http://www.stanford.edu/class/ee384x/Handouts/H06.ps">ps</A> </TD>
<TD>Paper 5<BR>Paper 9<BR></TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD></TR>
<TR>
<TD>11 </TD>
<TD>Feb. 10 </TD>
<TD style="VERTICAL-ALIGN: top">CIOQ S=4, S=2 result. </TD>
<TD>Prabhakar </TD>
<TD>#7 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H07.pdf">pdf</A> <A
href="http://www.stanford.edu/class/ee384x/Handouts/H07.ps">ps</A> </TD>
<TD>Paper 6<BR>Paper 7 </TD>
<TD style="VERTICAL-ALIGN: top" rowSpan=2><BR>Midterm review
(Abtin)<BR></TD></TR>
<TR>
<TD>12 </TD>
<TD>Feb. 12 </TD>
<TD style="VERTICAL-ALIGN: top">HoL blocking. Balls and bins. Throughput
with flushing. A queueing formula.<BR></TD>
<TD>Prabhakar </TD>
<TD>#8 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H08.pdf">pdf</A> <A
href="http://www.stanford.edu/class/ee384x/Handouts/H08.ps">ps</A> </TD>
<TD>Paper 8 </TD></TR>
<TR>
<TD>13 </TD>
<TD>Feb. 17 </TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD>
<TD vAlign=top><SPAN style="COLOR: rgb(255,0,0)">In-class
midterm</SPAN><BR></TD>
<TD><BR></TD>
<TD><BR></TD>
<TD><BR></TD>
<TD><BR></TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD></TR>
<TR>
<TD>14 </TD>
<TD>Feb. 19 </TD>
<TD style="VERTICAL-ALIGN: middle"
rowSpan=6><B>PART-II:<BR>Input-<BR>Queued <BR>Switches</B></TD>
<TD vAlign=top rowSpan=4>Karol's 2-sqrt(2) result. VOQs and scheduling.
<BR>Switch scheduling and bipartite graph matching.<BR>Definition of 100%
throughput.<BR>Algorithms for 100% throughput: When traffic is uniform -
simple RR and randome matchings; When traffic matrix is known -
Birkhoff-von Neuman decomposition; When traffic is not known - Lyapunov
stability.<BR></TD>
<TD>Prabhakar </TD>
<TD>#9 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H09.pdf">pdf</A> <A
href="http://www.stanford.edu/class/ee384x/Handouts/H09.ps">ps</A> </TD>
<TD><BR></TD>
<TD rowSpan=3>Homework 4<BR><BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw4.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw4.ps">ps</A><BR><BR><SPAN
style="COLOR: rgb(255,0,0)">Due 4pm Monday Mar 1</SPAN><BR><BR><BR></TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD></TR>
<TR>
<TD>15</TD>
<TD>Feb. 24 </TD>
<TD>Prabhakar </TD>
<TD>#10 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H10.pdf">pdf</A> <A
href="http://www.stanford.edu/class/ee384x/Handouts/H10.ps">ps</A> </TD>
<TD><BR></TD>
<TD style="VERTICAL-ALIGN: top" rowSpan=2><BR>Review session
(Rui)<BR></TD></TR>
<TR>
<TD>16</TD>
<TD>Feb. 26 </TD>
<TD>Prabhakar </TD>
<TD>#11 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H11.pdf">pdf</A> <A
href="http://www.stanford.edu/class/ee384x/Handouts/H11.ps">ps</A> </TD>
<TD><BR></TD></TR>
<TR>
<TD>17</TD>
<TD>Mar. 2 </TD>
<TD>Prabhakar </TD>
<TD>#12 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H12.pdf">pdf</A> <A
href="http://www.stanford.edu/class/ee384x/Handouts/H12.ps">ps</A> </TD>
<TD>Paper 10 </TD>
<TD rowSpan=4>Homework 5<BR><BR><A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw5.pdf">pdf</A>,
<A
href="http://www.stanford.edu/class/ee384x/Handouts/2004hw5.ps">ps</A><BR><BR><SPAN
style="COLOR: rgb(255,0,0)">Due 4pm Friday Mar 12</SPAN><BR><BR></TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD></TR>
<TR>
<TD style="VERTICAL-ALIGN: top">18 </TD>
<TD style="VERTICAL-ALIGN: top">Mar. 4 </TD>
<TD style="VERTICAL-ALIGN: top">Stability of network systems: Foster's
criterion, Application to M/M/1 queue. </TD>
<TD style="VERTICAL-ALIGN: middle">Prabhakar </TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD>
<TD style="VERTICAL-ALIGN: middle">Paper 11<BR>Paper 12 </TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD></TR>
<TR>
<TD style="VERTICAL-ALIGN: top">19 </TD>
<TD style="VERTICAL-ALIGN: top">Mar. 9 </TD>
<TD style="VERTICAL-ALIGN: top">Intro to stability of IQ switches: MSM
counterexample, Intuitive proof that MWM gives 100% throughput. </TD>
<TD style="VERTICAL-ALIGN: middle">Prabhakar </TD>
<TD style="VERTICAL-ALIGN: middle">#13 <A
href="http://www.stanford.edu/class/ee384x/Handouts/H13.pdf">pdf</A> </TD>
<TD style="VERTICAL-ALIGN: middle"><BR></TD>
<TD style="VERTICAL-ALIGN: top" rowSpan=2>Final review session<BR></TD></TR>
<TR>
<TD style="VERTICAL-ALIGN: top">20 </TD>
<TD style="VERTICAL-ALIGN: top">Mar. 11 </TD>
<TD style="VERTICAL-ALIGN: top"><BR></TD>
<TD style="VERTICAL-ALIGN: top">Architecture of Juniper routers. </TD>
<TD style="VERTICAL-ALIGN: top">Pradeep Sindhu<BR>(CTO of Juniper) </TD>
<TD
style="VERTICAL-ALIGN: middle; COLOR: rgb(255,0,0); TEXT-ALIGN: left"><SPAN
style="COLOR: rgb(0,51,0)"> <A
href="http://www.stanford.edu/class/ee384x/Handouts/stanford_m40.ppt">ppt</A></SPAN>
</TD>
<TD style="VERTICAL-ALIGN: top">Location: <BR>Gates 104 </TD></TR>
<TR>
<TD style="VERTICAL-ALIGN: top" colSpan=9><SPAN
style="FONT-WEIGHT: bold; COLOR: rgb(255,0,0)"><SPAN
style="COLOR: rgb(255,0,0)">Final Exam: </SPAN>Wed. March 17,
7:00-10:00pm, </SPAN><SPAN style="COLOR: rgb(255,0,0)"><SPAN
style="FONT-WEIGHT: bold">Mitchell B67</SPAN><SPAN
style="COLOR: rgb(0,0,0)"> (Note location change. Mitchell is between
Terman and Main Quad)</SPAN></SPAN>
</TD></TR></TBODY></TABLE></CENTER><BR><BR></BODY></HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -