1. CS 268: Computer Networking L-1 Intro to Computer Networks

2. 2 Outline Administrivia Layering

3. 3 Dramatis Personae Professor: Randy H. Katz Web: http://www.cs.Berkeley.edu/~randyhttp://www.cs.Berkeley.edu/~randy Facebook: http://berkeley.facebook.com/people/Randy_Howard_Katz/1241523 http://berkeley.facebook.com/people/Randy_Howard_Katz/1241523 Email: randy@cs.Berkeley.edurandy@cs.Berkeley.edu Office hours: Tu 1:00-2:00, W 3:00-4:00, 413 Soda Hall Sorry, no Teaching Assistant! Course Info Web: http://www.cs.Berkeley.edu/~randy/Courses/CS268.F08http://www.cs.Berkeley.edu/~randy/Courses/CS268.F08 Blog: http://cs268computernetworking.blogspot.com/http://cs268computernetworking.blogspot.com/ Group: http://www.facebook.com/group.php?gid=38216023232http://www.facebook.com/group.php?gid=38216023232

4. 4 Goals and Objectives Understand state-of-the-art in network protocols, architectures, and applications Understand process of networking research Typical constraints and thought processes used in networking research Different from undergraduate networking (EECS 122) i.e., training network programmers vs. training network researchers

5. When Thinking About Research … “Look for what is so obvious to everyone else that it’s no longer on their radar, and put it on yours. Seek to uncover assumptions so implicit, they are no longer being questioned. Question them.” Rodney Brooks, Co-director of CSAIL, MIT Particularly relevant advice for network research Is the current network architecture and decisons appropriate for wireless networks, sensor networks, real-time networks, enterprise networks, datacenter networks, etc.?

6. 6 Web Page Check regularly!! Course schedule Reading list Lecture notes Announcements Project ideas Exams

7. CS 268 Blog Assignments For each lecture, you will create a “public review” of paper(s) due for that class that: Briefly summarizes paper (1-2 paragraphs) Provides background/related material (1-2 paragraphs) Critiques paper and suggests discussion topics (2-3 paragraph) Try to be positive… Why or why not keep this paper in syllabus? What issues are left open for future research? What are the important implications of the work? 7

8. 8 Materials on Course Syllabus Page Research papers Links to pdfs on Web page Two papers per class meeting Combination of classic and recent work ~40 papers Lecture Notes ppt posted, but I will minimize its in-class usage Seminar/discussion style and participation counts! Recommended textbooks For those who need to review their networking background Peterson & Davie/4ed or Kurose & Ross/4ed

9. 9 Course Grading Class + paper blog participation (20%) Makes sure that you read the papers before class Two person research project (40%) Substantial independent research project You learn a lot by working together Several class meetings dedicated to projects Two Quizzes (40%) Closed book, in-class Makes sure that you understood the papers

10. What about the Waitlist? We should be able to accommodate all graduate students who want to take the class Undergraduate students should talk to me to determine if this is the right course for them Undergraduates will have to partner with another undergrad to do a research project 10

11. 11 Class Topic Coverage Little on physical and data link layer Little on undergraduate material Supposedly you already know this, though some revisiting/overlap is unavoidable Focus on the why, not the what Focus on network to application layer We will deal with: Protocol rules and algorithms Investigate protocol trade-offs Why this way and not another?

12. 12 Lecture Topics Traditional Layering Internet architecture Routing (IP) Transport (TCP) Queue management (FQ, RED) Naming (DNS) Recent Topics Multicast Mobility/wireless Active networks QoS Network measurement Overlay networks P2P applications Datacenter networking

13. Laptop Policy Should we have an open/closed laptop policy? Good for viewing/annotating papers and electronic note taking Bad for distractions (chat, ebay, email, facebook, solitaire, twitter, etc.,...) Class vote -- you choose!

14. 14 Outline Administrivia Layering

15. 15 What is the Objective of Networking? Communication between applications on different computers Must understand application needs/demands Traffic data rate Traffic pattern (bursty or constant bit rate) Traffic target (multipoint or single destination, mobile or fixed) Delay sensitivity Loss sensitivity

16. 16 Back in the Old Days…

17. 17 Packet Switching (Internet) Packets

18. 18 Packet Switching Interleave packets from different sources Efficient: resources used on demand Statistical multiplexing General Multiple types of applications Accommodates bursty traffic Addition of queues

19. 19 Characteristics of Packet Switching Store and forward Packets are self contained units Can use alternate paths – reordering Contention Congestion Delay

20. 20 Internet[work] A collection of interconnected networks Host: network endpoints (computer, PDA, light switch, …) Router: node that connects networks Internet vs. internet

21. 21 Challenge Many differences between networks Address formats Performance – bandwidth/latency Packet size Loss rate/pattern/handling Routing How to translate between various network technologies?

22. 22 How To Find Nodes? Internet Computer 1Computer 2 Need naming and routing

23. 23 Naming What’s the IP address for www.cmu.edu? It is 128.2.11.43 Translates human readable names to logical endpoints Local DNS ServerComputer 1

24. 24 Routing R R R R R H H H H R R H R Routers send packet towards destination H: Hosts R: Routers

25. 25 Meeting Application Demands Reliability Corruption Lost packets Flow and congestion control Fragmentation In-order delivery Etc…

26. 26 What if the Data gets Corrupted? Internet GET windex.htmlGET index.html Solution: Add a checksum Problem: Data Corruption 0,996,7,8214,571,2,36 X

27. 27 What if Network is Overloaded? Problem: Network Overload Short bursts: buffer What if buffer overflows? Packets dropped Sender adjusts rate until load = resources  “congestion control” Solution: Buffering and Congestion Control

28. 28 What if the Data gets Lost? Internet GET index.html Problem: Lost Data Internet GET index.html Solution: Timeout and Retransmit GET index.html

29. 29 Problem: Packet size Solution: Fragment data across packets What if the Data Doesn’t Fit? On Ethernet, max IP packet is 1.5kbytes Typical web page is 10kbytes GETindex.html GET index.html

30. 30 Solution: Add Sequence Numbers Problem: Out of Order What if the Data is Out of Order? GETx.htindeml GET x.htindeml GET index.html ml4inde2x.ht3GET1

31. 31 Lots of Functions Needed Link Multiplexing Routing Addressing/naming (locating peers) Reliability Flow control Fragmentation Etc….

32. 32 What is Layering? Modular approach to network functionality Example: Link hardware Host-to-host connectivity Application-to-application channels Application

33. 33 Protocols Module in layered structure Set of rules governing communication between network elements (applications, hosts, routers) Protocols define: Interface to higher layers (API) Interface to peer Format and order of messages Actions taken on receipt of a message

34. 34 Layering Characteristics Each layer relies on services from layer below and exports services to layer above Interface defines interaction Hides implementation - layers can change without disturbing other layers (black box)

35. 35 Layering Host Application Transport Network Link User AUser B Layering: technique to simplify complex systems

36. 36 E.g.: OSI Model: 7 Protocol Layers Physical: how to transmit bits Data link: how to transmit frames Network: how to route packets Transport: how to send packets end2end Session: how to tie flows together Presentation: byte ordering, security Application: everything else

37. 37 OSI Layers and Locations Switch Router Host Application Transport Network Data Link Presentation Session Physical

38. 38 Layer Encapsulation Get index.html Connection ID Source/Destination Link Address User AUser B

39. 39 Protocol Demultiplexing Multiple choices at each layer FTPHTTPTFTPNV TCPUDP IP NET 1 NET 2 NET n … TCP/UDPIP IPX Port Number Network Protocol Field Type Field

40. 40 Is Layering Harmful? Sometimes … Layer N may duplicate lower level functionality (e.g., error recovery) Layers may need same info (timestamp, MTU) Strict adherence to layering may hurt performance

41. 41 Next Lecture: Design Considerations How to determine split of functionality Across protocol layers Across network nodes Assigned Reading R1: End-to-end Arguments in System Design R2: Design Philosophy of the DARPA Internet Protocols Friend me on Facebook so I can invite you to join the CS 268 facebook group Set up your blog site and send me its URL