CS24 FRESHMAN SEMINAR FOR CS SCHOLARS WEEK 10 - NETWORKING U N I - - PowerPoint PPT Presentation

cs24
SMART_READER_LITE
LIVE PREVIEW

CS24 FRESHMAN SEMINAR FOR CS SCHOLARS WEEK 10 - NETWORKING U N I - - PowerPoint PPT Presentation

Spring 2015 - Berkeley, CA CS24 FRESHMAN SEMINAR FOR CS SCHOLARS WEEK 10 - NETWORKING U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015 2 TELEGRAPH AND BANCROFT (1960) 3


slide-1
SLIDE 1

CS24

Spring 2015 - Berkeley, CA

FRESHMAN SEMINAR FOR CS SCHOLARS

WEEK 10 - NETWORKING

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

slide-2
SLIDE 2

2

slide-3
SLIDE 3

3

TELEGRAPH AND BANCROFT (1960)

slide-4
SLIDE 4

4

http://edugeeks.in/wp-content/uploads/2013/10/osi-model-.gif

slide-5
SLIDE 5

PHYSICAL LAYER

(PHY)

ENCODING AND SIGNALING, TOPOLOGY

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 3 M A R C H 2 015

PHYSICAL TRANSMISSION MEDIA [OPTICS/COPPER]

slide-6
SLIDE 6

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

Abstraction Provided: We can send a single bit unreliably from point A to point B, where A and B are close to each other. How this is Achieved: We leave that to EE people. Example Implementations: Copper wires, wireless, optic fibres, etc.

slide-7
SLIDE 7

7

FIBER OPTICS

slide-8
SLIDE 8

DATA LINK LAYER

(DLL)

ETHERNET/ WFI/ RADIO/ ULTRASONIC

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 3 M A R C H 2 015

LOGICAL LINK CONTROL(LLC) AND MEDIA ACCESS CONTROL (MAC)

slide-9
SLIDE 9

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

Requirements: Those provided by layer 1. Abstraction Provided: Sending n bits of data reliably from point A to point B, where A and B are close to each other. How this is Achieved: Use error correcting codes in order to send n bits reliably. (This involves sending n + k bits where the k bits encode some redundant information. See CS 70 for more examples of error correcting codes.) Also, quite often the recipient will respond to the sender saying “I got the message”. The sender will keep sending the message until that happens. There are many implementations of layer 2, and each one does slightly different things. Example Implementations: Ethernet, WiFi

slide-10
SLIDE 10

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y

ERROR CODES

TWO TYPES ARQ - AUTOMATIC REPETITION REQUEST FEC - FORWARD ERROR CORRECTION REPITION CODE: 101 1 101 1 101 1 —> 101 1 01 1 1 101 1 (ERROR!) PARITY BIT: # OF ONES E.G., 101 1 —> 3… 1010 —> (ERROR!) CHECKSUM E.G. SUM(BYTE(FOR EACH CHAR IN MSG)) CRYPTO HASH FUNCTIONS

17 M A R C H 2 015

slide-11
SLIDE 11

NETWORK LAYER

(NET)

INTERNET PROTOCOL (IP), GATEWAYS, ROUTERS

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 3 M A R C H 2 015

IPV4, IPV6 ADDRESSING

slide-12
SLIDE 12

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

Requirements: Those provided by layer 2, the existence of people needing a large network Abstraction Provided: Sending data unreliably (explained later) from point A to point B, where A and B are somewhere

  • n Earth (not necessarily close to each other).

Implementations: Build a graph of all devices connected to the Internet. The vertices of the graph are the devices, the edges are links between devices. (Devices linked by an edge can communicate using layer 2.) In order to send messages to anyone, you send it to a neighbor, who forwards it on, who forwards it on… until it reaches the destination.

slide-13
SLIDE 13

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

Every device gets an IP address, which is just like a mailing address. When we want to connect to another device, we send out a “packet” (sequence of bits) whose destination is that device’s IP address.

INTERNET PROTOCOL (IP) ADDRESS

slide-14
SLIDE 14

14

THE SLOWNESS THAT IS AIRBEARS

slide-15
SLIDE 15

TRANSPORT LAYER

TRANSMISSION CONTROL PROTOCOL

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 3 M A R C H 2 015

USER DATAGRAM PACKETS (UDP)

slide-16
SLIDE 16

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

Requirements: Layer 3. Abstraction Provided: Depends on the protocol. Usually it allows you to transfer data between programs (in layer 3, we were only concerned with transferring data between devices

  • but if each device has multiple programs running, how do

we know to which program we should deliver the data?) It can also provide reliability, in-order delivery, and other such guarantees. How this is Achieved: See CS 168. The key idea for transferring data between programs is port numbers, which are “addresses” for each program (just like how IP addresses are “addresses” for each device).

slide-17
SLIDE 17

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

Why is this a separate layer from layer 3? There is one key difference - layer 4 is implemented exclusively at the endpoints of the data transfer. That is, when I want to send some data from my computer in Berkeley to India, the relevant layer 4 protocols run on my computer and on the computer in India - nowhere else. On the other hand, in layer 3, the relevant protocols are running on all of the routers and devices along the path from my computer to the computer in India. Example Implementations: TCP, UDP and ICMP are the most common ones. The World Wide Web (aka websites) uses

  • TCP. Skype and other streaming applications use UDP. DNS

uses UDP. The ping command on Unix systems uses ICMP.

slide-18
SLIDE 18

THE OTHER LAYERS

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y

SESSION LAYER

USER-COMPUTER SESSION CONTROL

PRESENTATION

FORMATTING

APPLICATION

CHOOSING WHAT TO COMMUNICATE

3 M A R C H 2 015

slide-19
SLIDE 19

THE INTERNET OF EVERYDAY THINGS

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 31 M A R C H 2 015

slide-20
SLIDE 20

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y

TODOS

RECIPES AND TOPICS DUE ON APRIL 12 SUMMARIES DUE AT THE END OF SEMESTER - MAY 8

17 M A R C H 2 015

slide-21
SLIDE 21

Week 1 1

QUESTIONS ?

PHYSICAL COMPUTING / WORK SESSION?

U N I V E R S I T Y O F C A L I F O R N I A - B E R K E L E Y 2 4 F E B R U A R Y 2 015