David G. Andersen

12 Pages·2014·0.11 MB·English

David G. Andersen
ComputerScienceDepartment Phone:[phone]
CarnegieMellonUniversity Fax: [phone]
5000ForbesAve [email protected]
Pittsburgh,PA15213 http://www.cs.cmu.edu/˜dga/
Education MASSACHUSETTS INSTITUTEOF TECHNOLOGY Cambridge,MA
Ph.D.inComputerScience. February2005.
Thesis:“ImprovingEnd-to-EndAvailabilityusingOverlayNetworks”
Minor:ComputationalBiology
S.M.inComputerScience,2001
Advisor:HariBalakrishnan
UNIVERSITY OF UTAH SaltLakeCity,UT
BachelorofScienceinComputerScience. CumLaude,1998
BachelorofScienceinBiology.CumLaude,1998
Research Interests
Energy-efficientcomputing;distributedsystems;computernetworks.
ProfessionalExperience
2011– AssociateProfessor CarnegieMellonUniversityDepartmentofComputerScience
AsummaryofmyresearchactivitiesatCMUandelsewherebeginsonpage6.
2005–2011 AssistantProfessor CarnegieMellonUniversityDepartmentofComputerScience
1999–2004 ResearchAssistant MIT
ResearchassistantattheLaboratoryforComputerScience(LCS/CSAIL).Workedincooperation
withtheUniversityofUtahontheRON+Emulabtestbed. MajorprojectsatMITincludeResilient
OverlayNetworks(RON),MultihomedOverlayNetworks(MONET),Mayday,andtheCongestion
Manager.
Summer2001 Intern CompaqSRC
SummerinternshipworkingontheSecureNetworkAttachedDisksproject.
1997-1999 ResearchAssistant/ResearchAssociate UniversityofUtah
OneyearasanundergraduateandoneyearasastaffresearchassociateintheFluxresearchgroup
attheUniversityofUtah.
1996-1997 ResearchAssistant DepartmentofBiology,UniversityofUtah
UndergraduateresearchassistantshipintheWaynePottsLaboratoryintheDepartmentofBiology.
1995-1997 Co-founderandCTO,ArosNet,Inc.
Actedinadirectorialandtechnicalcapacityovertechnicaloperations:networkdesignandtopology
planning, software development, consulting projects, and short-term research. During my three
yearswiththecompany,ArosNetgrewfromitsinceptiontobecomethethirdlargestISPinUtah.
1995– ConsultantandExpertWitness Multi-StateLotteryAssociation,Intel,Banner&Witcoff,LLC,
IJNT,Inc.,Ascensus,others.
Providednetworkdesign,security,andintellectualpropertyconsultingandexpertwitnessing. Re-
searchconsultingforIntelResearch.
1
Refereed Publications
[1] Bin Fan, David G. Andersen, Michael Kaminsky, and Michael D. Mitzenmacher. Cuckoo filter:
PracticallybetterthanBloom. InProc.CoNEXT,December2014.
[2] Mu Li, David G. Andersen, Jun Woo Park, Alexander J. Smola, Amr Ahmed, Vanja Josifovski,
JamesLong, EugeneJ. Shekita, andBor-Yiing Su. Scalingdistributedmachinelearningwith the
parameterserver. InProc.11thUSENIXOSDI,Broomfield,CO,October2014.
[3] Anuj Kalia, Michael Kaminsky, and David G. Andersen. Using RDMA efficiently for key-value
services. InProc.ACMSIGCOMM,Chicago,IL,August2014.
[4] David Naylor, Matthew K. Mukerjee, et al. XIA: Architecting a more trustworthy and evolvable
internet. ACMComputerCommunicationsReview,44(3),July2014.
[5] Hyeontaek Lim, Dongsu Han, David G. Andersen, and Michael Kaminsky. MICA: A holistic
approach to near-line-rate in-memory key-value caching on general-purpose hardware. In Proc.
11thUSENIXNSDI,Seattle,WA,April2014.
[6] XiaozhouLi,DavidG.Andersen,MichaelKaminsky,andMichaelJ.Freedman. Algorithmicim-
provementsforfastconcurrentcuckoohashing. InProc.9thACMEuropeanConferenceonCom-
puterSystems(EuroSys),April2014.
[7] DongZhou,BinFan,HyeontaekLim,DavidG.Andersen,andMichaelKaminsky. Scalable,High
PerformanceEthernetForwardingwith CuckooSwitch. In Proc. 9th InternationalConference on
emergingNetworkingEXperimentsandTechnologies(CoNEXT),December2013.
[8] Iulian Moraru, David G. Andersen, Michael Kaminsky, Parthasarathy Ranganathan, Niraj Tolia,
andNathanBinkert. Consistent, durable,andsafememorymanagementforbyte-addressablenon
volatilemainmemory. InProceedingsoffirstConferenceonTimelyResultsinOperatingSystems
TRIOS,November2013.
[9] IulianMoraru,DavidG.Andersen,andMichaelKaminsky. Thereismoreconsensusinegalitarian
parliaments. InProc.24thACMSymposiumonOperatingSystemsPrinciples(SOSP),Farmington,
PA,November2013.
[10] Bin Fan, DongZhou, HyeontaekLim, MichaelKaminsky,andDavid G. Andersen. When cycles
arecheap,sometablescanbehuge. InProc.HotOSXIV,SantaAnaPueblo,NM,May2013.
[11] DongZhou, David G. Andersen, and MichaelKaminsky. Space-efficient, high-performancerank
& select structures on uncompressed bit sequences. In Proc. 12th International Symposium on
ExperimentalAlgorithms(SEA),June2013.
[12] BinFan,DavidG.Andersen,andMichaelKaminsky.MemC3:Compactandconcurrentmemcache
withdumbercachingandsmarterhashing. InProc.10thUSENIXNSDI,Lombard,IL,April2013.
[13] WyattLloyd,MichaelJ.Freedman,MichaelKaminsky,andDavidG.Andersen.Strongersemantics
forlow-latencygeo-replicatedstorage. InProc.10thUSENIXNSDI,Lombard,IL,April2013.
[14] Hyeontaek Lim, David G. Andersen, and Michael Kaminsky. Practical batch-updatable external
hashing with sorting. In Proc. Meeting on Algorithm Engineering and Experiments (ALENEX),
January2013.
[15] AmarPhanishayee,DavidG.Andersen,HimabinduPucha,AnnaPovzner,andWendyBelluomini.
Flex-KV:Enablinghigh-performanceandflexibleKVsystems. InProc.WorkshoponManagement
ofBigDataSystems,September2012.
[16] Vijay Vasudevan, Michael Kaminsky, and David G. Andersen. Using vector interfaces to deliver
millions of IOPS from a networked key-value storage server. In Proc. 3rd ACM Symposium on
CloudComputing(SOCC),SanJose,CA,October2012.
[17] Dongsu Han, Ashok Anand, Fahad Dogar, Boyan Li, Hyeontaek Lim, Michel Machado, Arvind
Mukundan,WenfeiWu,AdityaAkella,DavidG.Andersen,JohnW.Byers,SrinivasanSeshan,and
PeterSteenkiste. XIA:Efficientsupportforevolvableinternetworking.InProc.9thUSENIXNSDI,
SanJose,CA,April2012.
2
[18] Iulian Moraru and David G. Andersen. Exact pattern matching with feed-forward bloom filters.
JournalofExperimentalAlgorithmics(JEA),17(1),July2012.
[19] HyeontaekLim,BinFan,DavidG.Andersen,andMichaelKaminsky. SILT:Amemory-efficient,
high-performancekey-valuestore.InProc.23rdACMSymposiumonOperatingSystemsPrinciples
(SOSP),Cascais,Portugal,October2011.
[20] Wyatt Lloyd, MichaelJ. Freedman, MichaelKaminsky, and David G. Andersen. Don’tsettle for
eventual: Scalablecausalconsistencyforwide-areastoragewithCOPS. InProc.23rdACMSym-
posiumonOperatingSystemsPrinciples(SOSP),Cascais,Portugal,October2011.
[21] Bin Fan, Hyeontaek Lim, David G. Andersen, and Michael Kaminsky. Small cache, big effect:
Provableload balancingforrandomlypartitionedcluster services. InProc. 2nd ACMSymposium
onCloudComputing(SOCC),Cascais,Portugal,October2011.
[22] Hamid Hajabdolali Bazzaz, Malveeka Tewari, Guohui Wang, George Porter, T. S. Eugene Ng,
David G. Andersen, Michael Kaminsky, Michael A. Kozuch, and Amin Vahdat. Switching the
opticaldivide: Fundamentalchallengesforhybridelectrical/opticaldatacenternetworks. InProc.
2ndACMSymposiumonCloudComputing(SOCC),Cascais,Portugal,October2011.
[23] AshokAnand,FahadR.Dogar,DongsuHan,BoyanLi,HyeontaekLim,MichelMachado,Wenfei
Wu, Aditya Akella, David G. Andersen, John W. Byers, SrinivasanSeshan, and Peter Steenkiste.
XIA: An architecture for an evolvable and trustworthy internet. In Proc. ACM Hotnets-X, Cam-
bridge,MA.USA.,November2011.
[24] Xin Zhang, Hsu-Chun Hsiao, Geoffrey Hasker, Haowen Chan, Adrian Perrig, and David G. An-
dersen. SCION: Scalability, control, and isolation on next-generation networks. In Proc. IEEE
SymposiumonSecurityandPrivacy,Oakland,CA,May2011.
[25] David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, and
VijayVasudevan. FAWN:Afastarrayofwimpynodes. CommunicationsoftheACM,54(7):101–
109,July2011.
[26] VijayVasudevan,DavidG.Andersen,andMichaelKaminsky. ThecaseforVOS:Thevectoroper-
atingsystem. InProc.HotOSXIII,Napa,CA,May2011.
[27] AnirudhBadam,DongsuHan,DavidG.Andersen,MichaelKaminsky,KonstantinaPapagiannaki,
and Srinivasan Seshan. The hare and the tortoise: Taming wireless losses by exploiting wired
reliability. InProc.ACMMobiHoc,Paris,France,May2011.
[28] Vijay Vasudevan, David G. Andersen, Michael Kaminsky, Jason Franklin, Michael A. Kozuch,
IulianMoraru,PadmanabhanPillali,andLawrenceTan. Challengesandopportunitiesforefficient
computingwithFAWN. OperatingSystemsReview,(1):33–44,January2011.
[29] IulianMoraruandDavidG.Andersen. Exactpatternmatchingwithfeed-forwardbloomfilters. In
ProceedingsoftheWorkshoponAlgorithmEngineeringandExperiments(ALENEX11),ALENEX
2011.SocietyforIndustrialandAppliedMathematics,January2011.
[30] Bin Fan, David G. Andersen, Michael Kaminsky, and Konstantina Papagiannaki. Balancing
throughput,robustness,andin-orderdeliveryinP2PVoD. InProc.CoNEXT,December2010.
[31] GuohuiWang, David G. Andersen, Michael Kaminsky, Michael Kozuch, T. S. Eugene Ng, Kon-
stantina Papagiannaki, and Michael Ryan. c-Through: Part-time optics in data centers. In Proc.
ACMSIGCOMM,NewDelhi,India,August2010.
[32] RickMcGeer,DavidG.Andersen,andStephenSchwab.Thenetworktestbedmappingproblem.In
Proc.6thInternationalConferenceonTestbedsandResearchInfrastructuresfortheDevelopment
ofNetworksandCommunities(TridentCom),May2010.
[33] SangKilCha,IulianMoraru,JiyongJang,JohnTruelove,DavidBrumley,andDavidG.Andersen.
SplitScreen: Enabling efficient, distributed malware detection. In Proc. 7th USENIX NSDI, San
Jose,CA,April2010.
3
[34] Kanat Tangwongsan, Himabindu Pucha, David G. Andersen, and Michael Kaminsky. Efficient
similarityestimationforsystemsexploitingdataredundancy.InProc.IEEEINFOCOM,SanDiego,
CA,March2010.
[35] David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, and David Karger. Scaling
all-pairsoverlayrouting. InProc.CoNEXT,December2009.
[36] GuohuiWang, David G. Andersen, Michael Kaminsky, Michael Kozuch, T. S. Eugene Ng, Kon-
stantinaPapagiannaki,MadeleineGlick,andLilyMummert. Yourdatacenterisarouter:Thecase
forreconfigurableopticalcircuitswitchedpaths. InProc.ACMHotnets-VIII,NewYorkCity,NY.
USA.,October2009.
[37] DavidG.Andersen,JasonFranklin,MichaelKaminsky,AmarPhanishayee,LawrenceTan,andVi-
jayVasudevan.FAWN:Afastarrayofwimpynodes. InProc.22ndACMSymposiumonOperating
SystemsPrinciples(SOSP),BigSky,MT,October2009.
[38] Vijay Vasudevan, Amar Phanishayee, Hiral Shah, Elie Krevat, David G. Andersen, Gregory R.
Ganger,GarthA.Gibson,andBrianMueller. Safeandeffectivefine-grainedTCPretransmissions
fordatacentercommunication. InProc.ACMSIGCOMM,Barcelona,Spain,August2009.
[39] B.AdityaPrakash,NicholasValler,DavidG.Andersen,MichalisFaloutsos,andChristosFaloutsos.
BGP-lens:patternsandanomaliesinInternetroutingupdates. InProc.15thSIGKDDInternational
ConferenceOnKnowledgeDiscoveryandDataMining,industrialtrack,Paris,France,June2009.
[40] Bryan Parno, Jonathan M. McCune, Dan Wendlandt, David G. Andersen, and Adrian Perrig.
CLAMP: Practical prevention of large-scale data leaks. In Proc. IEEE Symposium on Security
andPrivacy,Oakland,CA,May2009.
[41] Vijay Vasudevan, Jason Franklin, David Andersen, Amar Phanishayee, Lawrence Tan, Michael
Kaminsky, and Iulian Moraru. FAWNdamentally power-efficient clusters. In Proc. HotOS XII,
MonteVerita,Switzerland,May2009.
[42] Dongsu Han, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, and Srinivasan
Seshan. Access pointlocalizationusing local signalstrengthgradient. In Passive & Active Mea-
surement(PAM),Seoul,SouthKorea,April2009.
[43] GeorgeNychis,VyasSekar,DavidG.Andersen,HyongKim,andHuiZhang. Anempiricalevalu-
ationofentropy-basedtrafficanomalydetection. InProc.InternetMeasurementConference,Vou-
liagmeni,Greece,October2008.
[44] DongsuHan,AdityaAgarwala,DavidG.Andersen,MichaelKaminsky,KonstantinaPapagiannaki,
andSrinivasanSeshan. Mark-and-Sweep: Getting the “inside”scoopon neighborhoodnetworks.
InProc.InternetMeasurementConference,Vouliagmeni,Greece,October2008.
[45] FahadDogar,AmarPhanishayee,HimabinduPucha,OlatunjiRuwase,andDavidAndersen. Ditto
-asystemforopportunisticcachinginmulti-hopwirelessmeshnetworks.InProc.ACMMobiCom,
SanFrancisco,CA,September2008.
[46] David G. Andersen, Hari Balakrishnan, Nick Feamster, Teemu Koponen, Daekyeong Moon, and
ScottShenker.AccountableInternetProtocol(AIP).InProc.ACMSIGCOMM,Seattle,WA,August
2008.
[47] DanWendlandt,DavidAndersen,andAdrianPerrig. Perspectives: ImprovingSSH-stylehostau-
thenticationwithmulti-pathprobing. InProc.USENIXAnnualTechnicalConference,Boston,MA,
June2008.
[48] HimabinduPucha,MichaelKaminsky,DavidG.Andersen,andMichaelA.Kozuch. Adaptivefile
transfersfordiverseenvironments. InProc. USENIXAnnualTechnicalConference, Boston, MA,
June2008.
[49] VyasSekar,MichaelK.Reiter,WalterWillinger,HuiZhang,RamanaRaoKompella,andDavidG.
Andersen. cSamp: Asystemfornetwork-wideflowmonitoring. InProc.5thUSENIXNSDI,San
Francisco,CA,April2008.
4
[50] MikhailAfanasyev,DavidG. Andersen,andAlexC. Snoeren. Efficiencythrougheavesdropping:
Link-layerpacketcaching. InProc.5thUSENIXNSDI,SanFrancisco,CA,April2008.
[51] Bryan Parno, Adrian Perrig, and David G. Andersen. SNAPP: Stateless network-authenticated
pathpinning. InProc.ACMSymposiumonInformation,Computer,andCommunicationsSecurity
(ASIACCS),Tokyo,Japan,March2008.
[52] AmarPhanishayee,ElieKrevat,VijayVasudevan,DavidG.Andersen,GregoryR.Ganger,GarthA.
Gibson,andSrinivasanSeshan. MeasurementandanalysisofTCPthroughputcollapseincluster-
basedstoragesystems. InProc.USENIXConferenceonFileandStorageTechnologies(FAST),San
Jose,CA,February2008.
[53] ElieKrevat,VijayVasudevan,AmarPhanishayee,DavidG.Andersen,GregoryR.Ganger,GarthA.
Gibson,andSrinivasanSeshan. Onapplication-levelapproachestoavoidingTCPthroughputcol-
lapseincluster-basedstoragesystems. InProc.PetascaleDataStorageWorkshopatSupercomput-
ing’07,November2007.
[54] DavidAndersen,HariBalakrishnan,NickFeamster,TeemuKoponen,DaekyeongMoon,andScott
Shenker. HoldingtheInternetaccountable. InProc.6thACMWorkshoponHotTopicsinNetworks
(Hotnets-VI),Atlanta,GA,November2007.
[55] MatthewW.Dunlop,GingerPerng,andDavidG.Andersen.SWAP:Sharedwirelessaccessprotocol
(usingreciprocity). InIEEEWorkshoponInformationAssurance,June2007.
[56] Himabindu Pucha, David G. Andersen, and Michael Kaminsky. Exploiting similarity for multi-
sourcedownloadsusingfilehandprints. InProc.4thUSENIXNSDI,Cambridge,MA,April2007.
[57] DanWendlandt,IoannisAvramopoulos,DavidAndersen,andJenniferRexford. Don’tsecurerout-
ingprotocols,securedatadelivery.InProc.5thACMWorkshoponHotTopicsinNetworks(Hotnets-
V),Irvine,CA,November2006.
[58] NirajTolia,MichaelKaminsky,DavidG.Andersen,andSwapnilPatil. AnarchitectureforInternet
datatransfer. InProc.3rdSymposiumonNetworkedSystemsDesignandImplementation(NSDI),
SanJose,CA,May2006.
[59] DavidG.Andersen,HariBalakrishnan,M.FransKaashoek,andRohitRao. ImprovingWebavail-
abilityforclientswithMONET. InProc.2ndUSENIXNSDI,Boston,MA,May2005.
[60] David G. Andersen, Alex C. Snoeren, and Hari Balakrishnan. Best-path vs. multi-path overlay
routing. InProc.ACMSIGCOMMInternetMeasurementConference,Miami,FL,October2003.
[61] NickFeamster,DavidAndersen,HariBalakrishnan,andM.FransKaashoek. Measuringtheeffects
ofInternetpathfaultsonreactiverouting. InProc.ACMSIGMETRICS,SanDiego,CA,June2003.
[62] MarcosK.Aguilera,MinwenJi,MarkLillibridge,JohnMacCormick,ErwinOertli,DavidG.An-
dersen, Mike Burrows, Timothy Mann, and Chandramohan Thekkath. Block-Level Security for
Network-Attached Disks. In Proc. 2nd USENIX Conference on File and Storage Technologies,
March2003.
[63] DavidG.Andersen.Mayday:DistributedFilteringforInternetServices.InProc.4thUSENIXSym-
posiumonInternetTechnologiesandSystems(USITS),Seattle,Washington,March2003. PDF/ps
updated2008tocorrectanunclearexplanation.
[64] DavidG.Andersen,NickFeamster,SteveBauer,andHariBalakrishnan. Topologyinferencefrom
BGP routing dynamics. In Proc. ACM SIGCOMM Internet Measurement Workshop, Marseille,
France,November2002.
[65] DavidG.Andersen,HariBalakrishnan,M.FransKaashoek,andRobertMorris. ResilientOverlay
Networks.InProc.18thACMSymposiumonOperatingSystemsPrinciples(SOSP),Banff,Canada,
October2001.
[66] David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, and Robert Morris. The Case for
ResilientOverlayNetworks. InProc.HotOSVIII,Schloss-Elmau,Germany,May2001.
5
[67] AlexSnoeren, DavidAndersen, andHariBalakrishnan. Fine-GrainedFailoverUsingConnection
Migration. InProc. 3ndUSENIXSymposiumonInternetTechnologiesandSystems(USITS),San
Francisco,CA,March2001.
[68] DavidAndersen,DeepakBansal,DorothyCurtis,SrinivasanSeshan,andHariBalakrishnan. Sys-
tem supportfor bandwidthmanagementand content adaptationin Internetapplications. In Proc.
4thUSENIXOSDI,pages213–225,SanDiego,CA,November2000.
[69] Ray Spencer, Stephen Smalley, Peter Loscocco, Mike Hibler, David Andersen, and Jay Lepreau.
The Flask Security Architecture: System Support for Diverse Security Policies. In Proc. 8th
USENIXSecuritySymposium,Washington,DC,August1999.
OtherArticles
[70] Dongsu Han, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, and Srinivasan
Seshan. Hulu in the neighborhood. In Proc. 3rd International Conference on Communication
SystemsandNetworks(COMSNET),January2011. invitedpaper.
[71] DavidG. AndersenandStevenSwanson. Rethinkingflash in the datacenter. IEEEMicro, 2010.
(Invitedcommentaryarticle).
[72] VijayVasudevan,DavidG.Andersen,MichaelKaminsky,LawrenceTan,JasonFranklin,andIulian
Moraru. Energy-efficientclustercomputingwithFAWN:Workloadsandimplications. InProc.e-
Energy2010,Passau,Germany,April2010. (invitedpaper).
[73] IulianMoraruandDavidG.Andersen. Fastcacheforyourtext: Acceleratingexactpatternmatch-
ingwithfeed-forwardbloomfilters. TechnicalReportCMU-CS-09-159,DepartmentofComputer
Science,CarnegieMellonUniversity,November2009.
[74] MadeleineGlick,DavidG.Andersen,MichaelKaminsky,andLilyMummert. Dynamicallyrecon-
figurableopticallinksforhigh-bandwidthdatacenternetworks.InOpticalFiberComm.Conference
(OFC),March2009. (invitedpaper).
[75] SzymonJakubczak,DavidG.Andersen,MichaelKaminsky,KonstantinaPapagiannaki,andSrini-
vasan Seshan. Link-alike: using wireless to share network resources in a neighborhood. ACM
SIGMOBILEMC2R,12(4),October2008. (invitedpaper).
[76] ElaineShi,IonStoica,DavidAndersen,andAdrianPerrig. OverDoSe:AgenericDDoSprotection
serviceusinganoverlaynetwork. TechnicalReportCMU-CS-06-114,CarnegieMellonUniversity
ComputerScienceDepartment,February2006.
[77] NirajTolia, David G. Andersen,and M. Satyanarayanan. Quantifyinginteractiveuser experience
onthinclients. IEEEComputer,39(3),March2006.
[78] DavidG.AndersenandNickFeamster. ChallengesandopportunitiesinInternetdatamining.Tech-
nicalReportCMU-PDL-06-102,CarnegieMellonUniversity,January2006.
[79] DavidG.Andersen. Criticalnetworkinginfrastructureinasuitcase. InNSFWorkshoponResearch
ChallengesinDistributedComputerSystems,September2005. (positionpaper).
[80] David G. Andersen. Overlay networks: Networking on top of the network. ACM Computing
ReviewsHotTopicsessay-http://www.reviews.com/hottopic/hottopicessay.cfm,September2004.
[81] DavidG.Andersen,HariBalakrishnan,M.FransKaashoek,andRobertMorris.Experiencewithan
EvolvingOverlayNetwork Testbed. ACM ComputerCommunicationsReview, 33(3):13–19,July
2003.
Allpapersareavailableonlineat: http://www.cs.cmu.edu/∼dga/papers/
Patents “Methodandsystemformanagingaccesscontrol”(number20040243827,published)and“Method
and system for securing block-basedstorage with capability data.” MarcosK. Aguilera, Minwen
6
Ji,MarkLillibridge,JohnMacCormick,OerwinOertli,DaveAndersen,MikeBurrows,TimMann,
ChanduThekkath.filedMay2003,(number20040243828,Abandoned)
Software Artifacts
Memoryefficientdatamanagement -memory-efficientmulti-patternsearch;theMemC3memorycachinglayer.
FAWN-KV Ahigh-performance,log-structuredkey-valuestoragesystemdesignedtooperateonFlashstorage.
SplitScreen High-performance,open source virus scanning. Distributed as patches to the popular “ClamAV”
virusscanner.
Perspectives TheFirefoxpluginandSSHpatchesforautomaticallyauthenticatingself-signedcertificates. This
softwarehasbeeninstalledbyover30,000users.
DOT TheData-OrientedTransferservice:End-hostsoftwarethatprovidesaflexible,modulardatatrans-
ferserviceonbehalfofotherapplications.
CM TheCongestionManager:Congestioncontrolsoftwareforend-hosts.
RON Resilient Overlay Networks: End-hostbased overlayroutingthat routesaroundfailures and poor
performance.
MONET AWebproxyderivedfromtheSquidproxythatusesmultiplelocalnetworkprovidersandanoverlay
networkofpeerproxiestoprovidehighlyavailableandfastWebaccess.
TheRONTestbed A 36-site Internet testbed used by a dozen or so external researchers, in addition to several re-
searcherswithinMITandCarnegieMellon.
Talks
2012 “FAWN:FromArchitecturetoAlgorithms.”UniversityofWisconsin,Madison;UniversityofCali-
fornia,SanDiego;HarvardUniversity.
2010 IntelResearch,Beijing,China,“ExperienceswithFAWN.”
2010 MicrosoftResearchAsia,Beijing,China,“ExperienceswithFAWN.”
2006–2010 YearlyCylabseminarandreviewmeetingspeaker
2010 Industryfacultyvisitdays:NetworkAppliance,Microsoft,Google.
Apr2010 Invitedtalk,IBMAlmaden,“ExperienceswithFAWN.”
Apr2010 UCSDworkshoponnon-volatilememory,“SystemandAlgorithmicAdaptationforFlash”
Jun2009 UniversityofWashingtonmini-workshoponsystems,“TheCaseforaFastArrayofWimpyNodes”
2009 IntelOpenHouse,featuredspeaker
Jul2009 NetworkAppliance,“AFastArrayofWimpyNodes”
May2009 MassachusettsInstituteofTechnology,“TheCaseforaFastArrayofWimpyNodes”
Dec2008 NIPS(NeuralInformationProcessingSymposium)workshoponParallelImplementationsofLearn-
ingAlgorithms,“UsingaFastArrayofWimpyNodes.”
Aug2008 SIGCOMMtalk,“AccountableInternetProtocol.”
Nov2006 GeorgiaInstituteofTechnology,“BuildingBetterDataTransfers”
Nov2006 UniversityofWashingtonDatabaseSeminar,“EasingthePainofNetworkDataAnalysis”
May2006 BrownUniversity,“Data-OrientedTransfer”
Sep2005 MIT,NSFGrandChallengesinNetworkingWorkshop
Jan2005 NSFWorkshopinOvercomingBarrierstoDisruptiveInnovationinNetworking
7
May2005 NSDIConferencepapertalk,
“ImprovingWebAvailabilityforClientswithMONET”
Oct2003 InternetMeasurementConferenceConferencepapertalk,
“Best-Pathvs. Multi-PathOverlayRouting.”
Aug2003 IRISStudentWorkshop
“AnEnd-to-EndApproachtoNetworkFailureRecovery”
Mar2003 USITSConferencepapertalk,
“Mayday:DistributedFilteringforInternetServices.”
Nov2002 InternetMeasurementWorkshopWorkshoppapertalk,
“TopologyInferencefromBGPRoutingDynamics.”
Oct2002 OPENSIGinvitedtalk,
“RON:ChoosingResiliency.”
Oct2001 SOSPConferencepapertalk,
“ResilientOverlayNetworks.”
May2001 HotOSVIIIWorkshoppapertalk,
“TheCaseforResilientOverlayNetworks.”
Oct2000 OSDIConferencepapertalk,
“SystemSupportforBandwidthManagementandContentAdaptationinInternetApplications.”
Feb1999 OSDIworks-in-progress
“Agile:AhierarchicallyExtensibleSecurityPolicyArchitecture.”
Selected Honors andAwards
2013 CarnegieMellonUniversityHerbertA.SimonAwardforTeachingExcellenceinComputerScience
2012 CarnegieMellonUniversityAllenNewellAwardforResearchExcellence.
2011 SloanFoundationFellowship
2009 Bestpaperaward,SymposiumonOperatingSystemsPrinciples(SOSP)
2006–2008 SelectedtoserveontheDARPAComputerScienceStudyPanel
2006 NSFCAREERAward(FacultyEarlyCareerDevelopment)
2005 MITEECSGeorgeM.SprowlsAwardforoutstandingPh.D.thesis
2002–2004 MicrosoftResearchGraduateFellowship
2001 BestStudentPaper,8thIEEEWorkshoponHotTopicsinOperatingSystems
2001 MITJosephLevinawardforbestMasterWorksoralpresentation
1999 MITVintonHayesFellowship(graduate)
1998 UniversityofUtahGraduatingStudentLeadershipAward
1993 Member,PhiKappaPhiandGoldenKeyacademichonorsocieties
1993–1997 UniversityofUtahHonorsatEntranceScholarship
1993 NationalMeritScholar
Service andOther Activities
2010,2014 ProgramCommittee,OSDI2010
2014 ProgramCommittee,SymposiumonExperimentalAlgorithms
2010–2013 Member,DARPAInformationSciencesandTechnology(ISAT)advisorygroup.
8
2006–2014 NSFpanelist/proposalreviewer,multiplepanels.
2012,2006 ProgramCommittee,NetworkSystemsDesignandImplmentation(NSDI)2006.
2012,2009 Programcommittee,SOSP2013(“Heavy”)
2011 Programco-chair,NSDI.
2010 Participant,NSFFutureDirectionsforComputerSystemsResearchworkshop.
2010 Organizingcommittee,2ndworkshoponArchitecturalConcernsinLargeDatacenters,inconjunc-
tionwithISCA2010.
2010 ProgramCommittee,1stInternationalConferenceonEnergy-EfficientComputingandNetworking
2008,2009 ProgramCommittee,SIGCOMM2009(“Heavy”)
2008 Programco-chair,WorkshoponHotTopicsinNetworking(HotNets)
2007,2011 ProgramCommittee,WorkshoponHotTopicsinNetworking(HotNets)
2006,2010-11 Consulting:IntelResearch/Labs,Pittsburgh.
2003–2006 Consulting:Banner&Witcoff,attorneysatlaw.
2006 ProgramCommittee,InternetMeasurementConference.
2006 Programco-chair,WORLDS2006.
2006 ProgramCommittee,2ndWorkshoponHotTopicsinSystemsDependability(HotDep).
2005 Editor(oneoftwelve),“ReportoftheNSFWorkshoponResearchChallengesinDistributedCom-
puterSystems”
2005 ProgramCommitteeandWorks-in-progresschair,USENIX2005
2004–2005 ProgramCommittee,WorkshoponReal,Large,DistributedSystems(WORLDS).
ReviewerforOSDI,SOSP,SIGCOMM,NSDI,CCR,HotOS,ToN,IEEETDSC,Infocom,HotNets.
1999–2003 Secretary,boardmember,androckclimbinginstructorfortheMITOutingClub.
1999–2000 Secretary,UtahRegionalExchangePoint
Member,IEEE,ACM,USENIX.
9
Research -Energy Efficient Data-IntensiveComputing
2007– FAWN:AFastArrayofWimpyNodes CMU
ThroughtheFAWNproject,Iamexploringthedesignofhighlyenergyefficientclustersfordata-
intensive computing. FAWN constructs clusters from large numbers of relatively “wimpy” em-
beddedsystems. It exploitsfundamentalefficienciesof using slower processors, and is designing
algorithmicandsystemstechniquestomaskthecomplexityofprogrammingandmanagingsystems
thatoperateatincreasedscalewithdecreasedper-nodecapability.
2007–2010 NetworkSupportforData-IntensiveComputing CMU
Thisprojectexploresthenetworkingchallengesthatariseinmoderndatacentersanddevisessolu-
tionstothesechallenges.Examplesincludeourworkonovercomingdatacenter“incast”,aproblem
inwhichthenetworkcandrasticallyslowdownwhentensorthousandsofcomputersallcommuni-
catewithonereceiver.
Research -Network Architecture, Analysis,andResilience
2010– TheeXtensibleInternetArchitecture(XIA) CMU
I am one of the principalinvestigatorson a multi-year, multi-million dollar NSF-fundedeffortto
developthefundamentalunderpinningsofanew,moreflexible,andmoresecureInternetArchitec-
ture.
2007–2010 TheAccountableInternetProtocol CMU
TogetherwithmycollaboratorsatMIT,Berkeley,andGeorgiaTech,Iamdevelopinganovelframe-
workforbuildinga moresecureInternet. TheAIPprojectisbaseduponthenotionofusingself-
certifyingaddressesinsteadof IPaddresses(a self-certifyingaddressisthe hash of a publickey).
We have thus far shown that using this foundation can greatly simplify many aspects of provid-
ing network security, including reducing the potential for Denial-of-Service attacks and enabling
simpler,self-configuringsecurerouting.
UnderAIP,wehavealso exploredpragmaticalternativestoconventionalroutingsecurity. Instead
ofusingcentralauthoritiestocryptographicallyauthenticateroutinginformation,weexploredthe
use of purely end-to-end authentication (which AIP facilitates) together with multi-path routing,
showingthatthisapproachismorerobusttoroutehijackingthanconventionalapproachessuchas
S-BGP,withoutrequiringcryptographicauthenticationofroutingannouncements.
2006– Perspectives CMU
Perspectivestakesideasfromoverlaysandmulti-pathnetworkingtoandappliesthemtoauthenticat-
ingremotecomputers.Thesystemhastwogoals:First,tomateriallyimprovenetwork(particularly
Web)securityforordinaryusersbyenablingtheeasyandsafeuseofself-signedcertificates. Sec-
ond,toexploretheutilityofcreatingan“automatic”publickeyinfrastructurebaseduponlong-term
observations.PerspectivesiscurrentlyavailableasaFirefoxbrowserpluginandasapatchtoSSH.
Thesepluginsuseasimplemethodtoauthenticateaself-signedcertificatereceivedfromaserver:
Theycontactasetof”notary”serversscatteredaroundthenetwork.Theseserversinformtheclient
whatkeytheyobservetheserverusing,andforhowlongtheyhaveobservedit. Asaresult,foran
attackerto successfullydeceivetheclientinto acceptinga false certificate, the attackermusthave
controlledallpathstotheserverforalongperiodoftime. TheFirefoxpluginhasbeendownloaded
byover30,000users,andtheavailabilityofthetechniquehaspresentedanewanswertothedebate
abouthowbrowsersshouldhandleself-signedcertificates.
2005– Data-OrientedTransfer CMU
The Data-Oriented Transfer project is exploring a new architecture for applications that perform
bulk data transfers. This architecture, called DOT (for data-oriented transfer), cleanly separates
two functionsthat are co-mingledin today’sapplications. Using DOT, applicationsperformcon-
tentnegotiationtodeterminewhatcontenttosend. Theythenpassthatdataobjecttothetransfer
10