CS 268: Graduate Computer s Spring 2006 Instructor: Ion Stoica (istoica@cs.berkeley.edu, 645 Soda Hall) Lecture time: MW, 1:00-2:30pm Place: 320 Soda Hall Office hour: W 2:30-4pm 1 Overview Administrative trivia Overview and history of the Internet A Taxonomy of s 2 Page 1
Administrative Trivia s Course Web page: - http://www.cs.berkeley.edu/~istoica/cs268/06/ - Check it periodically to get the latest information Deadlines - Unless otherwise specified, it means 10 minutes before the lecture - Special circumstances should be brought to me attention ahead of deadlines 3 Goals of this Course Understand - How does the Internet work? - What are the Internet s design principles? - Where is the Internet heading to? Get familiar with current Internet research efforts Understand solutions in context - Goals - Assumptions 4 Page 2
Goals of this Course (cont d) Appreciate what is good research - Problem selection - Solution & research methodology - Presentation Apply what you learned in a class project 5 What Do You Need To Do? A research-oriented class project Two exams Paper reading One 20min paper presentation 6 Page 3
Research Project Investigate new ideas and solutions in a class research project - Define the problem - Execute the research - Work with your partner - Write up and present your research Ideally, best projects will become conference papers (e.g., SIGCOMM, INFOCOM, MOBICOM) 7 Research Project: Steps I ll distribute a list of projects - You can either choose one of these projects or come up with your own Pick your project, partner, and submit a one page proposal describing: - The problem you are solving - Your plan of attack with milestones and dates - Any special resources you may need A midterm presentation of your progress (8-10 minutes) Poster session Submit project papers 8 Page 4
Paper Reviews Goal: synthesize main ideas and concepts in the papers Number: around two papers per class Length: no more than half page per paper Content - Main points intended by the author - Points you particularly liked/disliked - Other comments (writing, conclusions ) Submission: - Submit each review via e-mail before the class on lecture day - See class web page for details 9 Grading Term project Midterm exam Final exam Class participation and presentation Paper reviews 50% 10% 15% 15% 10% This is a graduate networking class: more important is what you realize/learn than the grade 10 Page 5
Enrollment Policy Graduate students get highest priority Among other students, priority is given to those who - Have backgrounds in networking, operating systems - Have relatively light course load Procedure of enrollment for undergraduate students - Be officially on the waiting list - Send me an email with URL that has pointers to Your resume or cv A short statement of relevant courses (textbook, university, grade) and experience Other courses you are taking this semester 11 Send the Following Information Please send me (istoica@cs.berkeley.edu ) an e- mail with the subject cs268 registration" and the following information: - Last and first name - Student ID - Your department - Preferred email address - URL of your home page 12 Page 6
Overview Administrative trivia Overview and history of the Internet A Taxonomy of s 13 The Internet (cont d) Global scale, general purpose, heterogeneoustechnologies, public, computer network Internet Protocol - Open standard: Internet Engineering Task Force (IETF) as standard body ( http://www.ietf.org ) - Technical basis for other types of networks Intranet: enterprise IP network Developed by the research community 14 Page 7
History of the Internet 70 s: started as a research project, 56 kbps, < 100 computers 80-83: ARPANET and MILNET split, 85-86: NSF builds NSFNET as backbone, links 6 Supercomputer centers, 1.5 Mbps, 10,000 computers 87-90: link regional networks, NSI (NASA), ESNet(DOE), DARTnet, TWBNet (DARPA), 100,000 computers 90-92: NSFNET moves to 45 Mbps, 16 mid-level networks 94: NSF backbone dismantled, multiple private backbones Today: backbones run at >10 Gbps, >300 millions computers in 150 countries 15 Time Line of the Internet Source: Internet Society 16 Page 8
Growth of the Internet Number of Hosts on the Internet: Aug. 1981 213 Oct. 1984 1,024 Dec. 1987 28,174 Oct. 1990 313,000 Oct. 1993 2,056,000 Apr. 1995 5,706,000 Jan. 1997 16,146,000 Jan. 1999 56,218,000 Jan. 2001 109,374,000 Jan. 2003 171,638,297 Jul 2004 285,139,107 Jul 2005 353,284,187 17 OC1 OC1 (45 (45 Mbps), Mbps), OC2 OC2 (155 (155 Mbps), Mbps),,, OC192 OC192 (10 (10 Gbps)18 Page 9
Services Provided by the Internet Shared access to computing resources - Telnet (1970 s) Shared access to data/files - FTP, NFS, AFS (1980 s) medium over which people interact - Email (1980 s), on-line chat rooms (1990 s) - Instant messaging, IP Telephony (2000 s) A medium for information dissemination - USENET (1980 s) - WWW (1990 s) Replacing newspaper, magazine - Audio, video (2000 s): peer-to-peer systems Replacing radio, telephony, TV, 19 Overview Administrative trivia Overview and history of the Internet A Taxonomy of s 20 Page 10
A Taxonomy of s networks can be classified based on the way in which the nodes exchange information: Switched Broadcast Circuit-Switched Packet-Switched Datagram Virtual Circuit 21 Broadcast vs. Switched s Broadcast communication networks - Information transmitted by any node is received by every other node in the network E.g., LANs (Ethernet, Wavelan) - Problem: coordinate the access of all nodes to the shared communication medium (Multiple Access Problem) Switched communication networks - Information is transmitted to a sub-set of designated nodes E.g., WANs (Telephony, Internet) - Problem: how to forward information to intended node(s) Done by special nodes (e.g., routers, switches) running routing protocols 22 Page 11
A Taxonomy of s networks can be classified based on the way in which the nodes exchange information: Switched Broadcast Circuit-Switched Packet-Switched Datagram Virtual Circuit 23 Circuit Switching Three phases 1. circuit establishment 2. data transfer 3. circuit termination If circuit not available: Busy signal Examples - Telephone networks - ISDN (Integrated Services Digital s) 24 Page 12
Timing in Circuit Switching Host 1 Host 2 Node 1 Node 2 Circuit Establishment Data Transmission processing delay at Node 1 DATA propagation delay between Host 1 and Node 1 propagation delay between Host 2 and Node 1 Circuit Termination 25 Circuit Switching A node (switch) in a circuit switching network incoming links Node outgoing links 26 Page 13
Circuit Switching: Multiplexing/Demultiplexing Time divided in frames and frames divided in slots Relative slot position inside a frame determines which conversation the data belongs to Needs synchronization between sender and receiver In case of non-permanent conversations - Needs to dynamic bind a slot to a conservation - How to do this? 27 A Taxonomy of s networks can be classified based on the way in which the nodes exchange information: Switched Broadcast Circuit-Switched Packet-Switched Datagram Virtual Circuit 28 Page 14
Packet Switching At each node the entire packet is received, stored, and then forwarded to the next node (Store-and-Forward s) incoming links Node Memory outgoing links 29 Packet Switching: Multiplexing/Demultiplexing Data from any conversation can be transmitted at any given time How to tell them apart? - Use meta-data (header) to describe data 30 Page 15
A Taxonomy of s networks can be classified based on the way in which the nodes exchange information: Switched Broadcast Circuit-Switched Packet-Switched Datagram Virtual Circuit 31 Datagram Packet Switching Each packet is independently switched - Each packet header contains destination address No resources are pre-allocated (reserved) in advance Example: IP networks 32 Page 16
Timing of Datagram Packet Switching Host 1 Host 2 Node 1 Node 2 transmission time of Packet 1 at Host 1 Packet 1 Packet 2 Packet 3 propagation delay between Host 1 and Node 2 Packet 1 Packet 2 Packet 3 processing delay of Packet 1 at Node 2 Packet 1 Packet 2 Packet 3 33 Datagram Packet Switching Host C Host A Host D Node 1 Node 2 Node 3 Node 5 Host B Node 4 Node 6 Node 7 Host E 34 Page 17
A Taxonomy of s networks can be classified based on the way in which the nodes exchange information: Switched Broadcast Circuit-Switched Packet-Switched Datagram Virtual Circuit 35 Virtual-Circuit Packet Switching Hybrid of circuit switching and packet switching - Data is transmitted as packets - All packets from one packet stream are sent along a pre-established path (=virtual circuit) Guarantees in-sequence delivery of packets However: Packets from different virtual circuits may be interleaved Example: ATM networks 36 Page 18
Virtual-Circuit Packet Switching with virtual circuits takes place in three phases 1. VC establishment 2. data transfer 3. VC disconnect Note: packet headers don t need to contain the full destination address of the packet 37 Timing of Datagram Packet Switching Host 1 Host 2 Node 1 Node 2 VC establishment propagation delay between Host 1 and Node 1 Packet 1 Data transfer Packet 2 Packet 3 Packet 1 Packet 2 Packet 3 Packet 1 Packet 2 VC termination Packet 3 38 Page 19
Packet-Switching vs. Circuit-Switching Most important advantage of packet-switching over circuit switching: ability to exploit statistical multiplexing: - Efficient bandwidth usage; ratio between peek and average rate is 3:1 for audio, and 15:1 for data traffic However, packet-switching needs to deal with congestion: - More complex routers - Harder to provide good network services (e.g., delay and bandwidth guarantees) In practice they are combined: - IP over SONET, IP over Frame Relay 39 Summary Course administrative trivia Internet history and trivia Rest of the course a lot more technical and (hopefully) more exciting 40 Page 20