We aren't endorsed by this school
##### EE 384 - Stanford Study Resources
• Stanford
• Unknown
• 7 Pages
###### Hw2

School: Stanford

Stanford University Department of Electrical Engineering EE 384X, Winter 2008 Problem Set No: 2 Date Issued: Wednesday January 23 Due: Thursday, February 7 by 4pm Please put your homework in the le bins on second oor of Packard building close to D

• 3 Pages
###### Hw1sol

School: Stanford

Stanford University Department of Electrical Engineering EE384Y, Spring 2006 Solutions to Problem Set No. 1 1. Stability with maximum weight matching (a) As an example, consider a 2 2 switch which is empty at time 0. In time slot 1, Q11 and Q21 bot

• 37 Pages
###### Hw1sol

School: Stanford

%!PS-Adobe-2.0 %Creator: dvips(k) 5.94a Copyright 2003 Radical Eye Software %Title: hw1sol.dvi %CreationDate: Sun Apr 30 12:51:44 2006 %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 595 842 %DocumentFonts: CMBX10 CMR10 CMSY10 CMMI10 CMR8 CMMI8 CMSY8

• 53 Pages
###### Hw2

School: Stanford

%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: hw2.dvi %Pages: 4 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMBX12 CMR10 CMBX10 CMMI10 CMSY10 CMMI8 CMTI10 CMSY8 %+ CMR8 %EndComments %DVIPSWebPage

• 2 Pages
###### Quiz-2

School: Stanford

Stanford University Department of Electrical Engineering EE384Y, Spring 2006 Quiz 2 Name : Date Issued: 18 May, 2006 Student ID : 1. [2 points] Describe briefly how the Valiant Load-Balanced switch works? 2. [3 points] The load-balanced switch a

• 5 Pages
###### Lu_Prabhakar_Bonomi

School: Stanford

Perfect Hashing for Network Applications Yi Lu, Balaji Prabhakar Dept. of Electrical Engineering Stanford University Stanford, CA 94305 yi.lu,balaji@stanford.edu Flavio Bonomi Cisco Systems 175 Tasman Dr San Jose, CA 95134 avio@cisco.com Abstract Ha

• 27 Pages
###### H01

School: Stanford

.sgnihctam egairram elbats ,sehctiws )QOIC( deueuq tuptuo dna tupni denibmoC .retuor yromeM derahS detubirtsiD a ni gniludehcs knil tuptuO .sehctiwS tekcaP lellaraP dna ,sretuoR yromeM derahS detubirtsiD ,sretuoR yromeM derahS lellaraP ,stes tniartsn

• 17 Pages
###### H03

School: Stanford

I traP serutcetihcrA hctiwS tekcaP :X483EE m sil ell a r a P : s e h c ti w S t e k c a P g nil a c S d a n g P r m e f i o h c t T S H w e lr c : m p C o t k h n s W S g n i t u R o c e a t ,4 .7 9 1 1 2 x483EE 6 002 retniW .2 .1 .stcilfnoc ecr

• 17 Pages
###### H06

School: Stanford

Overview of Lecture Notes Discussion of switch architectures, algorithms, proofs The crossbar switch architecture Speedup and delay control in CIOQ (crossbar) switches Stable Marriage Algorithms EE384X Packet Switch Architectures I 1 The stor

• 107 Pages
###### H07

School: Stanford

%!PS-Adobe-2.0 %Creator: dvips(k) 5.95a Copyright 2005 Radical Eye Software %Title: main.dvi %Pages: 17 %PageOrder: Ascend %Orientation: Landscape %BoundingBox: 0 0 612 792 %DocumentFonts: CMSSBX10 CMSY10 CMSS10 CMSS17 CMSSI10 CMR10 CMMI12 %+ CMR17 C

• 5 Pages
###### Hw1-sol

School: Stanford

yR 8 G SS C y d0I A0 PW( t } u t }{ t #@#\$qqkey 5 WYqv (\$ o\$ 3&\$ 5 !qov 5 yYqv 5 qxv 5 9yqoxv 5 QyYqv dt s 3Wj 5 v A 0 5 0 6 0 8 4 5 4 2 6R 0G y 4R 5 4 8 B A

• 6 Pages
###### Hw2

School: Stanford

6 A 055 v I 05 w A (99U3(91WW4 s u W HR w A 4 D xW Hy(79U3(9d|&(SS3{SQ&9 w A 4 DR 6 A 0 5 5 v I 0 5 w 0GG 4 I uR 0 6 4 6 5 BD w A 4 6 P\$9Qu p ~(WC&Wfg| u0 B w 64 f w s uY p S!d @\$9H1S\$&S7&VUW@do p {3# d

• 5 Pages
###### Hw4

School: Stanford

Stanford University Department of Electrical Engineering EE384X, Winter 2006 Problem Set No 4 Date Issued: Monday, February 27 Due: Thursday, March 9 by 4pm Please put your homework in the file bins on second floor of Packard building close to Den

• 4 Pages
###### Midterm

School: Stanford

EE 384X: Packet Switch Architectures-I Department of Electrical Engineering Stanford University Midterm Examination 21 February, 2006 Instructions: There are four questions in all. You must answer question 4 and any two of the questions 1, 2 and 3. 1

• 33 Pages
###### Hw1

School: Stanford

%!PS-Adobe-2.0 %Creator: dvips(k) 5.94a Copyright 2003 Radical Eye Software %Title: hw1.dvi %CreationDate: Mon Apr 17 14:53:19 2006 %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 595 842 %DocumentFonts: CMBX10 CMR10 CMSY10 CMMI10 CMMI8 CMR8 CMTI10 CM

• 492 Pages
###### Clos_networks

School: Stanford

%!PS-Adobe-2.0 %Creator: dvips(k) 5.96dev Copyright 2007 Radical Eye Software %Title: clos_networks.dvi %CreationDate: Tue May 20 19:25:26 2008 %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 595 842 %DocumentFonts: CMBX12 CMR12 CMR10 CMR7 CMMI12 CMSY

• 54 Pages
###### H07

School: Stanford

Active Queue Management Rong Pan Cisco System EE384y Spring Quarter 2006 Outline Queue Management Drop as a way to feedback to TCP sources Part of a closed-loop Traditional Queue Management Drop Tail Problems Active Queue Management RED

• 1 Page
• ###### ee384yproposal--Abdul-MinWook
• Register Now
###### Ee384yproposal--Abdul-MinWook

School: Stanford

Towards a Simple Congestion Control Protocol for Fast, Long Distance Networks Min-Wook Jeong, Abdul Kader Kabbani In this project we aim to streamline a reliable transport protocol that can achieve i) high bandwidth utilization, ii) fast bandwidth re

• 26 Pages
###### Lec1_final

School: Stanford

Review of Probability Theory Review Session 1 EE384X Winter 2008 EE384x 1 Random Variable A random experiment with set of outcomes Random variable is a function from set of outcomes to real numbers Winter 2008 EE384x 2 Example Indicator rando

• 9 Pages
###### Lecture4

School: Stanford

Overview of Lecture Notes Review The FKG inequality proof that LRU is better than FIFO Summary of average-case analysis EE384M Network Algorithms 1 Review Weve seen that under the IRM - cache replacement schemes are analyzable via Markov cha

• 2 Pages
###### Hw5sol

School: Stanford

Stanford University Department of Electrical Engineering EE 384X, Winter 2008 Solutions to Problem Set No: 5 1 SIM. a). The time average occupancy of Input Queue 1 (queue 1 in SIM) is given: 1.211. The latency of input queue 1 can be calculated to b

• 16 Pages
###### Lecture3

School: Stanford

Overview of Lecture Notes Cache replacement schemes: LRU, FIFO, LFU, MIN Average-case analysis - The independent reference model - The Swap algorithm - The FKG inequality - LRU is better than FIFO (After this: Worst-case analysis via competitive r

• 1 Page
###### P3

School: Stanford

To: Dr. Prabhakar and Chandra From: Navanit V. Arakeri Date: April 16, 2004 Re: Proposal for the course project in EE384M, Spring 2004 Introduction Most Medium Access Layer (MAC) layer protocols in ad-hoc wireless systems currently make use of backo

• 1 Page
###### Shubha_ndha

School: Stanford

Project Proposal for 384Y Shubha U. Nabar, Neha Kumar April 15, 2004 Achieving Stability in Networks of Input-Queued Switches using a Local Scheduling Algorithm Andrews and Zhang have shown that there exist admissible traffic patterns which cause th

• 17 Pages
###### Lecture15

School: Stanford

Recall Averaging (AVE) and Information Exchange (INF-EX) Gossip algorithm Relation between Tave and Tinf ex Today, well analyze Tave for gossip algorithm Useful references Gossip Algorithms: Design, Analysis and Applications, S. Boyd, A. Ghosh

• 12 Pages
###### Degermark-SIGCOMM97

School: Stanford

Small Forwarding Tables for Fast Routing Lookups Mikael Degermark,2 micke@cdt.luth.se, Andrej Brodnik,3 Svante Carlsson,2 and Stephen Pink 24 Andrej.BrodnikQIMFM.Uni-Lj.SI, svanteQsm.luth.se, steveQsics.se Department of Computer Science and

• 25 Pages
###### BVN-Switches-Chang

School: Stanford

o my m | m m j h f f h v h d m h g d e d g e | | m | | m y m m u s h j l o o o l i p l f h j h h u f s e e e j

• 11 Pages
###### EE384Y_scaling

School: Stanford

II traP serutcetihcrA hctiwS tekcaP :Y483EE s e h c ti w S r a b s s o r C g nil a c S .7 9 1 ,4 t p e : S r W s o k h n C m c l T i g H h P e r f o a m n c i S t c w h n g a d R o u i n g 1 2 y483EE 6002 ?yticapac rieht stimil tahw dna ,elacs

• 23 Pages
###### EE384y_Heuristics

School: Stanford

serutcetihcrA hctiwS tekcaP :y483EE scitsirueh dna noitatnemelpmi ,sgnihctaM .7 9 1 ,4 t p e : S r W s o k h n C m c l T i g H h P e r f o a m n c i S t c w h n g a d R o u i n g 1 2 6002 gnirpS swolf krowten mumixam fo selpmaxe sa sgnihctam t

• 43 Pages
###### H06

School: Stanford

Buffered Crossbars With Performance Guarantees EE384Y Thursday, April 27, 2006 S hang-Tse(Da) Chuang C S m isco yste s dachuang@ cisco.com Motivation Ne twork ope rators want pe rform anceguarante s e Throughput guarante e De guarante lay e

• 6 Pages
• ###### EE384x H01 Logistics 2008
• Register Now
###### EE384x H01 Logistics 2008

School: Stanford

EE384x: Packet Switch Architectures Handout 1: Logistics Professor Balaji Prabhakar balaji@isl.stanford.edu Professor Nick McKeown nickm@stanford.edu Winter 2008 EE384x Handout 1 1 EE384x,y: A twoquarter sequence on the theory and practice of designing

Back to course listings