Computer Networks

Chan Yeob Yeun

Lecture 3

OSI vs. TCP/IP

OSI
TCP/IP
MODEL

APPLICATION
7 APPLICATION

Worldwide Web: http

PRESENTATION Remote Login: telnet, rlogin
6 Remote Commands: rexec, rsh
File Transfers: ftp, rcp, tftp, UUCP
E-mail: SMTP, POP3, IMAP
SESSION Remote File Systems: NIS/NFS, RPC
5

TRANSPORT
TRANSPORT
4 Tranmission Control Protocol (TCP)
User Datagram Protocol (UDP)
INTERNETWORKING
NETWORK
3 Internet Protocol (IP)
Internet Control Message Protocol (ICMP)
NETWORK INTERFACE
DATA LINK
&
2
HARDWARE
CONNECTIONS
PHYSICAL
LAN: Ethernet, Token Ring, FDDI, ATM...
1
WAN: SLIP/PPP, X.25, Frame Relay...

P2

1
Chapter 1
Introduction
A note on the use of these ppt slides:
We’re making these slides freely available to all (faculty, students, readers).
They’re in PowerPoint form so you see the animations; and can add, modify,
and delete slides (including this one) and slide content to suit your needs.
They obviously represent a lot of work on our part. In return for use, we only
Computer
ask the following:
Networking: A Top
 If you use these slides (e.g., in a class) that you mention their source
Down Approach
(after all, we’d like people to use our book!) Global edition
 If you post any slides on a www site, that you note that they are adapted
from (or perhaps identical to) our slides, and note our copyright of this
James Kurose, Keith Ross
material. Pearson
Thanks and enjoy! JFK/KWR
November 2016
All material copyright 1996-2016
J.F Kurose and K.W. Ross, All Rights Reserved

Introduction 1-3

Packet loss
 queue (aka buffer) preceding link in buffer has finite
capacity
 packet arriving to full queue dropped (aka lost)
 lost packet may be retransmitted by previous node,
by source end system, or not at all

buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost
* Check out the Java applet for an interactive animation on queuing and loss Introduction 1-4

2
Throughput
 throughput: rate (bits/time unit) at which bits
transferred between sender/receiver
 instantaneous: rate at given point in time
 average: rate over longer period of time

server,
server withbits
sends linkpipe
capacity
that can carry linkpipe
capacity
that can carry
file of F
(fluid) intobitspipe Rs bits/sec
fluid at rate Rc bits/sec
fluid at rate
to send to client Rs bits/sec) Rc bits/sec)

Introduction 1-5

Throughput (more)
 Rs < Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

 Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

bottleneck link
link on end-end path that constrains end-end throughput
Introduction 1-6

3
Throughput: Internet scenario

 per-connection end-
end throughput: Rs
min(Rc,Rs,R/10) Rs Rs
 in practice: Rc or Rs
is often bottleneck
R

Rc Rc

Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction 1-7

Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-8

4
Protocol “layers”
Networks are complex,
with many “pieces”:
 hosts Question:
 routers is there any hope of
 links of various organizing structure of
media network?
 applications
 protocols …. or at least our
 hardware, discussion of networks?
software

Introduction 1-9

Organization of air travel

ticket (purchase) ticket (complain)

baggage (check) baggage (claim)

gates (load) gates (unload)

runway takeoff runway landing

airplane routing airplane routing

airplane routing

 a series of steps

Introduction 1-10

5
Layering of airline functionality

ticket (purchase) ticket (complain) ticket

baggage (check) baggage (claim baggage

gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

airplane routing airplane routing airplane routing airplane routing airplane routing

departure intermediate air-traffic arrival

airport control centers airport

layers: each layer implements a service

 via its own internal-layer actions
 relying on services provided by layer below

Introduction 1-11

Why layering?
dealing with complex systems:
 explicit structure allows identification,
relationship of complex system’s pieces
 layered reference model for discussion
 modularization eases maintenance, updating of
system
 change of implementation of layer’s service
transparent to rest of system
 e.g., change in gate procedure doesn’t affect rest of
system
 layering considered harmful?

Introduction 1-12

6
Internet protocol stack
 application: supporting network
applications
 FTP, SMTP, HTTP application
 transport: process-process data
transfer transport
 TCP, UDP
network
 network: routing of datagrams
from source to destination
link
 IP, routing protocols
 link: data transfer between physical
neighboring network elements
 Ethernet, 802.111 (WiFi), PPP
 physical: bits “on the wire”
Introduction 1-13

ISO/OSI reference model

 presentation: allow applications
to interpret meaning of data, application
e.g., encryption, compression,
machine-specific conventions presentation
 session: synchronization, session
checkpointing, recovery of data transport
exchange
network
 Internet stack “missing” these
layers! link
 these services, if needed, must be physical
implemented in application
 needed?

Introduction 1-14

7
 message M
source
application
Encapsulation
segment Ht M transport
datagram Hn Ht M network
frame Hl Hn Ht M link
physical
link
physical

switch

destination Hn Ht M network
M application Hl Hn Ht M link Hn Ht M
Ht M transport physical
Hn Ht M network
Hl Hn Ht M link router
physical

Introduction 1-15

Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-16

8
Network security
 field of network security:
 how bad guys can attack computer networks
 how we can defend networks against attacks
 how to design architectures that are immune to
attacks
 Internet not originally designed with (much)
security in mind
 original vision: “a group of mutually trusting users
attached to a transparent network” 
 Internet protocol designers playing “catch-up”
 security considerations in all layers!

Introduction 1-17

Bad guys: put malware into hosts via Internet

 malware can get in host from:
 virus: self-replicating infection by receiving/executing
object (e.g., e-mail attachment)
 worm: self-replicating infection by passively receiving
object that gets itself executed
 spyware malware can record keystrokes, web
sites visited, upload info to collection site
 infected host can be enrolled in botnet, used for
spam. DDoS attacks

Introduction 1-18

9
Bad guys: attack server, network infrastructure
Denial of Service (DoS): attackers make resources
(server, bandwidth) unavailable to legitimate traffic
by overwhelming resource with bogus traffic

1. select target
2. break into hosts around
the network (see botnet)
3. send packets to target from
compromised hosts
target

Introduction 1-19

Bad guys can sniff packets

packet “sniffing”:
 broadcast media (shared ethernet, wireless)
 promiscuous network interface reads/records all packets
(e.g., including passwords!) passing by

A C

src:B dest:A payload

B

 wireshark software used for end-of-chapter labs is a

(free) packet-sniffer
Introduction 1-20

10
Bad guys can use fake addresses
IP spoofing: send packet with false source address
A C

src:B dest:A payload

… lots more on security (throughout, Chapter 8)

Introduction 1-21

Introduction: summary
covered a “ton” of material! you now have:
 Internet overview  context, overview, “feel”
 what’s a protocol? of networking
 network edge, core, access  more depth, detail to
network follow!
 packet-switching versus
circuit-switching
 Internet structure
 performance: loss, delay,
throughput
 layering, service models
 security
 history

Introduction 1-22

11