Goals for Today s Class EE 122 overview EE 122 Introduction To Communication Networks Fall 2009 MW 4 5 30 in 106 Stanley Ion Stoica TAs Junda Liu DK Moon David Zats http inst eecs berkeley edu ee122 Materials with thanks to Vern Paxson Jennifer Rexford and colleagues at UC Berkeley Goals of the course Structure of the course Instructor TAs Prereqs assignments Course grading Academic policies What makes networking challenging The fundamental issues we must grapple with to build a global Internet 1 What You Learn in This Course Protocols Layering Resource allocation Security Naming Socket programming Designing and implementing protocols Overlays peer to peer applications How to get the traffic from here to there IP best effort packet delivery service IP addressing and packet forwarding Link technologies Ethernet bridges switches Enforcing policy Defending against attacks and scale it to potentially huge structures 5 How much data to send without clogging the sender flow control or the network congestion control With some assurance quality of service or not How to control network traffic Internet Hourglass Routing intradomain interdomain Glue ARP DHCP ICMP in a way that s both efficient and stable Looking underneath IP Protocols how to structure communication Sockets how applications view the Internet Transport protocols TCP UDP Domain Name System DNS Applications Web email file transfer Network architecture resource allocation And how to build on top of the narrow waist Structure of the Course 2nd Half Then study the narrow waist of IP Differences aren t huge though My particular emphasis 4 Start at the top More emphasis on Internet technology applications practice empiricism hands on 3 More emphasis on diverse link technologies wireless mobility communication theory simulation Fall offering taught by CS faculty Internet architecture IP protocol suite Applications Web e mail P2P Structure of the Course 1st Half Spring offering taught by EE faculty Skill network programming EE122 comes in two flavors Knowledge how the Internet works What This Course Is and Isn t Insight key concepts in networking 2 Peer to peer overlays 6 1 Instructor TAs Ion Stoica istoica cs berkeley edu Junda Liu liujd eecs berkeley edu Research focus Network architectures Tracing debugging distributed systems Overlay p2p networks Office hours Tu 4 5pm F 11 12pm in 411 Soda Hall Section F 10 11am 299 Cory And by appointment Daekyeong Moon dkmoon cs berkeley edu http www cs berkeley edu istoica Office hours MW 2 3PM in 413 Soda Phone 643 4007 Office hours TuW 9 10am in 411 Soda Hall Section Tu 10 11am 293 Cory Email preferred And by appointment 7 Interact TAs David Zats dzats eecs berkeley edu Office hours TT 2 30 3 30 in 711 Soda Hall Section W 12 1pm 241 Cory Hall 8 Inevitably you won t understand something s that s my fault but you need to help Come to office hours request an appointment communicate by e mail And by appointment We are here to help including general advice TAs first line for help with programming problems Give us suggestions complaints feedback as early as you can What s your background Tell us at http tinyurl com n44c7y 9 Course Materials Strict due dates no slip days Unless otherwise specified deadlines are before lecture starts Note we jump around in it a lot W R Stevens TCP IP Illustrated Volume 1 The Protocols AddisonWesley 1993 One large project divided into two sub projects Web site http inst eecs berkeley edu ee122 Four homeworks spread over the semester Recommended on reserve J Kurose and K Ross Computer Networking A Top Down Approach 4th Edition Addison Wesley 2007 Class Workload Textbooks 10 Updated frequently including lecture slides Note if you are following the slides during lecture please don t use them to answer questions I ask Mailing list ee122 fall09 bspace berkeley edu Exams 11 Distributed game tiny World of Warcraft 1st sub project Client server teams of two 2nd sub project p2p teams of two Deadlines 11 50PM These are extensive undertakings Midterm Monday October 12 in class 4 5 30PM Final Thursday December 17 location TBA 8 11AM Closed book open crib sheet 12 2 Prerequisites CS 61A 61B Programming data structures software engineering Knowledge of C or C Math 53 or 54 Grading In fact we ll be relatively light on math though your algebra should be very solid you should know basic probability and you ll need to be comfortable with thinking abstractly Background material will not be covered in lecture TAs will spend very little time reviewing material not specific to networking Homeworks 20 5 each Projects 40 20 20 Midterm exam 15 Final exam 25 Course graded to mean of B Relatively easy to get a B harder to get an A or a C 10 A 15 A 15 B 20 B 15 B 15 C 10 C A reserved for superstars 1 or 2 per class Mean can shift up for an excellent class 13 For which the TAs have significant input 14 No Cheating Cheating means not doing the homework by yourself Fine to talk with other students about homeworks outside of class 5 Minute Break Concepts not specifics No copying no Google etc If you re unsure then ask We will do automated similarity detection on assignments Questions Before We Proceed 15 What do this two have in Common 16 The ARPANet SRI 940 UCSB IBM 360 IMPs Utah PDP 10 UCLA Sigma 7 Johann Gutenberg 1398 1468 First printing press Key idea splitting up text in individual components E g lower upper case letters Bothfirst lower cost of Bible massthe produced book The Internet distributing information 17 BBN team that implemented the interface message processor Paul Baran RAND Corp early 1960s Communications networks that would survive a major enemy attack ARPANet Research vehicle for Resource Sharing Computer Networks 2 September 1969 UCLA first node on the ARPANet December 1969 4 nodes connected by phone lines 18 3 ARPANet Evolves into Internet ARPANet SATNet PRNet 1965 TCP IP 1975 NSFNet Deregulation SaS Commercialization ASP AIP WWW 1985 1995 2008 SATNet Satelite network PRNet Radio Network Web Hosting Multiple ISPs Internet2 Backbone Internet Exchanges Application Hosting ASP Application Service Provider SaS Software as a Service Provider e commerce tookit etc 19 20 21 22 Networking Actually Not Boring Why Networking Is Challenging How hard can it be You just string a wire or other signaling path between two computers first one pushes bits down the link and the second one gets them up Right Fundamental challenge the speed of light Question how long does it take light to travel
View Full Document
Unlocking...