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

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

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

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

CS 268: Computer Networking

L-1 Intro to Computer Networks

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

2

Outline

• Administrivia

• Layering

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

3

Dramatis Personae

• Professor: Randy H. Katz• Web: http://www.cs.Berkeley.edu/~randy • Facebook: http://www.facebook.com/randy.katz • Email: [email protected] • Office hours: M 3:00-4:00, W 1:00-2:00, 413 Soda Hall

• Sorry, no Teaching Assistant!• Course Info

• Web: http://www.cs.Berkeley.edu/~randy/Courses/CS268.F09 • Blog: http://cs268computernetworking.blogspot.com/

• Group: http://www.facebook.com/group.php?gid=145286190238

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

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

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

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 decisions

appropriate for wireless networks, sensor networks, real-time networks, enterprise networks, datacenter networks, etc.?

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

6

Web Page

• Check regularly!!

• Course schedule

• Reading list

• Lecture notes

• Announcements

• Project ideas

• Exams

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

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?

• Select another student’s blog entry to critique before class; change each class meeting

7

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

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

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

Laptop Policy

• Closed Laptops!• Focus on in class discussion

—this worked very well last year• I will minimize use of powerpoint myself

—white board• Check your email/twitter/facebook

updates at the mid-lecture break

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

10

Course Grading

• Class + paper blog participation (20%)• Ensures 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• Ensures you understood the papers

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

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?

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

12

Lecture Topics

Traditional• Layering• Internet architecture• Routing (IP)• Transport (TCP)• Queue management

(FQ, RED)• Naming (DNS)

Recent Topics• Botnets• Datacenter networking• Multicast• Mobility/wireless• Network energy• Network measurement• Overlay networks• P2P applications

Modified from F08 based on feedback from last year’s class:QoS, SensorNets, “Future Network” Architecture eliminated

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

13

Outline

• Administrivia

• Layering

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

14

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

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

15

Back in the Old Days…

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

16

Packet Switching (Internet)

Packets

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

17

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

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

18

Characteristics of Packet Switching

• Store and forward• Packets are self contained units• Can use alternate paths – reordering

• Contention• Congestion• Delay

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

19

Internet[work]

Internet[work]

• A collection of interconnected networks

• Host: network endpoints (computer, PDA, light switch, …)

• Router: node that connects networks

• Internet vs. internet

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

20

Challenge

• Many differences between networks• Address formats• Performance – bandwidth/latency• Packet size• Loss rate/pattern/handling• Routing

• How to translate between various network technologies?

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

21

How To Find Nodes?

Internet

Computer 1 Computer 2

Need naming and routing

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

22

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

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

23

Routing

R

R

R

RRH

H

H

H

R

RH

R

Routers send packet towards

destination

H: Hosts

R: Routers

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

24

Meeting Application Demands

• Reliability• Corruption• Lost packets

• Flow and congestion control

• Fragmentation

• In-order delivery

• Etc…

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

25

What if the Data gets Corrupted?

InternetGET windex.htmlGET index.html

Solution: Add a checksum

Problem: Data Corruption

0,9 9 6,7,8 21 4,5 7 1,2,3 6X

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

26

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

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

27

What if the Data gets Lost?

InternetGET index.html

Problem: Lost Data

InternetGET index.html

Solution: Timeout and Retransmit

GET index.htmlGET index.html

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

28

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

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

29

Solution: Add Sequence Numbers

Problem: Out of Order

What if the Data is Out of Order?

GETx.htindeml

GET x.htindeml

GET index.html

ml 4 inde 2 x.ht 3 GET 1

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

30

Lots of Functions Needed

• Link

• Multiplexing

• Routing

• Addressing/naming (locating peers)

• Reliability

• Flow control

• Fragmentation

• Etc….

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

31

What is Layering?

• Modular approach to network functionality

• Example:

Link hardware

Host-to-host connectivity

Application-to-application channels

Application

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

32

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

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

33

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)

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

34

Layering

Host Host

Application

Transport

Network

Link

User A User B

Layering: technique to simplify complex systems

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

35

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

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

36

OSI Layers and Locations

Switch RouterHost Host

Application

Transport

Network

Data Link

Presentation

Session

Physical

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

39

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

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

40

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