5/23/2016

cs/ee143CommunicationNetworks

CS/EE143CommunicationNetworks(2015Fall)
GeneralInformation
Units
9(333)
Lectures T/R10:3011:55,102Steele
Prerequisites Math2ab,priorprogramingexperience
URL
http://courses.cms.caltech.edu/cs143
Instructor ProfStevenLow<slow@caltech.edu>,CMS/EE,x6767,219Annenberg
Admin.
ChristineOrtega<cortega@cms.caltech.edu>,245Annenberg
Assistant
Homework:ChanghongZhao<czhao@caltech.edu>
TAs
Project:CodyHan<chhan@caltech.edu>RitvikMishra<rmishra@caltech.edu>Qiuyu
Peng<qpeng@caltech.edu>
SL:Tue1:102pmwhennotontravel+appointment,219Annenberg
CZ(homework):Mons810pm,105AnnenbergMons56pm,213Annenberg.Lastone
wasonNov23.
OfficeHours
CH(project):tobearrangedwithindividualprojectteams
RM(project):tobearrangedwithindividualprojectteams
QP(project):tobearrangedwithindividualprojectteams

CourseDescription
Thiscourseintroducesthebasicmechanismsandprotocolsincommunicationnetworks,including
multipleaccess,routing,transmissioncontrol,anderrorrecovery.Itconsistsoftwomaincomponents:
Basicdescription,simplemathematicalmodelsandanalysis.
Projectthatsimulatessomeofthesemechanisms.
Computernetworksisarichanddiversesubject,spanningmathematicalmodelingandanalysis,
algorithmdesign,implementationandexperiments.Asinglecoursenecessarilyonlysamplesavery
smallcrosssection.Thegoalofthiscourseisto,ontheonehand,introduceananalyticalperspectiveto
networking,andontheotherhand,provideahandsonexperiencethroughasignificantproject.Using
routingandcongestioncontrolasavehicle,itgivesthestudentsatasteofatheoryguideddesign
approach.
ThiscoursecanbecombinedwithCS/EE144IdeasBehindtheWeb(Winter)andCS/EE145Projectsin
Networking(Spring)tosatisfytheprojectrequirementforCSundergraduatedegree,thoughCS/EE143
isnotaprerequisiteforeitherCS/EE144orCS/EE145.
Textbooks
Protocolsandmechanisms
Maintext:CommunicationNetworks:AConciseIntroductionbyJeanWalrandandShyamParekh,
Morgan&Claypool,2010
http://courses.cms.caltech.edu/cs143/

1/5

5/23/2016

cs/ee143CommunicationNetworks

Caltechhasasitelicense,soyoucandownloadaPDFforfreefromcampusnetwork.
Otherreferences:
KuroseandRoss,ComputerNetworking,recented(5thin2009)
Modelsandanalysis
Maintext:LecturenotesonTCP(readyfordownloadsoon)
Otherreferences:
SrikantandYing,CommunicationNetworks:AnOptimization,Control,andStochastic
NetworksPerspective(2014)
BersekasandGallager,DataNetworks,2ndEd,1997
Project
Projectdescription
Testcases
Projecttutorial
Specialcleantechdataanalyticsproject:askProfessorLowforapplicationifinterested
Homeworkproblems(beingupdated)
Allproblems(complete)
Homeworksolutions(beingupdated)
Allsolutions(complete)
Homeworksubmission
Pleasesubmityourhomeworkinclass,ortoChanghong'smailboxonthethirdfloorofAnnenberg
building,orviaemailasapdfattachmentifyoutypeyoursolution.
CollaborationPolicy
Forhomework,youshouldtrytosolvetheproblemsyourselffirst.Onlyafterthatshouldyoudiscuss
withyourfellowstudents.Youmusthoweverwriteupyourownsolutionindependently.
LateHomeworkPolicy
Everyonehasthree(3)tokensthroughoutthequarter.Eachtokenallowsa1dayextensionwithout
penalty.Youmaychoosetouse0,1,2,or3tokensforeachhomeworkset.Whenallthethreetokens
havebeenusedup,latehomeworkswillstillbeaccepted,anddeductedby20%/dayofthetotalpointsof
thishomeworkset.Ifyouwanttosavethetokensforthefutureanddeductpointsforthisset,please
specifyonthefirstpageofyourhomeworkandalsoviaemailtotheTA.
Grading

http://courses.cms.caltech.edu/cs143/

2/5

5/23/2016

cs/ee143CommunicationNetworks

Thisistentativeandsubjecttochange.
Homework:50%
Project:50%
Projectmilestonesandpresentations
Codecorrectness
Codestyle
Bonus:asktheprofessor
Asyoureadthroughthetextsorwatchonlinevideosonnetworkingorjusttakingawalk,jotdownany
questionsandsendthemtotheTA.Goodquestionswillbediscussedinlecturesandyoumaygetbonus
points!
Anyquestionscanbesentanytime,buttoqualifyforbonuspoints,youshouldsendquestionsbyFri
5pmontopicstobediscussedinthefollowingweek.Youcansendinanynumberofquestions,butonly
upto3willbegradedeachweekforpossiblebonuspoints.Eachstudentmaygetupto1%bonuspoint
perweek.
AnonymousFeedback
Youcanemailanonymousfeedback@cms.caltech.edutogivesuggestions,comments,andcomplaints,
anonymously,aboutthis,orother,courses,oraboutanythingelseCMS.

CourseSchedule(tentative)
Thefirsthalfofthecoursewillhavemorehomeworkthesecondhalflesshomeworksoyoucanspend
moretimeonyourproject.Youshouldbeabletostartonyourprojectafterweek2,andwewillcoverall
thenetworkingconceptsyouneedfortheprojectbeforetheendofOctober.
Thefollowingschedulegivesaroadmapofthecourseanditwillbeupdatedasweprogressthrough
thecourse,sodocheckbackfromtimetotime.
Week

Topic

Ch1Internet
Ch2Principles
Ch3Ethernet
9/29 Slides:
Intro:pptx,pdf
Ethernet:pptx,
pdf

http://courses.cms.caltech.edu/cs143/

Assignment

Notes(continuouslyupdated)
Basicconcepts:host,router,link,packet
switching,addressing,DNS.Routing.Error
detection.ARQ.Congestioncontrol.
Sharing.Metrics.Little'sTheorem,M/M/1
queue.Scalability.Layering.Application
topology:clientserver,p2p,CDN,cloud
computing.
Ethernet:Aloha(CSMA),cableEthernet
(CSMA/CD),hub,switchbinaryexponential
backoffalgorithm,SpanningTreeProtocol,
maximumthroughputofslottedandunslotted
CSMA.
Layer3routing:AS,BGP,shortestpath
3/5

5/23/2016

cs/ee143CommunicationNetworks

routing

Interdomainrouting:transit,peering,path
vectorrouting

Shortestpathrouting:Dijkstra,BellmanFord

FEC,networkcoding

Ch5Shortestpath
ProjectGroupsdue
Routing
10/6Tueinclass
Ch6Internetworking
Ch7Transport
HW1(total40pts):
dueOct6Tuebynoon Internetworking:addresses,subnets,subnet
Slides:
masks,gatewayrouter,ARPDHCP,NAT
10/6
SurveyProblem Puttingitalltogether(W&P,P5.3):BGP,
Routing:pptx,
IntrotoInternet: RIP/OSPF,STP(SpanningTreeProtocol)
pdf
1.2,1.4,1.5,1.7,
Internetworking:
Transportbasics:ports,flowID,header,
1.9
pptx,pdf
connectionsetupARQ:stopandgo,goback
Ethernet:2.1,
Transport:pptx,
N,selectiverepeat,timeout
2.3,2.4,2.5
pdf
Congestioncontrol:Windowcontrol(ARQ,
ackclocking),flowvscongestioncontrol,
AIMD,slowstart,FR/FR,TCPReno.
HW2(total60pts):
dueOct20Tueby
ProjecttutorialinclassonOct13Tue
noon
Projecttutorial
SurveyProblem Dynamicalsystemsbasics:existenceand
TCPmodels
uniquenessofsolutionofODE,definitionsof
Routing:3.2,
10/13
equilibriumandstability.
3.3,3.6,3.7
TCPtutorialslides:
Internetworking:
pptx,pdf
MathematicalmodelsofTCPReno,Vegas,
4.1
FAST.
Transport:5.1,
5.2,5.3,5.4
Convexoptimization
Basics:convexset,convexfunction,convex
10/20 theoryandapplication
program
toTCP
Optimization:KKTcondition,duality
Projectpresentation Projectmilestone1:7 Inclasspresentationson10/27Tue,29Thur
10/27
1
8mins/group
Oct27TueSLaway.
Applicationofconvexoptimizationto
TCPequilibrium
equilibriumbehaviorofTCPCC.
11/3 Globalstabilityof
TCPI

Lyapunovstabilitytheorem,LaSalle's
invarianceprinciple,passivitytheorems
ApplicationtoTCPCC
HW3(total30pts):
dueNov10Tueby
noon

Globalstabilityof
11/10
TCPII

http://courses.cms.caltech.edu/cs143/

Nov12ThurSLaway
SurveyProblem
TCPModels
Gradientprojectionalgorithmandconergence
and
ApplicationtoTCPCC
Equilibrium:
6.1,6.2(a),6.6,
4/5

5/23/2016

cs/ee143CommunicationNetworks

6.7,6.8

11/17

GeneralizedNyquiststabilitycriterion
ApplicationtolocalstabilityofTCPCCinthe
presenceoffeedbackdelay

Localstabilitywith
delay
QueueingsystemsI

QueueingsystemsII

M/M/1,M/M/1/B,M/M/c,Jacksonnetwork
HW4(total20pts):
dueNov24Tueby
noon

11/24 11/27Thur:noclass
(ThanksgivingDay)

SurveyProblem M/M/1,M/M/1/B,M/M/c,Jacksonnetwork
TCPDynamics
andStability:
7.1,7.2
Projectpresentation ProjectReport+
Inclasspresentationonboth12/1Tueand3
12/1
3
CodedueTBD
Thur

http://courses.cms.caltech.edu/cs143/

5/5